projects
/
lambda.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
bd678a0
)
week1: functional ocaml turing complete after all
author
Jim Pryor
<profjim@jimpryor.net>
Sun, 19 Sep 2010 18:47:27 +0000
(14:47 -0400)
committer
Jim Pryor
<profjim@jimpryor.net>
Sun, 19 Sep 2010 18:47:30 +0000
(14:47 -0400)
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
patch
|
blob
|
history
diff --git
a/week1.mdwn
b/week1.mdwn
index
967f814
..
f87ee98
100644
(file)
--- a/
week1.mdwn
+++ b/
week1.mdwn
@@
-356,8
+356,6
@@
combinatorial logic</td>
</table>
</table>
-[Correction: OCaml is Turing complete, but I'm not sure if the merely functional part is; I suspect it's not.]
-
Rosetta Stone
=============
Rosetta Stone
=============