Type Classes and Constraint Handling Rules
| dc.creator | Glynn, Kevin | |
| dc.creator | Sulzmann, Martin | |
| dc.creator | Stuckey, Peter J. | |
| dc.date | 2000-06-26 | |
| dc.date.accessioned | 2026-07-07T03:16:18Z | |
| dc.date.available | 2026-07-07T03:16:18Z | |
| dc.description | Type classes are an elegant extension to traditional, Hindley-Milner based typing systems. They are used in modern, typed languages such as Haskell to support controlled overloading of symbols. Haskell 98 supports only single-parameter and constructor type classes. Other extensions such as multi-parameter type classes are highly desired but are still not officially supported by Haskell. Subtle issues arise with extensions, which may lead to a loss of feasible type inference or ambiguous programs. A proper logical basis for type class systems seems to be missing. Such a basis would allow extensions to be characterised and studied rigorously. We propose to employ Constraint Handling Rules as a tool to study and develop type class systems in a uniform way. | |
| dc.description | 14 pages, Workshop on Rule-Based Constraint Reasoning and Programming (http://www.informatik.uni-muenchen.de/~fruehwir/cl2000r.html) | |
| dc.identifier | https://arxiv.org/abs/cs/0006034 | |
| dc.identifier | http://arxiv.org/abs/cs/0006034 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30303 | |
| dc.subject | Programming Languages | |
| dc.subject | D.3.3; F.3.1 | |
| dc.title | Type Classes and Constraint Handling Rules | |
| dc.type | text |