Personal tools

Dependent type

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
(Adding link to Agda and Cayene, as examples of dependently typed languages. Reference to Cayene will create a new First-class module page)
m (typographic correction)
Line 42: Line 42:
 
“[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/~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.“
   
People who are interested also in theorem proving may sse 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.
   
 
== Cayene ==
 
== Cayene ==

Revision as of 10:15, 28 March 2006

Contents


1 The concept of dependent types

1.1 General

Wikipedia

Dependent Types in Programming abstract in APPSEM'2000

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.

Types Forum

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}


2 Dependently typed languages

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

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 very similar to cayenne and agda is intended to be a (almost) full implementation of it in the future.“

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

2.3 Cayene

Cayene is influenced also by constructive type theory (see its page). 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.

2.4 Other techniques

APPSEM Workshop on Subtyping & Dependent Types in Programming

3 Dependent types in Haskell programming

3.1 Proposals

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

3.2 Simulating them