A Tutorial Introduction to the Lambda Calculus

This paper is a concise and painless introduction to the $\lambda$-calculus. This formalism was developed by Alonzo Church as a tool for studying the mathematical properties of effectively computable functions. The formalism became popular and has provided a strong theoretical foundation for the family of functional programming languages. This tutorial shows how to perform arithmetical and logical computations using the $\lambda$-calculus and how to define recursive functions, even though $\lambda$-calculus functions are unnamed and thus cannot refer explicitly to themselves.

[1]  Greg J. Michaelson,et al.  An introduction to functional programming through lambda calculus , 2011, International computer science series.

[2]  Peter M. Kogge,et al.  The Architecture of Symbolic Computers , 1990 .

[3]  György E. Révész Lambda-calculus, combinators, and functional programming , 1988, Cambridge tracts in theoretical computer science.