Skip to main content

Implementing Type Classes

John Peterson, Mark P. Jones

Publisher page dblp BibTeX

Abstract

We describe the implementation of a type checker for the functional programming language Haskell that supports the use of type classes. This extends the type system of ML to support overloading (ad-hoc polymorphism) and can be used to implement features such as equality types and numeric overloading in a simple and general way.

DOI 10.1145/155090.155112

Related papers

Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform ICFP 2009
Haskell session types with (almost) no class Haskell 2008
Instance chains: type class programming without overlapping instances ICFP 2010
Flexible types: robust type inference for first-class polymorphism POPL 2009
First-Class Data-Type Representations in SchemeXerox PLDI 1993
Dependent Types for Class-based Mutable Objects ECOOP 2018
HMF: simple type inference for first-class polymorphism ICFP 2008
Lightweight dependent classes GPCE 2008