X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=topics%2F_assignment2.mdwn;h=946df8feabce4fd3a01b8b0727778d6e89428c6c;hp=bacd676ecf44c7e9a88206b860d32d9ca7c70189;hb=9b0baed249784c4f00c0398f23b5fcb7c853e040;hpb=de108826480c232b504d1fa0583c4e2e140117a6;ds=sidebyside

diff --git a/topics/_assignment2.mdwn b/topics/_assignment2.mdwn
index bacd676e..946df8fe 100644
--- a/topics/_assignment2.mdwn
+++ b/topics/_assignment2.mdwn
@@ -163,10 +163,10 @@ Numbers
 
 26. Given that we've agreed to Church's encoding of the numbers:
 
-    <code>0 &equiv; \f z. z  
-    <code>1 &equiv; \f z. f z  
-    <code>2 &equiv; \f z. f (f z)  
-    <code>3 &equiv; \f z. f (f (f z))  
+    <code>0 &equiv; \f z. z</code>  
+    <code>1 &equiv; \f z. f z</code>  
+    <code>2 &equiv; \f z. f (f z)</code>  
+    <code>3 &equiv; \f z. f (f (f z))</code>  
     <code>...</code>
 
     How would you express the `succ` function in the Lambda Calculus?