System F was a typed version of this system which added parametric polymorphism.
Curry and Howard demonstrated its correspondence to intuitionistic logic and any simply-typed version of it can be interpreted in a Cartesian closed category. System F was a typed version of this system which added parametric polymorphism. Languages based on it may encounter both the upwards and downwards funarg problems. Its expressions are either variables, abstractions or applications. It can be implemented in Eiffel or Python, but it has the most similarity to functional programming languages such as Scheme and LISP. Equivalent to a Turing machine, FTP identify this system of formal computation developed by Kleene and Church, which is named for a Greek letter.
Curry and Howard demonstrated its correspondence to intuitionistic logic and any simply-typed version of it can be interpreted in a Cartesian closed category.
lambda calculus