In mathematics and computer science, a typed lambda calculus is a typed formalism that uses the lambda symbol ( λ {\displaystyle \lambda } ) to denote anonymous function abstraction. In this context, types are usually objects of a syntactic nature that are assigned to lambda terms; the exact nature of a type depends on the calculus considered (see kinds below).
In mathematics and computer science, a typed lambda calculus is a typed formalism that uses the lambda symbol ( λ {\displaystyle \lambda } ) to denote anonymous function abstraction. In this context, types are usually objects of a syntactic nature that are assigned to lambda terms; the exact nature of a type depends on the calculus considered (see kinds below).
Source: Wikipedia "Typed lambda calculus" · CC BY-SA 4.0
Share this article: X · Bluesky