X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=exercises%2Fassignment2_answers.mdwn;h=177aa2d878aba67c242dd4e915e80b4462f18a5e;hp=3eaaa1566c4791f3116b7c2fcb5bb32e8b6d74a6;hb=dd4aafee54215380b06b56fc64304fe13e093de5;hpb=7e3abd34b5cf0f3d986e986bad3d4eadae298939

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
 -------