Type classes in Haskell

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

doi:10.1007/3-540-57880-3_16

Type classes in Haskell

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

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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 language	English
Title of host publication	Programming Languages and Systems ESOP '94
Editors	Donald Sannella
Publisher	Springer
Pages	241-256
Number of pages	16
ISBN (Print)	978-3-540-57880-2
DOIs	https://doi.org/10.1007/3-540-57880-3_16
Publication status	Published - 1994

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin / Heidelberg
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/3-540-57880-3_16

http://dx.doi.org/10.1007/3-540-57880-3_16

Cite this

@inbook{a156a3fd0be54bcfb1facec9eb55604c,

title = "Type classes in Haskell",

abstract = "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.",

author = "Cordelia Hall and Kevin Hammond and {Peyton Jones}, Simon and Philip Wadler",

year = "1994",

doi = "10.1007/3-540-57880-3_16",

language = "English",

isbn = "978-3-540-57880-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "241--256",

editor = "Donald Sannella",

booktitle = "Programming Languages and Systems ESOP '94",

address = "United Kingdom",

}

TY - CHAP

T1 - Type classes in Haskell

AU - Hall, Cordelia

AU - Hammond, Kevin

AU - Peyton Jones, Simon

AU - Wadler, Philip

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

U2 - 10.1007/3-540-57880-3_16

DO - 10.1007/3-540-57880-3_16

M3 - Chapter

SN - 978-3-540-57880-2

T3 - Lecture Notes in Computer Science

SP - 241

EP - 256

BT - Programming Languages and Systems ESOP '94

A2 - Sannella, Donald

PB - Springer

ER -

Type classes in Haskell

Abstract / Description of output

Publication series

Access to Document

Fingerprint

Cite this