Subtyping constrained types [chapter]

Valery Trifonov, Scott Smith
1996 Lecture Notes in Computer Science  
A constrained type is a type that comes with a set of subtyping constraints on variables occurring in the type. Constrained type inference systems are a natural generalization of Hindley/Milner type inference to languages with subtyping. This paper develops several subtyping relations on polymorphic constrained types of a general form that allows recursive constraints and multiple bounds on type variables. Subtyping constrained types has applications to signature matching and to constrained type simplification.
doi:10.1007/3-540-61739-6_52 fatcat:fvmhiolphrhwzkovlqkc3yawt4