projects
/
lambda.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
c43f7e5
)
(no commit message)
author
barker
<barker@web>
Sun, 19 Sep 2010 15:40:35 +0000
(11:40 -0400)
committer
Lambda Wiki
<lambda@SERVER.PHILOSOPHY.FAS.NYU.EDU>
Sun, 19 Sep 2010 15:40:35 +0000
(11:40 -0400)
week2.mdwn
patch
|
blob
|
history
diff --git
a/week2.mdwn
b/week2.mdwn
index
a22bf2a
..
48d0830
100644
(file)
--- a/
week2.mdwn
+++ b/
week2.mdwn
@@
-13,8
+13,12
@@
Define T to be `(\x. x y) z`. Then T and `(\x. x y) z` are syntactically equal,
equivalent to `(\z. z y) z` is that when a lambda binds a set of
occurrences, it doesn't matter which variable serves to carry out the
binding. Either way, the function does the same thing and means the
equivalent to `(\z. z y) z` is that when a lambda binds a set of
occurrences, it doesn't matter which variable serves to carry out the
binding. Either way, the function does the same thing and means the
-same thing. Look in the standard treatments for discussions of alpha
-equivalence for more detail.]
+same thing.
+Linguistic trivia: some linguistic discussions suppose that alphabetic variance
+has important linguistic consequences (notably Ivan Sag's dissertation).
+Look in the standard treatments for discussions of alpha
+equivalence for more detail. Also, as mentioned below, one of the intriguing
+properties of Combinatory Logic is that alpha equivalence is not an issue.]
This:
This: