A theory of overloading Export

@article{citeulike:994334, 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.}, address = {New York, NY, USA}, author = {Stuckey, Peter J. and Sulzmann, Martin}, citeulike-article-id = {994334}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1108974}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1108970.1108974}, doi = {10.1145/1108970.1108974}, issn = {0164-0925}, journal = {ACM Trans. Program. Lang. Syst.}, keywords = {fundeps, typeclass}, month = {November}, number = {6}, pages = {1216--1269}, posted-at = {2009-07-10 09:49:51}, priority = {2}, publisher = {ACM}, title = {A theory of overloading}, url = {http://dx.doi.org/10.1145/1108970.1108974}, volume = {27}, year = {2005} }

TY - JOUR ID - citeulike:994334 L3 - citeulike-article-id:994334 N2 - 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. IS - 6 JF - ACM Trans. Program. Lang. Syst. SN - 0164-0925 AD - New York, NY, USA EP - 1269 TI - A theory of overloading PB - ACM VL - 27 SP - 1216 KW - fundeps KW - typeclass AU - Stuckey, Peter AU - Sulzmann, Martin PY - 2005/11// UR - http://dx.doi.org/10.1145/1108970.1108974 ER -