O'Reilly logo

Lambda Calculus with Types by Richard Statman, Wil Dekkers, Henk Barendregt

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Introduction

The rise of lambda calculus

Lambda calculus is a formalism introduced by Church in 1932 that was intended to be used as a foundation for mathematics, including its computational aspects. Supported by his students Kleene and Rosser – who showed that the prototype system was inconsistent – Church distilled a consistent computational part and ventured in 1936 the Thesis that exactly the intuitively computable functions could be captured by it. He also presented a function that could not be captured by the λ-calculus. In that same year Turing introduced another formalism, describing what are now called Turing Machines, and formulated the related Thesis that exactly the mechanically computable functions are able to be captured by these ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required