Lightweight Extensible Records for Haskell

  title={Lightweight Extensible Records for Haskell},
  author={Simon L. Peyton Jones},
Early versions of Haskell provied only a positional notation to build and take apart user-de ned datatypes. This positional notation is awkward and error-prone when dealing with datatypes that have more than a couple of components, so later versions of Haskell introduced a mechanism for labeled elds that allows components to be set and extracted by name. While this has been useful in practice, it also has several signi cant problems; for example, no eld name can be used in more than one… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS
25 Citations
13 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 13 references

Hugs 98 user manual

  • M. Jones, J. Peterson
  • Technical report, Oregon Graduate Institute,
  • 1999
1 Excerpt

Restricted data types in Haskell

  • R. Hughes
  • 1999
1 Excerpt

Polymorphic extensible records for Haskell

  • B. Gaster
  • In J. Launchbury, editor, Haskell workshop,
  • 1997
1 Excerpt

Theoretical aspects of object-oriented programming

  • C. Gunter, J. Mitchell, editors
  • 1994

A theory of quali ed types

  • M. Jones
  • In European Symposium on Programming (ESOP'92),
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…