1. Explicit substitutions;Abadi;Proc. Conf. on Principles of Programming Languages,1990
2. S. Abramsky, The lazy λ-calculus, in: D. Turner, ed., Declarative Programming (Addison-Wesley, Reading, MA, to appear).
3. Catégories et logiques faibles;Bénabou,1973
4. Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem;de Bruijn;Indag Math.,1972
5. The Amber Machine;Cardelli,1986