From cf5b5115875d5df10051a6325c39ae362fcd1fcd Mon Sep 17 00:00:00 2001
From: Jim Pryor <profjim@jimpryor.net>
Date: Sun, 19 Sep 2010 14:10:39 -0400
Subject: [PATCH 1/1] week2 tweaks

Signed-off-by: Jim Pryor <profjim@jimpryor.net>
---
 week2.mdwn | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

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.
-- 
2.11.0