Simplifying subtyping constraints
From MaRDI portal
Publication:2817691
DOI10.1145/232627.232642zbMath1345.68070OpenAlexW2051981528MaRDI QIDQ2817691
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
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (6)
Type inference for record concatenation and subtyping ⋮ Non-structural subtype entailment in automata theory ⋮ Type Inference using Constraint Handling Rules ⋮ Semi-explicit first-class polymorphism for ML. ⋮ Simplifying subtyping constraints: a theory ⋮ Subtyping constrained types
This page was built for publication: Simplifying subtyping constraints
