Homework 4 for csc324, Fall 1996

Higher Order Programming

  1. Read pp. 24-25 of handout.

  2. Analyze complexity of Fib that you wrote in the previous homeworks and rewrite it using accumulators to get linear complexity.

  3. Write definitions for filter and exists?.

  4. Define forall? in terms of reduce.

  5. Do problem 10.11, p. 420 of Sethi.