From: Jim Pryor <profjim@jimpryor.net>
Date: Sun, 19 Sep 2010 22:11:39 +0000 (-0400)
Subject: week2 tweak
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=4de03f98830a8404cfdcf256c719661d5ab85787

week2 tweak

Signed-off-by: Jim Pryor <profjim@jimpryor.net>
---

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:
 
 <pre><code>
-	(&lambda;. &lambda;. z x) y
-    ^  ^  | |
-    |  |__| |
-    |_______|
+	(&lambda;. &lambda;. _ _) y
+     ^  ^  | |
+     |  |__| |
+     |_______|
 </code></pre>
 
 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.