From c4f36827e6c5565397819069d939a32048385cd2 Mon Sep 17 00:00:00 2001
From: Jim Pryor <profjim@jimpryor.net>
Date: Thu, 16 Sep 2010 17:16:11 -0400
Subject: [PATCH] tweak week2

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

diff --git a/week2.mdwn b/week2.mdwn
index 1cabf646..2db0548e 100644
--- a/week2.mdwn
+++ b/week2.mdwn
@@ -3,7 +3,9 @@ Syntactic equality, reduction, convertibility
 
 Define T to be `(\x. x y) z`. Then T and `(\x. x y) z` are syntactically equal, and we're counting them as syntactically equal to `(\z. z y) z` as well, which we will write as:
 
->	T &equiv; `(\x. x y) z` &equiv; `(\z. z y) z`
+<pre><code>
+T &equiv; (\x. x y) z &equiv; (\z. z y) z
+</code></pre>
 
 This:
 
-- 
2.11.0