projects
/
lambda.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
b8b608c
)
edits
author
Chris Barker
<barker@kappa.linguistics.fas.nyu.edu>
Sat, 2 Oct 2010 19:39:51 +0000
(15:39 -0400)
committer
Chris Barker
<barker@kappa.linguistics.fas.nyu.edu>
Sat, 2 Oct 2010 19:39:51 +0000
(15:39 -0400)
week4.mdwn
patch
|
blob
|
history
diff --git
a/week4.mdwn
b/week4.mdwn
index
aa0fcf7
..
2fa501c
100644
(file)
--- a/
week4.mdwn
+++ b/
week4.mdwn
@@
-1,9
+1,6
@@
[[!toc]]
-#These notes return to the topic of fixed point combiantors for one more return to the topic of fixed point combinators#
-
-#Q: How do you know that every term in the untyped lambda calculus has
-a fixed point?#
+#Q: How do you know that every term in the untyped lambda calculus has a fixed point?#
A: That's easy: let `T` be an arbitrary term in the lambda calculus. If
`T` has a fixed point, then there exists some `X` such that `X <~~>