The Curry-Howard correspondence implies that there is a syntactic isomorphism between natural deduction and a typed variant of this model of computation. Consisting of a single transformation rule and a single function definition scheme, it was used by its creator in the 1930's to derive a negative answer to the Entscheidungsproblem and the halting problem. While Haskell, Miranda and ML are more recent examples of languages to utilize this system, Lisp was the first such language though only in its "pure" form. For 10 p
The Curry-Howard correspondence implies that there is a syntactic isomorphism between natural deduction and a typed variant of this model of computation. Consisting of a single transformation rule and a single function definition scheme, it was used by its creator in the 1930's to derive a negative answer to the Entscheidungsproblem and the halting problem. While Haskell, Miranda and ML are more recent examples of languages to utilize this system, Lisp was the first such language though only in its "pure" form. For 10 points, name this formal mathematical system designed by Alonzo Church the minimal basis for functional programming languages.
The Curry-Howard correspondence implies that there is a syntactic isomorphism between natural deduction and a typed variant of this model of computation.
Lambda Calculus