Abstract
We present a minimal extension of the Hindley/Milner system to allow for overloading of identifiers. Our approach relies on a combination of the HM(X) type system framework with Constraint Handling Rules (CHRs). CHRs are a declarative language for writing incremental constraint solvers. CHRs allow us to precisely describe the relationships among overloaded identifiers. Under some sufficient conditions on the CHRs we achieve decidable type inference and the semantic meaning of programs is unambiguous. Our approach allows us to combine open and closed world overloading. We also show how to deal with overlapping definitions.
| Original language | English |
|---|---|
| Pages | 167-178 |
| Number of pages | 12 |
| Publication status | Published - 1 Dec 2002 |
| Externally published | Yes |
| Event | Proceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02) - Pittsburgh, United States of America Duration: 4 Oct 2002 → 6 Oct 2002 |
Conference
| Conference | Proceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02) |
|---|---|
| Country/Territory | United States of America |
| City | Pittsburgh |
| Period | 4/10/02 → 6/10/02 |
Keywords
- Constraints
- Overloading
- Type classes
- Type inference