From 4de03f98830a8404cfdcf256c719661d5ab85787 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Sun, 19 Sep 2010 18:11:39 -0400 Subject: [PATCH 1/1] week2 tweak Signed-off-by: Jim Pryor --- week2.mdwn | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/week2.mdwn b/week2.mdwn index 88058389..f9786785 100644 --- a/week2.mdwn +++ b/week2.mdwn @@ -36,10 +36,10 @@ Another way to think of it is to identify expressions not with particular alphab A third way to think is to identify the lambda formula not with classes of alphabetic sequences, but rather with abstract structures that we might draw like this: 

-	(λ. λ. z x) y
-    ^  ^  | |
-    |  |__| |
-    |_______|
+	(λ. λ. _ _) y
+     ^  ^  | |
+     |  |__| |
+     |_______|
Here there are no bound variables, but there are *bound positions*. We can regard formula like (a) and (b) as just helpfully readable ways to designate these abstract structures. -- 2.11.0