From 66c92cdd44d2021db2296241643606c619d87e9e Mon Sep 17 00:00:00 2001
From: Jim Pryor <profjim@jimpryor.net>
Date: Sun, 26 Sep 2010 21:18:07 -0400
Subject: [PATCH 1/1] continue debug

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

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