Dependent type

From HaskellWiki
Revision as of 16:48, 1 March 2006 by EndreyMark (talk | contribs) (,,Illative'' misstype corrected)

Jump to: navigation, search

The concept of dependent types

General

Wikipedia

Dependent Types in Programming abstract in APPSEM'2000

Type Theory

...

Illative Combinatory Logic

To see how Illative CombinatoryLogic deals with dependent types, see combinator G described in Systems of Illative Combinatory Logic complete for first-order propositional and predicate calculus by Henk Barendregt, Martin Bunder, Wil Dekkers. It seems to me that the dependent type construct \forall x : S \Rightarrow T of Epigram corresponds to \mathbf G\;S\;(\lambda x . T) in Illative Combinatory Logic. I think e.g. the followings should correspond to each other:

  • \mathrm{realNullvector} :\;\;\;\forall n: \mathrm{Nat} \Rightarrow \mathrm{RealVector}\;n
  • \mathbf G\;\,\mathrm{Nat}\;\,\mathrm{RealVector}\;\,\mathrm{realNullvector}


Dependently typed languages

Epigram

Epigram is a full dependently typed programming language see especially

Dependent types (of this language) also provide a not-forgetful concept of views (already mentioned in the Haskell Future; the connection between these concepts is described in p. 32 of Epigram Tutorial (section 4.6 Patterns Forget; Matching Is Remembering).

Other techniques

[APPSEM Workshop on Subtyping & Dependent Types in Programming

Dependent types in Haskell programming