Projekter pr. år
Abstract
Clocked Type Theory (CloTT) is a type theory for guarded recursion useful for programming with coinductive types, allowing productivity to be encoded in types, and for reasoning about advanced programming language features using an abstract form of step-indexing. CloTT has previously been shown to enjoy a number of syntactic properties including strong normalisation, canonicity and decidability of type checking. In this paper we present a denotational semantics
for CloTT useful, e.g., for studying future extensions of CloTT with constructions such as path types.
The main challenge for constructing this model is to model the notion of ticks used in CloTT for coinductive reasoning about coinductive types. We build on a category previously used to model guarded recursion, but in this category there is no object of ticks, so tick-assumptions in a context can not be modelled using standard tools. Instead we show how ticks can be modelled using adjoint functors, and how to model the tick constant using a semantic substitution.
for CloTT useful, e.g., for studying future extensions of CloTT with constructions such as path types.
The main challenge for constructing this model is to model the notion of ticks used in CloTT for coinductive reasoning about coinductive types. We build on a category previously used to model guarded recursion, but in this category there is no object of ticks, so tick-assumptions in a context can not be modelled using standard tools. Instead we show how ticks can be modelled using adjoint functors, and how to model the tick constant using a semantic substitution.
Originalsprog | Engelsk |
---|---|
Titel | 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018) |
Antal sider | 17 |
Vol/bind | 108 |
Forlag | Schloss Dagstuhl--Leibniz-Zentrum für Informatik |
Publikationsdato | 2018 |
Artikelnummer | 23 |
ISBN (Trykt) | 978-3-95977-077-4 |
DOI | |
Status | Udgivet - 2018 |
Begivenhed | International Conference on Formal Structures for Computation and Deduction - Oxford, Storbritannien Varighed: 9 jul. 2018 → 12 jul. 2018 Konferencens nummer: 3 http://www.cs.le.ac.uk/events/fscd2018/ |
Konference
Konference | International Conference on Formal Structures for Computation and Deduction |
---|---|
Nummer | 3 |
Land/Område | Storbritannien |
By | Oxford |
Periode | 09/07/2018 → 12/07/2018 |
Internetadresse |
Navn | Leibniz International Proceedings in Informatics (LIPIcs) |
---|---|
Vol/bind | 108 |
ISSN | 1868-8969 |
Emneord
- Clocked Type Theory
- Guarded Recursion
- Coinductive Types
- Denotational Semantics
- Step-Indexing
Fingeraftryk
Dyk ned i forskningsemnerne om 'The Clocks They Are Adjunctions: Denotational Semantics for Clocked Type Theory'. Sammen danner de et unikt fingeraftryk.Projekter
- 2 Afsluttet
-
Guarded recursive types in the foundations of programming
Møgelberg, R. E. (PI), Mannaa, B. (CoI) & Bahr, P. (CoI)
01/07/2015 → 31/01/2019
Projekter: Projekt › Forskning
-
Type theories for reactive programming
Møgelberg, R. E. (PI), Vezzosi, A. (CoI), Graulund, C. U. (CoI), Kristensen, M. B. (CoI) & Veltri, N. (CoI)
22/01/2016 → 21/01/2022
Projekter: Projekt › Forskning