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.
Type
research article
Author(s)
Date Issued
1999
Published in
Volume
5
Issue
1
Start page
35
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
January 24, 2006
Use this identifier to reference this record