Please use this identifier to cite or link to this item:
|Title:||A theory of overloading|
|Citation:||Stuckey, P.J., Sulzmann, M. (2005). A theory of overloading. ACM Transactions on Programming Languages and Systems 27 (6) : 1216-1269. ScholarBank@NUS Repository. https://doi.org/10.1145/1108970.1108974|
|Abstract:||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. © 2005 ACM.|
|Source Title:||ACM Transactions on Programming Languages and Systems|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 20, 2018
WEB OF SCIENCETM
checked on Nov 13, 2018
checked on Nov 17, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.