The Lambda calculus can be viewed as the simplest functional programming language. So why was it invented before the first fully programmable computer?

In this talk I will highlight the mathematical history of the Lambda calculus and describe its development. Then I will show how it gives a negative answer to the Entscheidungsproblem (decision problem).

I will conclude with variants of the Lambda calculus that are used as models of programming languages, for example ML.