Type Inference with Constrained Types

Odersky, MartinSulzmann, MartinWehr, Martin2006-01-242006-01-242006-01-24199910.1002/(SICI)1096-9942(199901/03)5:1<35::AID-TAPO4>3.0.CO;2-4https://infoscience.epfl.ch/handle/20.500.14299/221715In this paper we present a general framework HM(X) for Hindley/Milner style type systems with constraints, analogous to the CLP(X) framework in constrained logic programming. We show that the type system is sound with respect to a standard untyped compositional semantics. We present sufficient conditions on the constraint domain X so that the principal types property carries over to HM(X). The conditions turn out to be fairly simple and natural.Type Inference with Constrained Typestext::journal::journal article::research article