The Clocks They Are Adjunctions: Denotational Semantics for Clocked Type Theory
- Bassel Mannaa,
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOpen access
Publication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-reviewOriginal language
EnglishArticle number
23Publication milestones
- Published - 2018
Publication status
Published - 2018
Volume
108Publisher
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbHBook series
- Book series name: Leibniz International Proceedings in Informatics (LIPIcs)
Volume: 108
ISSN: 1868-8969
ISBN (Print)
978-3-95977-077-4Publication IDs
- Scopus: 85049781787
Host publication title
3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)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.
Publication metrics
PlumX, opens in new tab
Captures
4
Citations
10
Access to documents
Final published version, 518.23 KB
License:CC BY, opens in new tab
Related Event
Title
International Conference on Formal Structures for Computation and Deduction
Event type
ConferenceDegree of recognition
International eventDate
09/07/2018 - 12/07/2018Location
OxfordUnited Kingdom
