Type Classes in Haskell Export

@article{citeulike:4956, abstract = {This paper defines a set of type inference rules for resolving overloading introduced by type classes. Programs including type classes are transformed into ones which may be typed by the Hindley-Milner inference rules. In contrast to other work on type classes, the rules presented here relate directly to user programs. An innovative aspect of this work is the use of second-order lambda calculus to record type information in the program. 1 Introduction A funny thing happened on the way to...}, author = {Hall, Cordelia V. and Hammond, Kevin and Simon, S. L. P. and Wadler, Philip L.}, citeulike-article-id = {4956}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.5615}, journal = {ACM Transactions on Programming Languages and Systems}, keywords = {haskell, types}, month = {March}, number = {2}, pages = {109--138}, posted-at = {2007-03-19 15:48:07}, priority = {4}, publisher = {ACM Press}, title = {Type Classes in Haskell}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.5615}, volume = {18}, year = {1996} }

TY - JOUR ID - citeulike:4956 L3 - citeulike-article-id:4956 N2 - This paper defines a set of type inference rules for resolving overloading introduced by type classes. Programs including type classes are transformed into ones which may be typed by the Hindley-Milner inference rules. In contrast to other work on type classes, the rules presented here relate directly to user programs. An innovative aspect of this work is the use of second-order lambda calculus to record type information in the program. 1 Introduction A funny thing happened on the way to... IS - 2 JF - ACM Transactions on Programming Languages and Systems EP - 138 TI - Type Classes in Haskell PB - ACM Press VL - 18 SP - 109 KW - haskell KW - types AU - Hall, Cordelia AU - Hammond, Kevin AU - Simon, SLP AU - Wadler, Philip PY - 1996/March// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.5615 ER -