Simplifying subtyping constraints

DOI10.1145/232627.232642MaRDI QIDQ2817691zbMATH OpenOpenAlexFDO

Authors François Pottier

Publication date 1 September 2016

Published in Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/232627.232642

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Simplifying subtyping constraints: a theory
• A type inference system based on saturation of subtyping constraints
• Subtyping constrained types
• Optimal representations of polymorphic types with subtyping
• Polymorphic type inference with overloading and subtyping

Cited in

(10)

• Optimal representations of polymorphic types with subtyping
• Semi-explicit first-class polymorphism for ML.
• Simplifying subtyping constraints: a theory
• Type inference for record concatenation and subtyping
• Non-structural subtype entailment in automata theory
• A type inference system based on saturation of subtyping constraints
• Type inference using constraint handling rules
• scientific article; zbMATH DE number 1500567 (Why is no real title available?)
• Subtyping constrained types
• Simplifying explicit subtyping coercions in a polymorphic calculus with effects

This page was built for publication: Simplifying subtyping constraints

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