by budu on 1/17/11, 4:11 PM with 25 comments
by sb on 1/17/11, 10:00 PM
by shasta on 1/17/11, 5:10 PM
No, the other direction requires simulating a Turing machine with lambda calculus.
by joshrule on 1/17/11, 8:08 PM
by fexl on 1/17/11, 9:25 PM
I'm also relying on two higher-level combinators L and R to reduce the size of the combinatorial forms, e.g.:
The bottom line is that the entire Fexl parser is defined in terms of the two primitive combinators S and C.
by binarymax on 1/17/11, 5:14 PM
Went to buy the book and its beyond my budget at the moment ($215 on Amazon).
by joelhaasnoot on 1/17/11, 5:14 PM
Not sure I agree: his lectures are quite sleep inducing these days. Though reducing programming to something so simple and mathematical does open lots of possibilities...
by iam on 1/18/11, 6:12 AM