Type Inference with Constrained Types

In 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.


Published in:
Theory and Practice of Object Systems, 5, 1, 35
Year:
1999
Laboratories:




 Record created 2006-01-24, last modified 2018-03-17

n/a:
Download fulltext
PS.GZ

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)