Please use this identifier to cite or link to this item:
|Title:||HM(X) type inference is CLP(X) solving|
|Authors:||Sulzmann, M. |
|Citation:||Sulzmann, M., Stuckey, P.J. (2008). HM(X) type inference is CLP(X) solving. Journal of Functional Programming 18 (2) : 251-283. ScholarBank@NUS Repository. https://doi.org/10.1017/S0956796807006569|
|Abstract:||The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the program text, which are then solved by the domain-specific constraint solver X. The solver has to be invoked at the latest when type inference reaches a let node so that we can build a polymorphic type. A typical example of such an inference approach is Milner's algorithm W. We formalize an inference approach where the HM(X) type inference problem is first mapped to a CLP(X) program. The actual type inference is achieved by executing the CLP(X) program. Such an inference approach supports the uniform construction of type inference algorithms and has important practical consequences when it comes to reporting type errors. The CLP(X) style inference system, where X is defined by Constraint Handling Rules, is implemented as part of the Chameleon system. © 2007 Cambridge University Press.|
|Source Title:||Journal of Functional Programming|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 17, 2018
WEB OF SCIENCETM
checked on Oct 9, 2018
checked on Sep 7, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.