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"...)