A theory of overloading
AuthorStuckey, PJ; Sulzmann, M
Source TitleACM Transactions on Programming Languages and Systems
PublisherASSOC COMPUTING MACHINERY
University of Melbourne Author/sStuckey, Peter
AffiliationComputer Science and Software Engineering
Document TypeJournal Article
CitationsStuckey, P. J. & Sulzmann, M. (2005). A theory of overloading. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 27 (6), pp.1216-1269. https://doi.org/10.1145/1108970.1108974.
Access StatusThis item is currently not available from this repository
We present a novel approach to allow for overloading of identifiers in the spirit of type classes. 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, that provide our scheme with a form of programmable type language. 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 provides a common formal basis for many type class extensions such as multiparameter type classes and functional dependencies.
KeywordsComputer Software; Information Systems
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References