Type classes in Haskell

Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip L. Wadler

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

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.
Original languageEnglish
Pages (from-to)109-138
Number of pages30
JournalACM Letters on Programming Languages and Systems
Volume18
Issue number2
DOIs
Publication statusPublished - 1 Mar 1996

Fingerprint

Dive into the research topics of 'Type classes in Haskell'. Together they form a unique fingerprint.

Cite this