Personal tools

Extensible record

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
(/*Declarative database management*/ and - Related concepts: : inititating new (theoretical) page Relational agebra)
m (Related concepts: links to Type arithmetic)
Line 36: Line 36:
 
[[Dependent type]] -- as an explanation for its relatedness here, see [http://www.dcs.st-andrews.ac.uk/~james/RESEARCH/ydtm-submitted.pdf Why Dependent Types Matter] written by Thorsten Altenkirch, Conor McBride, James McKinna -- or see at least its ''Conclusions'' section (section 8, pages 18--19).
 
[[Dependent type]] -- as an explanation for its relatedness here, see [http://www.dcs.st-andrews.ac.uk/~james/RESEARCH/ydtm-submitted.pdf 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.
+
[[Type arithmetic]] seems to me also a way yielding some tastes from [[dependent type]] theory.
  +
  +
[[Relational algebra]] implementations usually use extensible records.
   
 
[[Category:Proposals]]
 
[[Category:Proposals]]

Revision as of 11:06, 17 June 2006

Contents


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

1 Papers and libraries

2 Applications

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

2.1.1 HaskellDB

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.

2.1.2 CoddFish

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

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