CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Guarded Cubical Type Theory: Path Equality for Guarded Recursion

Lars Birkedal ; Aleš Bizjak ; Ranald Clouston ; Hans Bugge Grathwohl ; Bas Spitters ; Andrea Vezzosi (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers))
25th EACSL Annual Conference on Computer Science Logic (CSL 2016) (1868-8969). Vol. 62 (2016), p. 23:1-23:17.
[Konferensbidrag, refereegranskat]

This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of program logics, and for programming and reasoning with coinductive types. We wish to implement GDTT with decidable type checking, while still supporting non-trivial equality proofs that reason about the extensions of guarded recursive constructions. CTT is a variation of Martin-Löf type theory in which the identity type is replaced by abstract paths between terms. CTT provides a computational interpretation of functional extensionality, is conjectured to have decidable type checking, and has an implemented type checker. Our new type theory, called guarded cubical type theory, provides a computational interpretation of extensionality for guarded recursive types. This further expands the foundations of CTT as a basis for formalisation in mathematics and computer science. We present examples to demonstrate the expressivity of our type theory, all of which have been checked using a prototype type-checker implementation, and present semantics in a presheaf category.



Denna post skapades 2017-02-02. Senast ändrad 2017-06-28.
CPL Pubid: 247980

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)

Ämnesområden

Teoretisk datalogi

Chalmers infrastruktur