Typed lambda calculus
A typed
Typed lambda calculi are foundational
Typed lambda calculi are closely related to
Kinds of typed lambda calculi
Various typed lambda calculi have been studied. The simply typed lambda calculus has only one type constructor, the arrow , and its only types are
Some typed lambda calculi introduce a notion of subtyping, i.e. if is a subtype of , then all terms of type also have type . Typed lambda calculi with subtyping are the simply typed lambda calculus with conjunctive types and
All the systems mentioned so far, with the exception of the untyped lambda calculus, are
Applications to programming languages
In
See also
- Kappa calculus—an analogue of typed lambda calculus which excludes higher-order functions
Notes
- ^ Brandl, Helmut (27 April 2024). "Typed Lambda Calculus / Calculus of Constructions" (PDF). Calculus of Constructions (PDF). Retrieved 27 April 2024.
{{cite web}}
: Check|archive-url=
value (help)CS1 maint: url-status (link) - MR 0856915
- ISSN 0956-7968.
- ^ since the halting problem for the latter class was proven to be undecidable
- ^ "What to know before debating type systems | Ovid [blogs.perl.org]". blogs.perl.org. Retrieved 2024-04-26.
Further reading
- Barendregt, Henk (1992). "Lambda Calculi with Types". In Abramsky, S. (ed.). Background: Computational Structures. Handbook of Logic in Computer Science. Vol. 2. Oxford University Press. pp. 117–309. ISBN 9780198537618.
- Brandl, Helmut (2022). Calculus of Constructions / Typed Lambda Calculus