Everything about Intersection type discipline
Branch of type theory
In mathematical logic, the intersection type discipline is a branch of type theory encompassing type systems that use the intersection type constructor to assign multiple types to a single term. In particular, if a term can be assigned both the type and the type, then can be assigned the intersection type . Therefore, the intersection type constructor can be used to express finite heterogeneous ad hoc polymorphism . For example, the λ-term can be assigned the type in most intersection type systems, assuming for the term variable both the function type and the corresponding argument type. Wikipedia â
đ§ Start here: a 6-step reading path
- Read the overview: Intersection type disciplineA 5-minute orientation
- Pick up a classic book: Intelligence BulletinThe most-reprinted book on the subject
- Read the landmark paper: Complete restrictions of the intersection type disciplineCited 90 times
- Go sideways: Simply typed lambda calculusA closely related topic
- Go sideways: Lambda cubeA closely related topic
đ Definitions
No dictionary entry for this exact phrase.
đïž The subject at a glance
đ Landmark papers (most cited)
Complete restrictions of the intersection type discipline
Principal type scheme and unification for intersection type discipline
The untyped computational λ-calculus and its intersection type discipline
On Type Inference in the Intersection Type Discipline
On strong normalization and type inference in the intersection type discipline
Natural Deduction and Normalization Proofs for the Intersection Type Discipline
đ Books worth reading
Intelligence BulletinUnited States. War Department. Military Intelligence Service · 1942
Cartesian meditationsEdmund Husserl, Dorion Cairns · 1960
Creative marginalityMattei Dogan · 1990- đIntersections of Personal and Social IdentitiesChild and Adolescent Development Staff (CAD), Kimberly Ann Radmacher · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đ Related topics
- Simply typed lambda calculus The simply typed lambda calculus (â λââ ), a form of type theory, is a typed interpretation of the lambda calculus with only one type constructor (â ââ ) thatâŠ
- Lambda cube In mathematical logic and type theory, the λ-cube (also written lambda cube) is a framework introduced by Henk Barendregt to investigate the differentâŠ
- Kappa calculus In mathematical logic, category theory, and computer science, kappa calculus is a formal system for defining first-order functions. Unlike lambda calculusâŠ
- Mariangiola Dezani-Ciancaglini Mariangiola Dezani-Ciancaglini (born 22 December 1946) is an Italian logician and theoretical computer scientist whose research topics include type theoryâŠ
- Normalisation by evaluation In programming language semantics, normalisation by evaluation (NBE) is a method of obtaining the normal form of terms in the λ-calculus by appealing toâŠ
- HindleyâMilner type system A HindleyâMilner (HM) type system is a classical type system for the lambda calculus with parametric polymorphism. It is also known as DamasâMilner orâŠ
- Lambda-mu calculus In mathematical logic and computer science, the lambda-mu calculus is an extension of the lambda calculus introduced by Michel Parigot. It introduces twoâŠ
- Böhm tree In the study of denotational semantics of the lambda calculus, Böhm trees, LĂ©vy-Longo trees, and Berarducci trees are (potentially infinite) tree-likeâŠ