X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week2.mdwn;h=48d0830a37a0d0c2a0a9701619d00fd087f40e87;hp=a22bf2a668de26c824878f537921de562083a5c6;hb=efb61ddb228642611f536202f02defed418413f4;hpb=c43f7e5448e344d33bc9271d34e801e1feb108f7

diff --git a/week2.mdwn b/week2.mdwn
index a22bf2a6..48d0830a 100644
--- 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
-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: