ITU

The Clocks They Are Adjunctions: Denotational Semantics for Clocked Type Theory

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

View graph of relations

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.
Original languageEnglish
Title of host publication3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)
Number of pages17
Volume108
PublisherSchloss Dagstuhl--Leibniz-Zentrum für Informatik
Publication date2018
Article number23
ISBN (Print)978-3-95977-077-4
DOIs
Publication statusPublished - 2018
EventInternational Conference on Formal Structures for Computation and Deduction - Oxford, United Kingdom
Duration: 9 Jul 201812 Jul 2018
Conference number: 3
http://www.cs.le.ac.uk/events/fscd2018/

Conference

ConferenceInternational Conference on Formal Structures for Computation and Deduction
Nummer3
LandUnited Kingdom
ByOxford
Periode09/07/201812/07/2018
Internetadresse
SeriesLeibniz International Proceedings in Informatics (LIPIcs)
Volume108
ISSN1868-8969

ID: 83273856