X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week3.mdwn;h=b29d095a1f8157725ec1febe67ccfa3abf9663b7;hp=653b3076da7cd8a6f25afeea244bb283f63ecb3e;hb=907333f2da479e56260db4b365927ae93eff9dda;hpb=420a18f740f0c7f056c40d871595f42a0865b6c4

diff --git a/week3.mdwn b/week3.mdwn
index 653b3076..b29d095a 100644
--- a/week3.mdwn
+++ b/week3.mdwn
@@ -211,7 +211,9 @@ Instead of writing out a long formula twice, we could write:
 
 and the initial `(\x. x x)` is just what we earlier called the <code>&omega;</code> combinator (lower-case omega, not the non-terminating <code>&Omega;</code>). So the self-application of `H` can be written:
 
-<pre><code>&omega; (\h \lst. (isempty lst) zero (add one ((h h) (extract-tail lst))))</code></pre>
+<pre><code>&omega; (\h \lst. (isempty lst) zero (add one ((h h) (extract-tail lst))))
+</code></pre>
+
 
 and this will indeed implement the recursive function we couldn't earlier figure out how to define.