From 1e8750d642929f767efaa1256b5b2161b9ce7e3e Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Sun, 3 Oct 2010 16:23:38 -0400 Subject: [PATCH] week3 evaluator fix Signed-off-by: Jim Pryor --- assignment_3_evaluator.mdwn | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/assignment_3_evaluator.mdwn b/assignment_3_evaluator.mdwn index e357bb54..5933223b 100644 --- a/assignment_3_evaluator.mdwn +++ b/assignment_3_evaluator.mdwn @@ -13,10 +13,10 @@ Here are the definitions pre-loaded for working on assignment 3: 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 @@ -24,12 +24,12 @@ Here are the definitions pre-loaded for working on assignment 3: 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 @@ -37,7 +37,7 @@ Here are the definitions pre-loaded for working on assignment 3: let makeList = make_list in let isZero = iszero in let mult = mul in - + ; ; length (tail mylist) -- 2.11.0