A theory of overloading

Peter J. Stuckey, Martin Sulzmann

Research output: Contribution to conferencePaperpeer-review

20 Citations (Scopus)

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 languageEnglish
Pages167-178
Number of pages12
Publication statusPublished - 1 Dec 2002
Externally publishedYes
EventProceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02) - Pittsburgh, United States of America
Duration: 4 Oct 20026 Oct 2002

Conference

ConferenceProceedings of the Seventh ACM SIGPLAN; International Conference on Functional Programming (ICFP'02)
CountryUnited States of America
CityPittsburgh
Period4/10/026/10/02

Keywords

  • Constraints
  • Overloading
  • Type classes
  • Type inference

Cite this