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

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

diff --git a/week2.mdwn b/week2.mdwn
index ebc59593..95b1bb98 100644
--- a/week2.mdwn
+++ b/week2.mdwn
@@ -35,9 +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