X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment_3_evaluator.mdwn;h=7a453e6428c641e35ecdf0ba7b391f04d8bfe5da;hp=900440169800b9e0b2da631df5f8ba0f7a1cc1dd;hb=3728bbf894452c4fdca939e81db2037d87ec946b;hpb=172cbc3df5cc612ff39efd24f1c0e630b214f709

diff --git a/assignment_3_evaluator.mdwn b/assignment_3_evaluator.mdwn
index 90044016..7a453e64 100644
--- a/assignment_3_evaluator.mdwn
+++ b/assignment_3_evaluator.mdwn
@@ -1,7 +1,8 @@
 Here are the definitions pre-loaded for working on assignment 3:
 
-<textarea id="INPUT" style="border: 2px solid black; color: black; font-family: monospace; height: 3in; overflow: auto; padding: 0.5em; width: 100%;">
-<pre>
+<textarea id="INPUT" style="border: 2px solid black;
+color: black; font-family: monospace; height: 3in;
+overflow: auto; padding: 0.5em; width: 100%;">
 ; booleans
 let true = \x y. x in
 let false = \x y. y in
@@ -14,10 +15,10 @@ let isempty = \x. x fst in
 let make_list = \h t. make_pair false (make_pair h t) in
 let head = \l. isempty l err (l snd fst) in
 let tail = \l. isempty l err (l snd snd) in
-
+;
 ; a list of numbers to experiment on
 let mylist = make_list 1 (make_list 2 (make_list 3 empty)) in
-
+;
 ; church numerals
 let iszero = \n. n (\x. false) true in
 let succ = \n s z. s (n s z) in
@@ -25,12 +26,12 @@ let mul = \m n s. m (n s) in
 let pred = \n. iszero n 0 (length (tail (n (\p. make_list junk p) empty))) in
 let leq = \m n. iszero(n pred m) in
 let eq = \m n. and (leq m n)(leq n m) in
-
+;
 ; a fixed-point combinator for defining recursive functions
 let Y = \f. (\h. f (h h)) (\h. f (h h)) in
-
+;
 let length = Y (\length l. isempty l 0 (succ (length (tail l)))) in
-
+;
 ; synonyms
 let makePair = make_pair in
 let nil = empty in
@@ -38,9 +39,8 @@ let isNil = isempty in
 let makeList = make_list in
 let isZero = iszero in
 let mult = mul in
-
+;
 length (tail mylist)
-</pre>
 </textarea>
 <input id="PARSE" value="Normalize" type="button">
 <input id="ETA" type="checkbox">do eta-reductions too