Comp 210 List of Readings

• Felleisen, Findler, Flatt, Krishnamurthi: How to Design Programs
  The book for the course. However it is still a work in progress; some later chapters are missing, and you will want to rely on your lecture notes, and draft notes to be posted here.
• Friedman, Felleisen: The Little Schemer: Fourth Edition (MIT Press, 1996)
  a fun, alternative introduction to recursive and functional programming
• Friedman, Felleisen: The Seasoned Schemer (MIT Press, 1996)
  ... more on functional and imperative programming in Scheme

The following are useful for an alternative view of the material and for reading up on those features of Scheme that the course does not cover:

• Ernst, Warren: The Laws of Scheme Evaluation (postscript)
  A Helpful Summary; note that this materials is also covered in Chapter 3 of Principles (above).
• 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.
• Felleisen: JAM2000 quick reference card (postscript)
• 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)