Type Classes in Haskell

145Citations
Citations of this article
56Readers
Mendeley users who have this article in their library.

Abstract

This article defines a set of type inference rules for resolving overloading introduced by type classes, as used in the functional programming language Haskell. Programs including type classes are transformed into ones which may be typed by standard Hindley-Milner inference rules. In contrast to other work on type classes, the rules presented here relate directly to Haskell programs. An innovative aspect of this work is the use of second-order lambda calculus to record type information in the transformed program.

Cite

CITATION STYLE

APA

Hall, C. V., Hammond, K., Peyton Jones, S. L., & Wadler, P. L. (1996). Type Classes in Haskell. ACM Transactions on Programming Languages and Systems, 18(2), 109–138. https://doi.org/10.1145/227699.227700

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free