Lambda calculus

Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. It is a universal model of computation that can be used to simulate any single-taped Turing machine and was first introduced by mathematician Alonzo Church in the 1930s as part of an investigation into the foundations of mathematics.

I should improve this note with new information when I have time.

See also

Artificial Intelligence, Computer Complexity, Turing Machines, Automata theory, Theory of computation

Material

• https://www.quora.com/How-is-Lambda-Calculus-equivalent-to-the-Turing-machine#
• Achim Jung, A Short Introduction to the Lambda Calculus
• Marius Buliga, Graphic lambda calculus
• Implementing the Lambda calculus using C++ Templates

Books

• Church, Alonzo (1941). The Calculi of Lambda-Conversion. Princeton: Princeton University Press.
• arendregt, Hendrik Pieter (1984), The Lambda Calculus: Its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics 103 (Revised ed.), North Holland, Amsterdam.
• Selinger, Peter (2008), Lecture Notes on the Lambda Calculus 0804 (class: cs.LO), Department of Mathematics and Statistics, University of Ottawa
• Barendregt, Henk; Barendsen, Erik (March 2000), Introduction to Lambda Calculus