Abstract
Recent models of intensional type theory have been constructed in algebraic weak factorization systems (AWFSs). AWFSs give rise to comprehension categories that feature non-trivial morphisms between types; these morphisms are not used in the standard interpretation of Martin-Löf type theory in comprehension categories. We develop a type theory that internalizes morphisms between types, reflecting this semantic feature back into syntax. Our type theory comes with Π-, Σ-, and identity types. We discuss how it can be viewed as an extension of Martin-Löf type theory with coercive subtyping, as sketched by Coraglia and Emmenegger. We furthermore define semantic structure that interprets our type theory and prove a soundness result. Finally, we exhibit many examples of the semantic structure, yielding a plethora of interpretations.
| Original language | English |
|---|---|
| Pages (from-to) | 2409-2438 |
| Number of pages | 30 |
| Journal | Proceedings of the ACM on Programming Languages |
| Volume | 10 |
| DOIs | |
| Publication status | Published - 2026 |
Keywords
- categorical semantics
- comprehension categories
- subtyping
- type theory
Fingerprint
Dive into the research topics of 'From Semantics to Syntax: A Type Theory for Comprehension Categories'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver