Issue 16
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 http://code.haskell.org/~byorgey/TMR/Issue16
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.
On page 44, I think the “0 <= i <= k" should be "0 <= i < k".
Tom
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).
Brent
June 23, 2010 at 1:01 pm
You are correct, Brent.
Louis
August 31, 2010 at 7:45 pm