X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;ds=sidebyside;f=week2.mdwn;h=2db0548efc6b18f6eed2164a5d49602d6c0314b5;hb=d2f7232f5c6124a53eb3889a690bd700ee4ce1ce;hp=1cabf64667774a33da8ab2b8ecad4fe8921bf998;hpb=74c0cb06f1fb91b8b5b2721e8c512c1860adcc18;p=lambda.git

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 ≡ `(\x. x y) z` ≡ `(\z. z y) z`
+<pre><code>
+T &equiv; (\x. x y) z &equiv; (\z. z y) z
+</code></pre>
 
 This: