The inconsistency of this model was first demonstrated by showing that the number of provable functions that it produces was enumerable.
The inconsistency of this model was first demonstrated by showing that the number of provable functions that it produces was enumerable. System F is a modification to it that introduces typing, but it does not possess the power of computational universality that this possesses. Its relation to deductive logic was shown to be equivalence via the Curry-Howard isomorphism. This system, which was designed to minimally model (*) function creation and function application, is often used to model functional programming languages. Alpha reductions and Beta reductions are used to show the equivalence of statements in this system. For 10 points name this mathematical model developed by Alonzo Church, which is named after a Greek letter.
The inconsistency of this model was first demonstrated by showing that the number of provable functions that it produces was enumerable.
untyped lambda calculus