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

week2 tweaks

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

diff --git a/week2.mdwn b/week2.mdwn
index 95b1bb98..b944f5c4 100644
--- a/week2.mdwn
+++ b/week2.mdwn
@@ -35,10 +35,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;
-	... ___ ...
-^      |
-|______|
+<pre><code>
+	&lambda; ... ___ ...
+	^      |
+	|______|
 </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.