From Semantics to Syntax: A Type Theory for Comprehension Categories

Publication date

2026-01-08

Authors

Najmaei, Niyousha
Van der Weide, Niels
Ahrens, Benedikt
North, Paige RandallISNI 0000000463490430

Editors

Advisors

Supervisors

Document Type

Article
Open Access logo

License

cc_by

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.

Keywords

categorical semantics, comprehension categories, subtyping, type theory, Software, Safety, Risk, Reliability and Quality

Citation

Najmaei, N, Van der Weide, N, Ahrens, B & North, P R 2026, 'From Semantics to Syntax : A Type Theory for Comprehension Categories', Proceedings of the ACM on Programming Languages, vol. 10, pp. 2409-2438. https://doi.org/10.1145/3776725