tweak week2

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

diff --git a/week2.mdwn b/week2.mdwn
index 1cabf64..2db0548 100644 (file)
--- 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 ≡ `(\x. x y) z` ≡ `(\z. z y) z`
+<pre><code>
+T &equiv; (\x. x y) z &equiv; (\z. z y) z
+</code></pre>
 
 This: