From: jim Date: Mon, 23 Feb 2015 06:14:36 +0000 (-0500) Subject: add comment about The Little Schemer X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=624df0618dbeb10a7b37e3dc9eb5c3f494650b03;ds=sidebyside add comment about The Little Schemer --- diff --git a/exercises/assignment2_answers.mdwn b/exercises/assignment2_answers.mdwn index 3eaaa156..177aa2d8 100644 --- a/exercises/assignment2_answers.mdwn +++ b/exercises/assignment2_answers.mdwn @@ -237,6 +237,9 @@ Folds and Lists reverse xs = (fold_right (f, id) xs) [] in reverse + The ideas here are explored further in Chapter 8 of *The Little Schemer*. There they first introduce the idea of passing function as arguments to other functions, and having functions be the return values from functions. The `multirember&co` function discussed on pp. 137--140 (and the other `...&co` functions discussed in that chapter) are more complex examples of the kind of strategy used here to define `reverse`. We will be returning to these ideas and considering them more carefully later in the term. + + Numbers -------