Type classes in Haskell

Cordelia Hall, Kevin Hammond, Simon Peyton Jones, Philip Wadler

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract / Description of output

This paper defines a set of type inference rules for resolving over-loading 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.
Original languageEnglish
Title of host publicationProgramming Languages and Systems ESOP '94
EditorsDonald Sannella
PublisherSpringer-Verlag GmbH
Number of pages16
ISBN (Print)978-3-540-57880-2
Publication statusPublished - 1994

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


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

Cite this