Extensible record

From HaskellWiki
Revision as of 08:43, 17 June 2006 by EndreyMark (talk | contribs) (Declarative database management: and Related concepts: : inititating new (theoretical) page Relational agebra)

Jump to: navigation, search

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

Papers and libraries


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.

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).

Relational agebra implementations usually use extensible records.