Loading...
research article
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.
Loading...
Name
tapos98.ps.gz.gz
Access type
openaccess
Size
165.17 KB
Format
Unknown
Checksum (MD5)
b2727268df06a5f3f8166d4787b067ae