add comment about The Little Schemer

diff --git a/exercises/assignment2_answers.mdwn b/exercises/assignment2_answers.mdwn
index 3eaaa15..177aa2d 100644 (file)
--- 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
 
               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
 -------
 
 Numbers
 -------