continue debug

Signed-off-by: Jim Pryor <profjim@jimpryor.net>

diff --git a/week3a.mdwn b/week3a.mdwn
index 892a055..fd2c672 100644 (file)
--- 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.