Please use this identifier to cite or link to this item:
|Title:||Type processing by constraint reasoning||Authors:||Stuckey, P.J.
|Issue Date:||2006||Citation:||Stuckey, P.J.,Sulzmann, M.,Wazny, J. (2006). Type processing by constraint reasoning. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4279 LNCS : 1-25. ScholarBank@NUS Repository.||Abstract:||Herbrand constraint solving or unification has long been understood as an efficient mechanism for type checking and inference for programs using Hindley/Milner types. If we step back from the particular solving mechanisms used for Hindley/Milner types, and understand type operations in terms of constraints we not only give a basis for handling Hindley/Milner extensions, but also gain insight into type reasoning even on pure Hindley/Milner types, particularly for type errors. In this paper we consider typing problems as constraint problems and show which constraint algorithms are required to support various typing questions. We use a light weight constraint reasoning formalism, Constraint Handling Rules, to generate suitable algorithms for many popular extensions to Hindley/Milner types. The algorithms we discuss are all implemented as part of the freely available Chameleon system. © Springer-Verlag Berlin Heidelberg 2006.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/42133||ISBN:||3540489371||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 22, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.