From e74b2093832460b8717058da4456d782d52215cc Mon Sep 17 00:00:00 2001
From: Jim Pryor <profjim@jimpryor.net>
Date: Sun, 26 Sep 2010 21:20:17 -0400
Subject: [PATCH] continue debug

Signed-off-by: Jim Pryor <profjim@jimpryor.net>
---
 week3a.mdwn | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

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.
 
-- 
2.11.0