based on Constraint Handling Rules
The aim of this project is to develop a generic framework for designing
extensions to the Hindley/Milner systems in a uniform manner.
In previous work, we have introduced the HM(X) framework, an extension of the HM system
parameterized in the constraint domain X. Here, we use Constraint Handling Rules (CHRs)
to describe arbitrary first-order theories.
This provides the basis for the Chameleon language.
CHRs come with a simple operational semantics which allows our system to derive a type inference algorithm from a given set of CHRs. In particular, the CHR approach is useful for modelling overloading systems such as Haskell style type classes. We could also demonstrate that CHRs prove to be useful in other settings, e.g. security checking .
Last modified: Sun May 30 04:59:33 SGT 2004