CS301 Problem Set 3

This assignment is worth 20 points

The purpose of this assignment is to develop some facility with higher-order functions in uScheme.

Your assignment is to do Exercises 2, 5, 13 in Ramsey and Kamin, Chapter 3.

Requirements

Use the same format as for the previous problem set, except for Exercise 13, which should have separate files for parts (a) and (b). Provide test cases as before.

Comments on the exercises

More than ever, you should keep in mind that these problems are 95% thinking and 5% programming. The answers are short, and can be found by completely understanding the reading, and experimenting with the example code. When the instructions refer to the "initial basis", we mean the functions listed on page 100.

• For exercise 5, you're not allowed to use recursion, and you're not allowed to use the revapp or reverse functions from the initial basis.
• For exercise 13, a clarification: part (a) should implement sets as characteristic functions, using equal? as the equality test. Part (b) should implement sets again as characteristic functions, but polymorphically, so that the same implementation can be used with different equality tests; the polymorphism should be done as explained on p. 83. Make sure you show test cases for more than one equality test.