Type classes in Haskell

Type classes in Haskell (1996)

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

Venue:	ACM Transactions on Programming Languages and Systems
Citations:	111 - 5 self

Datum	Value	Source
TITLE	Type classes in Haskell	SVM HeaderParse 0.2
AUTHOR NAME	Cordelia Hall	SVM HeaderParse 0.2
AUTHOR AFFIL	Glasgow University	SVM HeaderParse 0.2
AUTHOR NAME	Kevin Hammond	SVM HeaderParse 0.2
AUTHOR AFFIL	Glasgow University	SVM HeaderParse 0.2
AUTHOR NAME	Simon Peyton Jones	SVM HeaderParse 0.2
AUTHOR AFFIL	Glasgow University	SVM HeaderParse 0.2
AUTHOR NAME	Philip Wadler	SVM HeaderParse 0.2
AUTHOR AFFIL	Glasgow University	SVM HeaderParse 0.2
ABSTRACT	This paper de nes 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. 1.	SVM HeaderParse 0.2
CITATIONS	25 found	ParsCit 1.0