From e4ea387ecb1a2dcb069060afccbe8ac1e70f7061 Mon Sep 17 00:00:00 2001 From: Chris Barker Date: Mon, 27 Sep 2010 15:03:44 -0400 Subject: [PATCH] edits --- assignment3.mdwn | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/assignment3.mdwn b/assignment3.mdwn index c7c5be41..c4ea3162 100644 --- a/assignment3.mdwn +++ b/assignment3.mdwn @@ -70,7 +70,7 @@ same length. That is, 5. In assignment 2, we discovered that version 3-type lists (the ones that work like Church numerals) made it much easier to define operations like `map` and `filter`. But now that we have recursion in our toolbox, -reasonable map and filter functions for version 3 lists are within our +reasonable map and filter functions for version 1 lists are within our reach. Give definitions for `map` and a `filter` for verson 1 type lists. #Computing with trees# @@ -89,7 +89,7 @@ Then we have the following representations: (a) (b) (c) . /|\ /\ /\ - / | \ /\ 3 1/\ + / | \ /\ 3 1 /\ 1 2 3 1 2 2 3 [[1];[2];[3]] [[[1];[2]];[3]] [[1];[[2];[3]]] -- 2.11.0