Name
Abstract | ||
|---|---|---|
We present guarded dependent type theory, gDTT, an extensional dependent type theory with a 'later' modality and clock quantifiers for programming and proving with guarded recursive and coinductive types. The later modality is used to ensure the productivity of recursive definitions in a modular, type based, way. Clock quantifiers are used for controlled elimination of the later modality and for encoding coinductive types using guarded recursive types. Key to the development of gDTT are novel type and term formers involving what we call 'delayed substitutions'. These generalise the applicative functor rules for the later modality considered in earlier work, and are crucial for programming and proving with dependent types. We show soundness of the type theory with respect to a denotational model. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-662-49630-5_2 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Discrete mathematics,Type theory,Algorithm,Functor,Coinduction,Modular design,Soundness,Recursive data type,Mathematics,Recursion,Encoding (memory) | Journal | 9634 |
ISSN | Citations | PageRank |
0302-9743 | 13 | 0.66 |
References | Authors | |
19 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ales Bizjak | 1 | 89 | 7.71 |
| Hans Bugge Grathwohl | 2 | 35 | 2.88 |
| Ranald Clouston | 3 | 65 | 8.01 |
| Rasmus Ejlers Møgelberg | 4 | 204 | 16.63 |
| Lars Birkedal | 5 | 1481 | 96.84 |