From d13ff61a8d850e297e12ebb5d77464162849cfc2 Mon Sep 17 00:00:00 2001
From: jim
Date: Mon, 23 Feb 2015 01:05:11 -0500
Subject: [PATCH] add comment about The Little Schemer
---
exercises/assignment3.mdwn | 1 +
1 file changed, 1 insertion(+)
diff --git a/exercises/assignment3.mdwn b/exercises/assignment3.mdwn
index 57b6d4d8..590bae75 100644
--- a/exercises/assignment3.mdwn
+++ b/exercises/assignment3.mdwn
@@ -18,6 +18,7 @@
8. Suppose you have two lists of integers, `left` and `right`. You want to determine whether those lists are equal, that is, whether they have all the same members in the same order. How would you implement such a list comparison? You can write it in Scheme or Kapulet using `letrec`, or if you want more of a challenge, in the Lambda Calculus using your preferred encoding for lists. If you write it in Scheme, don't rely on applying the built-in comparison operator `equal?` to the lists themselves. (Nor on the operator `eqv?`, which might not do what you expect.) You can however rely on the comparison operator `=` which accepts only number arguments. If you write it in the Lambda Calculus, you can use your implementation of `leq`, requested below, to write an equality operator for Church-encoded numbers. [[Here is a hint|assignment3 hint3]], if you need it.
+ (The function you're trying to define here is like `eqlist?` in Chapter 5 of *The Little Schemer*, though you are only concerned with lists of numbers, whereas the function from *The Little Schemer* also works on lists containing symbolic atoms --- and in the final version from that Chapter, also on lists that contain other, embedded lists.)
## Numbers
--
2.11.0