X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week3a.mdwn;h=3ed45aef92854f0072de68899319c25e5cbdaba5;hp=fd2c672a96c038e993f52d1f720acfab42d3a63c;hb=e74b2093832460b8717058da4456d782d52215cc;hpb=420a18f740f0c7f056c40d871595f42a0865b6c4

diff --git a/week3a.mdwn b/week3a.mdwn
index fd2c672a..3ed45aef 100644
--- a/week3a.mdwn
+++ b/week3a.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:
 
-	&omega; (\h \lst. (isempty lst) zero (add one ((h h) (extract-tail lst))))
+<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.