1. Anindya Banerjee, Olivier Danvy, and David A. Schmidt. A programming language workbench. Technical Report CIS-92-4, Kansas State University, Manhattan, Kansas, November 1991.
2. Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17:471–522, 1985.
3. Pierre-Louis Curien, Thérèse Hardin, and Jean-Jacques Lévy. Confluence properties of weak and strong calculi of explicit substitutions. Rapports de Recherche 1617, I.N.R.I.A., February 1992.
4. Matthias Felleisen and Robert Hieb. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 103(2):235–271, 1992.
5. Jan W. Klop. Combinatory Reduction Systems. Mathematical Centre Tracts 127. Mathematisch Centrum, Amsterdam, 1980.