Personal tools

Dependent type

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
(Simulating them: links to Type arithmetic)
(Dependently typed languages)
 
(18 intermediate revisions by 14 users not shown)
Line 4: Line 4:
   
 
=== General ===
 
=== General ===
[http://en.wikipedia.org/wiki/Dependent_types Wikipedia]
 
   
[http://www-sop.inria.fr/oasis/Caminha00/abstract.html Dependent Types in Programming] abstract in APPSEM'2000
+
* [http://en.wikipedia.org/wiki/Dependent_types Wikipedia]
  +
* [http://www-sop.inria.fr/oasis/Caminha00/abstract.html Dependent Types in Programming] abstract in APPSEM'2000
  +
* [http://www.brics.dk/RS/01/10/BRICS-RS-01-10.ps.gz Do we need dependent types?] by Daniel Fridlender and Mia Indrika, 2001.
  +
   
 
=== Type theory ===
 
=== Type theory ===
Line 34: Line 33:
   
 
[http://www.e-pig.org/ Epigram] is a full dependently typed programming language, see especially
 
[http://www.e-pig.org/ Epigram] is a full dependently typed programming language, see especially
* [http://www.e-pig.org/downloads/epigram-notes.pdf Epigram Tutorial] by Conor McBride
+
* [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.115.9718&rep=rep1&type=pdf Epigram Tutorial] by Conor McBride
* and [http://www.e-pig.org/downloads/ydtm.pdf Why dependent types matter] by Thorsten Altenkirch, Conor McBride and James McKinna).
+
* and [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.8190&rep=rep1&type=pdf Why dependent types matter] by Thorsten Altenkirch, Conor McBride and James McKinna).
   
Dependent types (of this language) also provide a not-forgetful concept of '''views''' (already mentioned in the Haskell [[Future#Extensions of Haskell]];
+
Dependent types (of this language) also provide a not-forgetful concept of '''views''' (already mentioned in the Haskell [[Future of Haskell#Extensions of Haskell]];
 
the connection between these concepts is described in p. 32 of Epigram Tutorial (section ''4.6 Patterns Forget; Matching Is Remembering'').
 
the connection between these concepts is described in p. 32 of Epigram Tutorial (section ''4.6 Patterns Forget; Matching Is Remembering'').
   
Line 44: Line 43:
 
=== Agda ===
 
=== Agda ===
   
[http://www.cs.chalmers.se/~catarina/agda/ Agda] is a system for incrementally developing proofs and programs. Agda is also a functional language with dependent types. This language is very similar to [http://www.cs.chalmers.se/~augustss/cayenne/index.html cayenne] and agda is intended to be a (almost) full implementation of it in the future.
+
[http://www.cs.chalmers.se/~ulfn/Agda/ Agda] is a system for incrementally developing proofs and programs. Agda is also a functional language with dependent types. This language is similar to Epigram but has a more Haskell-like syntax.
   
 
People who are interested also in theorem proving may see the [[Libraries and tools/Theorem provers|theorem provers]] page.
 
People who are interested also in theorem proving may see the [[Libraries and tools/Theorem provers|theorem provers]] page.
   
=== Cayenne ===
+
=== Idris ===
   
[http://www.cs.chalmers.se/~augustss/cayenne/index.html Cayenne] is influenced also by constructive type theory (see its page).
+
[http://idris-lang.org/ Idris] is a general purpose pure functional programming language with dependent types, eager evaluation, and optional lazy evaluation via laziness annotations. It has a very Haskell-like syntax and is available on [http://hackage.haskell.org/package/idris Hackage].
   
Dependent types make it possible not to have a separate module lenguage and a core language. This idea may concern Haskell too, see [[First-class module]] page.
+
Idris is actively developed by [http://edwinb.wordpress.com/ Edwin Brady] at the [http://www.cs.st-andrews.ac.uk/ University of St. Andrews].
   
Depandent types make it useful also as a [[Libraries and tools/Theorem provers|theorem prover]].
+
=== Cayenne ===
=== Other techniques ===
 
   
[http://www-sop.inria.fr/oasis/DTP00/ APPSEM Workshop on Subtyping & Dependent Types in Programming]
+
[http://www.augustsson.net/Darcs/Cayenne/html/ Cayenne] is influenced also by [http://en.wikipedia.org/wiki/Constructive_type_theory constructive type theory].
  +
  +
Dependent types make it possible not to have a separate module language and a core language. This idea may concern Haskell too, see [[First-class module]] page.
  +
  +
Dependent types make it useful also as a [[Applications and libraries/Theorem provers|theorem prover]].
   
 
== Dependent types in Haskell programming ==
 
== Dependent types in Haskell programming ==
  +
  +
=== Lightweight Dependent Typing ===
  +
[http://pobox.com/~oleg/ftp/Computation/lightweight-dependent-typing.html This web page] describes the lightweight approach
  +
and its applications, e.g., statically safe head/tail functions and
  +
the elimination
  +
of array bound check (even in such complex algorithms as Knuth-Morris-Pratt
  +
string search). The page also briefly describes `singleton types' (Hayashi and
  +
Xi).
  +
  +
=== Library ===
  +
  +
[http://www.cs.st-and.ac.uk/~eb/ivor.php Ivor] is type theory based theorem proving library -- written by [http://www.dcs.st-and.ac.uk/~eb/index.php Edwin Brady] (see also the author's homepage, there are a lot of materials concerning dependent type theory there).
   
 
=== Proposals ===
 
=== Proposals ===
Line 64: Line 75:
   
 
=== Simulating them ===
 
=== Simulating them ===
* [http://haskell.org/hawiki/SimulatingDependentTypes SimulatingDependentTypes] of HaWiki
+
* [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.2636 Faking it: Simulating Dependent Types in Haskell], by Conor McBride
  +
* <s>[http://haskell.org/hawiki/SimulatingDependentTypes SimulatingDependentTypes] of HaWiki</s> (404 Error)
 
* The [[Type#See also|''See also'' section of Type]] page contains links to many related idioms. Especially [[type arithmetic]] seems to me also a way yielding some tastes from dependent type theory.
 
* The [[Type#See also|''See also'' section of Type]] page contains links to many related idioms. Especially [[type arithmetic]] seems to me also a way yielding some tastes from dependent type theory.
 
* On the usefulness of such idioms in practice, see HaskellDB's pages
 
* On the usefulness of such idioms in practice, see HaskellDB's pages
Line 71: Line 82:
   
 
[[Category:Theoretical foundations]]
 
[[Category:Theoretical foundations]]
  +
  +
[[Category:Type-level programming]]

Latest revision as of 11:35, 16 June 2013

Contents


[edit] 1 The concept of dependent types

[edit] 1.1 General


[edit] 1.2 Type theory

Simon Thompson: Type Theory and Functional Programming. Section 6.3 deals with dependent types, but because of the strong emphasis on Curry-Howard isomorphism and the connections between logic and programming, the book seemed cathartic for me even from its beginning.

Another interesting approach to Curry-Howard isomorphism and the concept of dependent type: Lecture 9. Semantics and pragmatics of text and dialogue dicsusses these concepts in the context of linguistics. Written by Arne Ranta, see also his online course and other linguistical materials on the Linguistics wikipage.

Types Forum

[edit] 1.3 Illative combinatory logic

To see how Illative Combinatory logic 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}


[edit] 2 Dependently typed languages

[edit] 2.1 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 of Haskell#Extensions of Haskell; the connection between these concepts is described in p. 32 of Epigram Tutorial (section 4.6 Patterns Forget; Matching Is Remembering).

See Epigram also as theorem prover.

[edit] 2.2 Agda

Agda is a system for incrementally developing proofs and programs. Agda is also a functional language with dependent types. This language is similar to Epigram but has a more Haskell-like syntax.

People who are interested also in theorem proving may see the theorem provers page.

[edit] 2.3 Idris

Idris is a general purpose pure functional programming language with dependent types, eager evaluation, and optional lazy evaluation via laziness annotations. It has a very Haskell-like syntax and is available on Hackage.

Idris is actively developed by Edwin Brady at the University of St. Andrews.

[edit] 2.4 Cayenne

Cayenne is influenced also by constructive type theory.

Dependent types make it possible not to have a separate module language and a core language. This idea may concern Haskell too, see First-class module page.

Dependent types make it useful also as a theorem prover.

[edit] 3 Dependent types in Haskell programming

[edit] 3.1 Lightweight Dependent Typing

This web page describes the lightweight approach and its applications, e.g., statically safe head/tail functions and the elimination of array bound check (even in such complex algorithms as Knuth-Morris-Pratt string search). The page also briefly describes `singleton types' (Hayashi and Xi).

[edit] 3.2 Library

Ivor is type theory based theorem proving library -- written by Edwin Brady (see also the author's homepage, there are a lot of materials concerning dependent type theory there).

[edit] 3.3 Proposals

John Hughes: Dependent Types in Haskell (some ideas).

[edit] 3.4 Simulating them