Difference between revisions of "Extensible record"

From HaskellWiki
Jump to: navigation, search
m (Libraries on hackage: alphabetical ordering...)
(Libraries on hackage: records is not used in Grapefruit (see further up on the page), but derived from the grapefruit-records package)
Line 21: Line 21:
* [http://hackage.haskell.org/package/HList HList]
* [http://hackage.haskell.org/package/HList HList]
* [http://hackage.haskell.org/package/named-records named-records]
* [http://hackage.haskell.org/package/named-records named-records]
* [http://hackage.haskell.org/package/records records] (used in grapefruit)
* [http://hackage.haskell.org/package/records records]
* [http://hackage.haskell.org/package/vinyl vinyl]
* [http://hackage.haskell.org/package/vinyl vinyl]

Revision as of 21:00, 22 April 2013

Proposals, implementations can be found on the FirstClassLabels page of Haskell' Wiki.

Papers and libraries

Libraries on hackage


Declarative database management

Such systems can achieve more type safety (compared to direct SQL handling). They usually formulate a relational algebra concept in a declarative language.


A problem where some concepts of extensible records could be useful is described in the HaskellDB project. More precisely, the problem is described in the paper downloadable from

HaskellDB uses its own extensible record system, but see also HaskellDB#Future.


CoddFish is another declarative, type safe database system. As for extensible record system, it uses HList --- a Haskell library for strongly typed heterogeneous collections.

Functional Reactive Programming

FRP often makes it necessary to deal with very large tuples as arrow inputs and outputs. For example, a GUI component would receive the behavior of all its writeable properties as its input. Extensible records can therefore make FRP more usable, especially if they provide defaulting.


Grapefruit uses extensible records which support pattern matching and defaulting for functional reactive GUI programming.

Related concepts

Dependent type -- as an explanation for its relatedness here, see Why Dependent Types Matter written by Thorsten Altenkirch, Conor McBride, James McKinna -- or see at least its Conclusions section (section 8, pages 18--19).

Type arithmetic seems to me also a way yielding some tastes from dependent type theory.

Relational algebra implementations usually use extensible records.