Thiemann, Peter J., 1996. Cogen in six lines. In SIGPLAN Not., Association for Computing Machinery, New York, NY, USA, vol. 31, pp. 180–189.Abstract: We have designed and implemented a program-generator generator (PGG) for an untyped higher-order functional programming language. The program generators perform continuation-based multi-level offline specialization and thus combine the most powerful and general offline partial evaluation techniques. The correctness of the PGG is ensured by deriving it from a multi-level specialize. Our PGG is extremely simple to implement due to the use of multi-level techniques and higher-order abstract syntax.
See also
Final shift for call/cc
Direct implementation of shift and reset
Call with Current Continuation Patterns
Adding generic functions to Scheme
Handling control
The Seasoned Schemer
The Little Schemer
Concurrent ML for CHICKEN Scheme
Porting SML/NJ CML as the (aux cml) library
CHICKEN Scheme
Versions and implementation notes
The SBRAL data structure
Skew Binary Random-Access Lists
Pattern matching
Scheme macrology: a generalized pattern matcher
The (aux hansei) module
The (aux nondeterministic) module
Learning tests for Scheme
The (aux stream) module
The (aux unittest) module
Bootstrapping a unittest framework
Scheme lang: Chez, 48 and Chicken
Some docs, refs and containers, respectively.
Hyperfunctions
Communicating Continuations
The Reasoned Schemer
miniKanren, microKanren and some implementations
BiRank
Towards Ranking on Bipartite Graphs
Axioms for Centrality
Aggregation predicates for µkanren
Groups, window functions, sets and enumerations
miniKanren, live and untagged
Quine generation via relational interpreters
Pure, declarative, and constructive arithmetic relations
A declarative pearl
The igraph software package for complex network research
Representing monads