Work

Type classes in Haskell

Year: 1996

Type: article

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.

Source: ACM Transactions on Programming Languages and Systems

DOI: 10.1145/227699.227700

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

Institution: University of Glasgow

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: Royal Society, Royal Society of Edinburgh, State Key Laboratory of Satellite Ocean Environment Dynamics, Engineering and Physical Sciences Research Council

OpenAlex ID: W2095136535

FWCI: 9.119

Cites: 40

Cited by: 254

Related to: 10