I am pleased to announce thatMini-issue 24 of The Monad Reader is now available. It is a “mini-issue” because it consists of one article: “Predicates, Trees and GADTs” by Benjamin Hodgson.

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

git clone https://github.com/ezyang/tmr-issue24.git

If you’d like to write something for The Monad Reader, please get in touch!

I am pleased to announce thatIssue 23 of the Monad Reader is now available.

Issue 23 consists of the following five articles:

• FizzBuzz in Haskell by Embedding a Domain-Specific Language by Maciej Pírog
• Supercompilation: Ideas and Methods (+appendix) by Ilya Klyuchnikov and Dimitur Krustev
• A Haskell sound specification DSL: Ludic support and deep immersion in Nordic technology-supported LARP by Henrik Bäärnhielm, Daniel Sundström and Mikael Vejdemo-Johansson
• MFlow, a continuation-based web framework without continuations by Alberto Gomez Corona
• Practical Type System Benefits by Neil Brown

This time around, I have individual article files for each (and the supercompilation article has an extra appendix not included in the full issue PDF).

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

git clone https://github.com/ezyang/tmr-issue23.git

If you’d like to write something for Issue 24, please get in touch!

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

Issue 22 consists of the following three articles:

• Generalized Algebraic Data Types in Haskell by Anton Dergunov
• Error Reporting Parsers: a Monad Transformer Approach by Matt Fenwick and Jay Vyas
• Two Monoids for Approximating NP-Complete Problems by Mike Izbicki

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

git clone https://github.com/ezyang/tmr-issue22.git

If you’d like to write something for Issue 23, please get in touch!

Errata. Unfortunately there were several mistakes in the “Generalized Algebraic Data Types in Haskell” tutorial article which were recently fixed (many thanks to Shachaf Ben-Kiki and vituscze for pointing them out):

1. On page 9 of the article “error” function was used in “evaluate”
function, but in this context “fail” is cleaner.

2. On page 22 there was a typo: shortest paths are those “containing only *red* nodes”.

3. On page 24 we presented two alternative ways to define “Tree” data type: via GADTs and existential types. The latter definition contained an error. Correct definition is:

data Tree a = forall bh. Root (Node a bh)

I am pleased to announce thatIssue 21 of The Monad Reader is now available.

Issue 21 consists of the following two articles:

• A Functional Approach to Neural Networks by Amy de Buitléir, Michael Russell, Mark Daly
• Haskell ab initio: the Hartree-Fock Method in Haskellby Felipe Zapata, Angel J. Alvarez

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

git clone https://github.com/ezyang/tmr-issue21.git

If you’d like to write something for Issue 22, please get in touch!

It’s not dead, it’s resting!I am pleased to announce thatIssue 20 of the Monad Reader is now available.

Issue 20 consists of the following three articles:

• Enumeration of Tuples with Hyperplanes by Tillmann Vogt
• Understanding Basic Haskell Error Messagesby Jan Stolarek
• The MapReduce type of a Monad by Julian Porter

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

git clone https://github.com/ezyang/tmr-issue20.git

If you’d like to write something for Issue 21, please get in touch!

I am pleased to announce that Issue 19 of The Monad.Reader, a special issue on parallelism and concurrency, isnow available.

Issue 19 consists of the following three articles:

• Mighttpd – a High Performance Web Server in Haskell by Kazu Yamamoto
• High Performance Haskell with MPI by Bernie Pope and Dmitry Astapov
• Coroutine Pipelines by Mario Blažević

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

darcs gethttp://code.haskell.org/~byorgey/TMR/Issue19

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

I am pleased to announce thatIssue 18 of The Monad.Reader is now available.

Issue 18 consists of the following three articles:

• MapReduce as a Monad by Julian Porter
• Fun with Parallel Monad Comprehensions by Tomas Petricek
• Attributed Variables: Their Uses and One Implementation by Douglas M. Auclair

Feel free to browse the source files. You can check out the entire repository using darcs (or simply visit the below URL in your browser):

darcs gethttp://code.haskell.org/~byorgey/TMR/Issue18

Enjoy!

I am pleased to announce that thespecial Poetry and Fiction Edition of The Monad.Reader is now available. Enjoy!

Also, the submission deadline for Issue 18 has been extended one week, to Friday, April 8. Please get in touch if you would like to submit something!

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

Issue 17 consists of the following three articles:

• List Leads Off with the Letter Lambda by Douglas M. Auclair
• The InterleaveT Abstraction: Alternative with Flexible Ordering by Neil Brown
• The Reader Monad and Abstraction Elimination by Petr Pudlak

Feel free tobrowse the source files. You can check out the entire repository usingdarcs:

darcs get http://code.haskell.org/~byorgey/TMR/Issue17

Watch for a special announcement regarding Issue 18 soon!

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 tobrowse the source files. You can check out the entire repository usingdarcs:

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.