Intersection types and bounded polymorphism

DOI10.1017/S096012959600223XMaRDI QIDQ4340497zbMATH OpenOpenAlexFDO

Authors Benjamin C. Pierce

Publication date 9 October 1997

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s096012959600223x

zbMATH Keywords

second-order typed \(\lambda\)-calculus with bounded quantification and intersection typessubtypingtypechecking

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 512791
• scientific article; zbMATH DE number 814799
• Bounded quantification is undecidable

Cited in

(12)

• Basic theory of F-bounded quantification.
• Polar type inference with intersection types and
• On isomorphisms of intersection types
• On Isomorphisms of Intersection Types
• scientific article; zbMATH DE number 512791 (Why is no real title available?)
• scientific article; zbMATH DE number 1929308 (Why is no real title available?)
• scientific article; zbMATH DE number 814799 (Why is no real title available?)
• Relating Church-style and Curry-style subtyping
• scientific article; zbMATH DE number 7377974 (Why is no real title available?)
• scientific article; zbMATH DE number 7526056 (Why is no real title available?)
• Intersection types in Java: back to the future
• Non-local configuration of component interfaces by constraint satisfaction

This page was built for publication: Intersection types and bounded polymorphism

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