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.
Original language | English |
---|---|
Title of host publication | Programming Languages and Systems - 4th Asian Symposium, APLAS 2006, Proceedings |
Publisher | Springer |
Pages | 1-25 |
Number of pages | 25 |
ISBN (Print) | 3540489371, 9783540489375 |
Publication status | Published - 1 Jan 2006 |
Externally published | Yes |
Event | Asian Symposium on Programming Languages and Systems 2006 - Sydney, Australia Duration: 8 Nov 2006 → 10 Nov 2006 Conference number: 4th https://link.springer.com/book/10.1007/11924661 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Volume | 4279 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | Asian Symposium on Programming Languages and Systems 2006 |
---|---|
Abbreviated title | APLAS 2006 |
Country/Territory | Australia |
City | Sydney |
Period | 8/11/06 → 10/11/06 |
Internet address |
|