Previous Entry Share Flag Next Entry
11:12 pm, 23 May 06

i find this hilarious

From the Haskell mailing list:
My favorite view of Haskell semantics is of a coroutining abstract machine which alternates between evaluating lambda terms to obtain the terms of a process calculus, and then reducing those process calculus terms; some process calculus reduction rules call into the lambda reduction engine to grow more (process calculus) terms to reduce. The observable behavior of the program is defined in terms of the sequence of reductions undertaken by the process calculus engine.
This is not only funny because it is impenetrable jargon, but secondarily funny because it also makes sense. (But one of the Main Guys disagrees with him, so don't take it too seriously.)