1. Abramsky S., Gabbay D., and Maibaum T., eds. Handbook of Logic in Computer Science, vol. 1–4, Oxford University Press, 1992–1995.
2. Barendregt H. P. The Lambda Calculus, its Syntax and Semantics. North-Holland, 1984.
3. Berarducci A. Infinite lambda-calculus and non-sensible models. Logic and Algebra, Lecture Notes in Pure and Applied Mathematics 180, Marcel Dekker Inc., 1996, p. 339–378.
4. Berry G. Modéles complétement adéquats et stables des λ-calculs typés. Thèse de l’Université de Paris VII, 1979.
5. Berry G., Lévy J.-J. Minimal and optimal computations of recursive programs. JACM 26, 1979, p. 148–175.