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.
Cite
CITATION STYLE
Hall, C., Hammond, K., Jones, S. P., & Wadler, P. (1994). Type classes in Haskell. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 788 LNCS, pp. 241–256). Springer Verlag. https://doi.org/10.1007/3-540-57880-3_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
