Readings
Required readings
The functional model
Beginning Scheme
Editing Scheme programs
Symbols and lists
Procedure definitions
Conditional evaluation
Recursion with lists
Numbers
Recursion with integers
Preconditions and
postconditions
Deep recursion
Pairs
Association lists
Local bindings
Indefinite recursion
Local binding and recursion
Characters
Strings
Procedures as values
Folding
Variable arity
Multiple-valued procedures
Vectors
The imperative model
Side effects
Structure mutation
Iteration
Matrices
Sorting by insertion
Sorting by merging
Searching
Input and output under program control
Outside the DrScheme environment
Files
Recursion with files
Records
Metaprogramming
Assignment
The object model
Object-oriented programming
Stacks
Queues
Classes and objects in DrScheme
Windowing classes
Drawing classes
Sidebars
The semi-reasonable explanation
for the names car and cdr
The prime-factors procedure
terminates
This document is available on the World Wide Web as
http://www.cs.grinnell.edu/~stone/courses/scheme/readings/
created August 9, 2001
last revised December 4, 2001
John David Stone
(stone@cs.grinnell.edu)