Higher-Order Programming

Lecture Notes for Com Sci 221, Programming Languages

Last modified: Sun Nov 14 18:53:10 CST 1999

Scheme Examples

I haven't had time to type real notes for this section yet. Here are some thought-provoking examples of higher-order programming in Scheme. They are not intended to be directly practical. Rather, they show what complex computations (demonstrated by the sizes of numbers that they compute) can be described very succinctly in a higher-order style.

• Definitions
• Demonstrations