As well as studying Scheme in detail, we will also study type inference in ML, and the use of functions as first-class values in all functional languages.

A meta-circular interpreter for Scheme, written in Scheme show how, to a large degree, a language can be defined in terms of itself.

An interpreter (its grammar is here) for a partial implementation of the lambda calculus show how close Scheme really is to it.