Intersection types with subtyping by means of cut elimination

DOI10.3233/FI-2012-776MaRDI QIDQ4903719zbMATH OpenOpenAlexFDO

Authors Olivier Laurent

Publication date 24 January 2013

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2012-776

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Cut-elimination and normal-form theorems (03F05)

Recommendations

• scientific article; zbMATH DE number 7526056
• Cut-elimination in the strict intersection type assignment system is strongly normalizing
• Intersection and union types: Syntax and semantics
• Strongly normalising cut-elimination with strict intersection types
• scientific article; zbMATH DE number 1361533

Cited in

(4)

• Judgmental subtyping systems with intersection types and modal types
• Cut-elimination for simple type theory with an axiom of choice
• Taming the merge operator
• Fast verified BCD subtyping

This page was built for publication: Intersection types with subtyping by means of cut elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903719)