Functional Programming (SCHEME) Slides (PDF Format)


Introduction to Functional Programming:  Click here.

cond: SCHEME's most versitle selection statement:  Click here.

Pseudo-Random Numbers and the SPLIT Function:  Click here.

Pairs and Lists in SCHEME: 
   Page 1: Click here.
   Page 2: Click here.
   Page 3: Click here.
   Page 4: Click here.
   Page 5: Click here.

nil, #f, (), #t, etc.:  Click here.

Representing Sets as Lists:  Click here.

SCHEME's trace and eval Functions:  Click here.

Functional Programming Techniques (& insertion sort):  Click here.

More Examples:  Click here.

Still More Examples:  Click here.

More on SCHEME's eval Function:  Click here.

Arbitrary Symbolic Substitution: 
   Page 1: Click here.
   Page 2: Click here.
   Page 3: Click here.

Sorting in SCHEME:  Click here.

Simplifying Logical Formulas in SCHEME:  Click here.

Binary Trees and Sorting:  Click here.

Symbolic Pattern Matching (Unification) Click here.