article · 1993

Implementing type classes

Cited by 61Open access

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.

Cite this paper

APA 7

Peterson, J., & Jones, M. P. (1993). Implementing type classes. https://doi.org/10.1145/155090.155112

MLA 9

Peterson, John, and Mark P. Jones. “Implementing type classes.” 1993, pp. 227–36, https://doi.org/10.1145/155090.155112.

Chicago

Peterson, John, and Mark P. Jones. 1993. “Implementing type classes.” https://doi.org/10.1145/155090.155112.

Harvard

Peterson, J. and Jones, M.P. (1993) ‘Implementing type classes’. Available at: https://doi.org/10.1145/155090.155112.

BibTeX

@article{peterson1993implementing,
  title = {{Implementing type classes}},
  author = {Peterson, John and Jones, Mark P.},
  pages = {227--236},
  year = {1993},
  doi = {10.1145/155090.155112}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.