Tessman, Thant, 1995. Adding generic functions to Scheme. In SIGPLAN Not., Association for Computing Machinery, New York, NY, USA, vol. 30, pp. 45–50.Abstract: A generic function is a set of methods, all of which have equivalent semantics but each of which apply to different domains. This document describes how to augment the Scheme programming language with the capability to define multi-method generic functions. Also described are optimization issues and areas of potentially fruitful future exploration.
Moreover, the Chicken Scheme fast-generic egg is based on that.
See also
Final shift for call/cc
Direct implementation of shift and reset
Call with Current Continuation Patterns
Cogen in six lines
Handling control
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
The Seasoned Schemer
The Little Schemer
Representing monads