Lambda Calculus
Church, Alonzo. The Calculi of Lambda Conversion. Princeton University Press, 1941.
Barendregt, Henk P. The Lambda Calculus. North Holland, revised edition, 1984.
Barendregt, Henk P. Functional programming and lambda calculus. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, chapter 7, pages 321–364. Elsevier / MIT Press, 1990.
Hindley, J. Roger and Jonathan P. Seldin. Introduction to Combinators andλ-Calculus, volume 1 of London Mathematical Society Student Texts. Cambridge University Press, 1986.
Böhm, Corrado and Alessandro Berarducci. Automatic synthesis of typedΛ-programs on term algebras. Theoretical Computer Science, 39(2–3):135–154, August 1985.
Abadi, Martín, Luca Cardelli, Pierre-Louis Curien, and Jean-Jacques Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, 1991a. Summary in ACM Symposium on Principles of Programming Languages (POPL), San Francisco, California, 1990.
de Bruijn, Nicolas G. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Math., 34(5):381–392, 1972.
Curry, Haskell B. and Robert Feys. Combinatory Logic, volume 1. North Holland, 1958. Second edition, 1968.
Backus, John. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Communications of the ACM, 21(8):613– 641, August 1978. Reproduced in Selected Reprints on Dataflow and Reduction Architectures, ed. S. S. Thakkar, IEEE, 1987, pp. 215–243, and in ACM Turing Award Lectures: The First Twenty Years, ACM Press, 1987, pp. 63–130.