Comp 210 List of Readings

• Felleisen, Findler, Flatt, Krishnamurthi: How to Design Programs
  The on-line version of the primary course textbook.
• Friedman, Felleisen: The Little Schemer: Fourth Edition (MIT Press, 1996)
  An alternative introduction to recursive and functional programming
• Friedman, Felleisen: The Seasoned Schemer (MIT Press, 1996)
  ... more on functional and imperative programming using Scheme.
• Douglas Hofstaedter: Metamagical Themas (Basic Books, ISBN 0465045669).
  A delightful collection from the author's column in Scientific American. Very accessible, the topics range from game theory, to patterns in fugues, to interesting fonts. Only peripherally tied to class material, but recommended enjoyable browsing for all. [Amazon review]

The following supplement the material in the book. The laws of evaluation are particularly important because this topic is not covered very thoroughly in the book.

• Cartwright, Ernst, Warren: The Laws of Evaluation for Functional Scheme (postscript)
  A Helpful Summary; note that this materials is also covered in Intermezzo 7 of How To Design Programs (above).
• Cartwright: The Laws of Evaluation for Imperative Scheme (postscript)
  . Consult the sample hand evaluation using these laws to see how they work in practice.
• Warren: Defining New Forms of Data (html)
  A summary of the rules for converting data definitions in program templates, as well as when and how to use structures.
• Dybvig: The Scheme Programming Language (Prentice Hall, 1987, 1996)
  a systematic overview of standard Scheme, plus numerous extensions found in Chez Scheme and DrScheme

Here are some traditional text books on Scheme:

• Abelson, Sussman: Structure and Interpretation of Computer Programs (MIT Press 1985)
  the text that changed introductory courses (if you are in EE, you will enjoy it!)
• Manis, Little: The Schematics of Programming (Prentice Hall, 1995)
• Springer, Friedman: Scheme and the Art of Programming (MIT Press, 1992)