Decidability of higher-order subtyping with intersection types

DOI10.1007/BFB0022246MaRDI QIDQ4474829zbMATH OpenFDO

Authors Adriana Compagnoni

Publication date 21 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0022246

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Recommendations

• Higher-order subtyping and its decidability
• Higher-order subtyping
• Syntactic Metatheory of Higher-Order Subtyping
• scientific article; zbMATH DE number 954811
• A decidable subtyping logic for intersection and union types

Cited in

(17)

• Order-sorted inductive types
• Higher-order subtyping
• The subtyping problem for second-order types is undecidable.
• Typed operational semantics for higher-order subtyping.
• A decidable subtyping logic for intersection and union types
• On the decidability of subtyping with bounded existential types and implementation constraints
• Comparing object encodings.
• Type destructors
• Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping
• Syntactically restricting bounded polymorphism for decidable subtyping
• scientific article; zbMATH DE number 2185668 (Why is no real title available?)
• Syntactic Metatheory of Higher-Order Subtyping
• scientific article; zbMATH DE number 954811 (Why is no real title available?)
• Decidability in Intuitionistic Type Theory is Functionally Decidable
• Anti-symmetry of higher-order subtyping and equality by subtyping
• Subtyping dependent types
• Higher-order subtyping and its decidability

This page was built for publication: Decidability of higher-order subtyping with intersection types

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