From efb61ddb228642611f536202f02defed418413f4 Mon Sep 17 00:00:00 2001 From: barker Date: Sun, 19 Sep 2010 11:40:35 -0400 Subject: [PATCH] --- week2.mdwn | 8 ++++++-- 1 file changed, 6 insertions(+), 2 deletions(-) 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: -- 2.11.0