Functional patterns

This page, which is under construction, provides a compilation of some useful design patterns and idioms in Scheme programming. At present, it serves as a repository for various unpolished odds, ends, and links to articles that I have posted.

Patterns

Expressing iterative lazy algorithms
A portable record facility with subtyping
Modularity through lazy evaluation
Monads in Scheme - understanding the Filinski encoding
Understanding *reify* and *reflect*
Simulating type classes in Scheme
Keeping a compile-time registry with syntax-rules
Compile-time keyword arguments for Scheme
A monadic abstraction for composable macros (see also the withdrawn SRFI-53 , which contained some bugs corrected here. A later and more complete version exists, available on request.
Encapsulating state with a monad
A functional interpretation of state