Modal dependent type theory and dependent right adjoints
| dc.contributor.author | Birkedal, Lars | |
| dc.contributor.author | Clouston, Ranald | |
| dc.contributor.author | Mannaa, Bassel | |
| dc.contributor.author | M�gelberg, Rasmus Ejlers | |
| dc.contributor.author | Pitts, Andrew M. | |
| dc.contributor.author | Spitters, Bas | |
| dc.date.accessioned | 2023-12-11T23:11:07Z | |
| dc.date.issued | 2020 | |
| dc.date.updated | 2022-09-04T08:17:53Z | |
| dc.description.abstract | In recent years, we have seen several new models of dependent type theory extended with some form of modal necessity operator, including nominal type theory, guarded and clocked type theory and spatial and cohesive type theory. In this paper, we study modal dependent type theory: dependent type theory with an operator satisfying (a dependent version of) the K axiom of modal logic. We investigate both semantics and syntax. For the semantics, we introduce categories with families with a dependent right adjoint (CwDRA) and show that the examples above can be presented as such. Indeed, we show that any category with finite limits and an adjunction of endofunctors give rise to a CwDRA via the local universe construction. For the syntax, we introduce a dependently typed extension of Fitch-style modal λ-calculus, show that it can be interpreted in any CwDRA, and build a term model. We extend the syntax and semantics with universes. | en_AU |
| dc.description.sponsorship | This work was supported in part by the following research grants: Guarded Homotopy. Type Theory (grantnumber12386) from VILLUM FONDEN; Type theories for reactive programming (grantnumber13156) from VILLUM FONDEN; Guarded recursive types in the foundations of programming from the Danish Council for Independent Research(FNU) ;and Air Force Office of Scientific Research project “Homotopy Type Theory and Probabilistic Computation”(grant number 12595060) | en_AU |
| dc.format.mimetype | application/pdf | en_AU |
| dc.identifier.issn | 0960-1295 | en_AU |
| dc.identifier.uri | http://hdl.handle.net/1885/309788 | |
| dc.language.iso | en_AU | en_AU |
| dc.publisher | Cambridge University Press | en_AU |
| dc.rights | © 2019 The authors | en_AU |
| dc.source | Mathematical Structures in Computer Science | en_AU |
| dc.subject | Dependent type theory | en_AU |
| dc.subject | modal logic | en_AU |
| dc.subject | category theory | en_AU |
| dc.title | Modal dependent type theory and dependent right adjoints | en_AU |
| dc.type | Journal article | en_AU |
| local.bibliographicCitation.issue | 2 | en_AU |
| local.bibliographicCitation.lastpage | 138 | en_AU |
| local.bibliographicCitation.startpage | 118 | en_AU |
| local.contributor.affiliation | Birkedal, Lars, Aarhus University | en_AU |
| local.contributor.affiliation | Clouston, Ranald, College of Engineering and Computer Science, ANU | en_AU |
| local.contributor.affiliation | Mannaa, Bassel, eToroX Labs | en_AU |
| local.contributor.affiliation | Møgelberg, Rasmus Ejlers, IT University of Copenhagen | en_AU |
| local.contributor.affiliation | Pitts, Andrew M., University of Cambridge | en_AU |
| local.contributor.affiliation | Spitters, Bas, Aarhus University | en_AU |
| local.contributor.authoruid | Clouston, Ranald, u4982397 | en_AU |
| local.description.embargo | 2099-12-31 | |
| local.description.notes | Imported from ARIES | en_AU |
| local.identifier.absfor | 461300 - Theory of computation | en_AU |
| local.identifier.ariespublication | u6269649xPUB186 | en_AU |
| local.identifier.citationvolume | 30 | en_AU |
| local.identifier.doi | 10.1017/S0960129519000197 | en_AU |
| local.identifier.scopusID | 2-s2.0-85076567664 | |
| local.identifier.thomsonID | WOS:000524922200001 | |
| local.publisher.url | https://www.cambridge.org/ | en_AU |
| local.type.status | Published Version | en_AU |
Downloads
Original bundle
1 - 1 of 1
Loading...
- Name:
- TMP892920329202312129588.pdf
- Size:
- 387.38 KB
- Format:
- Adobe Portable Document Format
- Description: