- 1 The concept of dependent types
- 2 Dependently typed languages
- 3 Dependent types in Haskell programming
The concept of dependent types
- Dependent Types in Programming abstract in APPSEM'2000
- Do we need dependent types? by Daniel Fridlender and Mia Indrika, 2001.
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.
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 of Epigram corresponds to in Illative Combinatory Logic. I think e.g. the followings should correspond to each other:
Dependently typed languages
Epigram is a full dependently typed programming language, see especially
- Epigram Tutorial by Conor McBride
- and 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 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.
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.
Cayenne is influenced also by constructive type theory (see its page).
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.
Depandent types make it useful also as a theorem prover.
Qi is a Lisp-based functional programming language. It provides many possibilities (currying, pattern matching, type checking etc.), and it uses sequent calculus notation for defining new types. This enables a very powerful type system.
Also Blaise is a Lisp-based language with dependent types. It will be released under GPL, but has not yet a released implementation.
Dependent types in Haskell programming
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).
John Hughes: Dependent Types in Haskell (some ideas).
- SimulatingDependentTypes of HaWiki
- The 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