A typed lambda calculus is a typed formalism that uses the lambda-symbol ( λ {\displaystyle \lambda } ) to denote anonymous function abstraction. In this...

simply typed lambda calculus ( λ → {\displaystyle \lambda ^{\to }} ), a form of type theory, is a typed interpretation of the lambda calculus with only...

cube: Typed lambda calculus – Lambda calculus with typed variables (and functions) System F – A typed lambda calculus with type-variables Calculus of constructions...

polymorphic lambda calculus or second-order lambda calculus) is a typed lambda calculus that introduces, to simply typed lambda calculus, a mechanism...

{\displaystyle \mathbb {N} \to \mathbb {R} } in typed lambda calculus. For a more concrete example, taking A to be the type of unsigned integers from 0 to 255 (the...

the predicative calculus of inductive constructions (which removes some impredicativity). The CoC is a higher-order typed lambda calculus, initially developed...

\;\vdash \;\lambda x.t:\sigma \to \tau }}} In System F (also named λ2 for the "second-order typed lambda calculus") there is another type of abstraction...

systems of typed lambda calculus including the simply typed lambda calculus, Jean-Yves Girard's System F, and Thierry Coquand's calculus of constructions...

deduction and typed combinatory logic, Howard made explicit in 1969 a syntactic analogy between the programs of simply typed lambda calculus and the proofs...

theory and type theory, a pure type system (PTS), previously known as a generalized type system (GTS), is a form of typed lambda calculus that allows...