The Monad.Reader

Binding your input since 2005

Issue 16

with 3 comments

I am very pleased to announce that Issue 16 of The Monad.Reader is now available.

Issue 16 consists of the following three articles:

  • Demand More of Your Automata by Aran Donohue
  • Iteratee: Teaching an Old Fold New Tricks by John W. Lato
  • Playing with Priority Queues by Louis Wasserman

Feel free to browse the source files. You can check out the entire repository using darcs:

darcs get

If you’d like to write something for Issue 17, please get in touch. The deadline will likely be sometime in September; more details will be forthcoming.

Written by Brent

May 12, 2010 at 6:12 pm

Posted in Issues

3 Responses

Subscribe to comments with RSS.

  1. On page 44, I think the “0 <= i <= k" should be "0 <= i < k".


    June 2, 2010 at 5:21 pm

    • I’m presuming to speak for Louis here, but I’m pretty sure the 0 <= i <= k is correct. Note it is defining a binomial tree of rank (k+1).


      June 23, 2010 at 1:01 pm

      • You are correct, Brent.


        August 31, 2010 at 7:45 pm

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: