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

[aditya siram]

Knot-tying has a page [1].
-deech

[1] http://www.haskell.org/haskellwiki/Tying_the_Knot


On Wed, Mar 16, 2011 at 10:42 AM, Andrew Coppin
<andrewcoppin at btinternet.com> wrote:
> 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"...)
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>