[Haskell-cafe] ANN: Monad.Reader special Poetry and Fiction Edition

Andrew Coppin andrewcoppin at btinternet.com
Wed Mar 16 16:42:09 CET 2011

On 16/03/2011 03:05 PM, Brent Yorgey wrote:

> This kind of "knot-tying" approach is nice for static graphs.

I think we should have a wiki page somewhere which explains what all the 
various Haskell-related terms mean. Terms like "typing the knot" and 
"finally tagless". (Not to mention "Oleg rating"...)

More information about the Haskell-Cafe mailing list