Type Processing by Constraint Reasoning
| Autor: | Jeremy Wazny, Peter J. Stuckey, Martin Sulzmann |
|---|---|
| Rok vydání: | 2006 |
| Předmět: |
Constraint Handling Rules
Hindley–Milner type system Unification Programming language Computer science Inference Constraint satisfaction computer.software_genre TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Type theory Type checking TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Constraint reasoning Software_PROGRAMMINGLANGUAGES Functional dependency computer |
| Zdroj: | Programming Languages and Systems ISBN: 9783540489375 APLAS |
| DOI: | 10.1007/11924661_1 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|