CSE 341: Programming Languages, Autumn 2010

Scheme Textbooks and Readings

No textbook is required for our Scheme coverage. But here are two well-respected introductory Scheme textbooks that are available free of charge on the web:

The following are direct links to various reading sections from the above textbooks, as well as from the PLT Scheme / "Racket" API reference pages, related to the material from each lecture.

Intro to Scheme:

• How to Design Programs:
  • Section 2: Numbers, simple programs
  • Section 3: Procedures and variable definitions
  • Section 4: Conditionals
• Structure and Interpretation of Computer Programs:
  • 1.1: Elements of programming
  • 1.2: Procedures and the processes they generate
• Teach Yourself Scheme in Fixnum Days:
  • 2.1: Simple data types
  • 2.2.1: Strings
  • Ch. 4: conditionals
• Wikipedia:
  • Scheme
  • Lisp
  • S-expression
• PLT Scheme Reference:
  • 2.14 define
  • 2.12 conditionals
  • 3.1 booleans and equality
  • 3.2 numbers
  • 3.3 strings

let, let*:

• Teach Yourself Scheme in Fixnum Days:
  • 5.1: let, let*
• PLT Scheme Reference:
  • 2.9 local binding, let, let*
  • 2.8 lambda

lists and pairs

• How to Design Programs:
  • Section 9: Lists
  • Section 10: More with Lists
• Structure and Interpretation of Computer Programs:
  • 2.2.1: Representing sequences
• Teach Yourself Scheme in Fixnum Days:
  • 2.2.3: Dotted pairs and lists
• PLT Scheme Reference:
  • 3.9 Pairs and lists

Symbolic data:

• How to Design Programs:
  • Section 5: Symbolic data
  • Section 7: The varieties of data
• Structure and Interpretation of Computer Programs:
  • 2.3: Symbolic data
    (2.3.2: Symbolic differentiation, in particular)
• Teach Yourself Scheme in Fixnum Days:
  • 2.1.4: Symbols
  • 2.2.4: Conversion between data types
• PLT Scheme Reference:
  • 3.6 symbols
  • 2.20 quasiquoting

Mutation and memoization:

• Structure and Interpretation of Computer Programs:
  • 3.1: Assignment and local state
  • 3.3.1: Mutable list structure
• Wikipedia:
  • memoization
  • dynamic programming
• PLT Scheme Reference:
  • 2.17 set!
  • 3.10 mutable pairs and lists

Structures and objects:

• How to Design Programs:
  • Section 6: Structures
• Teach Yourself Scheme in Fixnum Days:
  • Ch. 9: Structures
  • Ch. 12: Objects and classes
• PLT Scheme Reference:
  • 4.1 Defining structure types

Macros:

• Teach Yourself Scheme in Fixnum Days:
  • Ch. 8: Macros
• Wikipedia:
  • macro
  • hygienic macro
• PLT Scheme Reference:
  • 11 macros

Jumps, continuations, non-local control:

• Teach Yourself Scheme in Fixnum Days:
  • Ch. 13: Jumps
• An Introduction to Scheme and its Implementation:
  • call-with-current-continuation
  • Continuation chain and recursion
• PLT Scheme Reference:
  • 9.3 delayed evaluation
  • 9.4 continuations
  • 2.19 continuation marks

Streams, delayed evaluation:

• How to Design Programs:
  • Section 5: Symbolic data
  • Section 7: The varieties of data
• Structure and Interpretation of Computer Programs:
  • 3.5: Streams
• Teach Yourself Scheme in Fixnum Days:
  • 2.1.4: Symbols
  • 2.2.4: Conversion between data types
• Wikipedia:
  • lazy evaluation
  • thunk
• PLT Scheme Reference:
  • 3.6 symbols
  • 2.20 quasiquoting

Other:

• How to Design Programs:
  • Section 5: Symbolic data
  • Section 7: The varieties of data
• Structure and Interpretation of Computer Programs:
  • 3.2: Environment and Evaluation
• Teach Yourself Scheme in Fixnum Days:
  • 6.3 Iteration
• PLT Scheme Reference:
  • 9.2.1 raising exceptions