Simplifying subtyping constraints: a theory

DOI10.1006/inco.2001.2963zbMath1005.68038OpenAlexW2093036100MaRDI QIDQ1854464

François Pottier

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.2963

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (5)

Explicit effect subtyping ⋮ Size-based termination of higher-order rewriting ⋮ Backward type inference for XML queries ⋮ Type inference and strong static type checking for Promela ⋮ A type-based analysis of causality loops in hybrid systems modelers

Uses Software

• ML
• BANE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamental properties of infinite trees
• A semantics of multiple inheritance
• A theory of type polymorphism in programming
• Interconvertibility of a class of set constraints and context-free-language reachability
• Optimal representations of polymorphic types with subtyping
• Decidability of systems of set constraints with negative constraints
• Efficient inference of object types
• Simplifying subtyping constraints
• An ideal model for recursive polymorphic types
• Subtyping constrained types
• A framework for type inference with subtyping

This page was built for publication: Simplifying subtyping constraints: a theory