X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week3a.mdwn;h=fd2c672a96c038e993f52d1f720acfab42d3a63c;hp=892a055a39fa4b193c91914bd8442de1c0c0eac9;hb=66c92cdd44d2021db2296241643606c619d87e9e;hpb=2dc9b679fbe5f9dadb336e15fc62d4ddf2b2fdc9

diff --git a/week3a.mdwn b/week3a.mdwn
index 892a055a..fd2c672a 100644
--- a/week3a.mdwn
+++ b/week3a.mdwn
@@ -211,7 +211,7 @@ 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>
+	&omega; (\h \lst. (isempty lst) zero (add one ((h h) (extract-tail lst))))
 
 and this will indeed implement the recursive function we couldn't earlier figure out how to define.