From 6dc0f03a2b7a5081fa378f0a1af4e37682b7242c Mon Sep 17 00:00:00 2001 From: jim Date: Mon, 23 Feb 2015 09:19:18 -0500 Subject: [PATCH] tweak --- exercises/assignment2_answers.mdwn | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/assignment2_answers.mdwn b/exercises/assignment2_answers.mdwn index 177aa2d8..6d0e5aa4 100644 --- a/exercises/assignment2_answers.mdwn +++ b/exercises/assignment2_answers.mdwn @@ -237,7 +237,7 @@ 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. + 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. Then 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 -- 2.11.0