Type inference with inequalities

DOI10.1007/3-540-53982-4_24MaRDI QIDQ2736357zbMATH OpenFDO

Authors Michael I. Schwartzbach

Publication date 29 August 2001

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

Full work available at URL https://doi.org/10.1007/3-540-53982-4_24

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Satisfying subtype inequalities in polynomial space
• scientific article; zbMATH DE number 445157
• scientific article; zbMATH DE number 3930968
• Type inference in polymorphic type discipline
• Type inference with non-structural subtyping

Cited in

(8)

• Some complexity bounds for subtype inequalities
• A computational complexity analysis of tunable type inference for Generic Universe Types
• Minimal type inference for linked data consumers
• scientific article; zbMATH DE number 18625 (Why is no real title available?)
• scientific article; zbMATH DE number 922624 (Why is no real title available?)
• Inferring program specifications in polynomial-time
• Type reconstruction with recursive types and atomic subtyping
• Type inference for first-class messages with feature constraints

This page was built for publication: Type inference with inequalities

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