1. Aczel, P. (1978). A general Church-Rosser theorem. Preprint, Univ. of Manchester.
2. Apt, K.R. (1990). Logic Programming. In: Formal models and semantics, Handbook of Theoretical Computer Science, Vol.B (J. van Leeuwen, editor), Elsevier-The MIT Press, Chapter 10, p.493–574.
3. Barendregt, H.P. (1974). Pairing without conventional restraints. Zeitschrift für Math. Logik und Grundl. der Math. 20, p. 289–306.
4. Barendregt, H.P. (1981). The Lambda Calculus, its Syntax and Semantics. 1st ed. North-Holland 1981, 2nd ed. North-Holland 1984.
5. Barendregt, H.P. (1989). Lambda calculi with types. in: Handbook of Logic in Computer Science (eds. S. Abramsky, D. Gabbay and T. Maibaum) Vol.1, Oxford University Press, to appear.