projects / lambda.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: bd678a0) | patch
week1: functional ocaml turing complete after all
authorJim Pryor <profjim@jimpryor.net>
Sun, 19 Sep 2010 18:47:27 +0000 (14:47 -0400)
committerJim Pryor <profjim@jimpryor.net>
Sun, 19 Sep 2010 18:47:30 +0000 (14:47 -0400)
commita74e125da6d29f39933f380fd6b0f91e9e4e3791
treedfa8e510d24e5132993fd7051cd4f484747a931ftree | snapshot
parentbd678a0313adab5841c9f346ea250b1de0d755eccommit | diff
week1: functional ocaml turing complete after all

I think the presence of primitive let rec --> full Y combinator --> more
powerful than just second-order polymorphic lambda calculus, which is
strongly normalizing.

Signed-off-by: Jim Pryor <profjim@jimpryor.net>
week1.mdwn diff | blob | history
NYU Lambda Wiki v2