From Semantics to Syntax: A Type Theory for Comprehension Categories

Read full text
Authors: Niyousha Najmaei, Niels van der Weide, Benedikt Ahrens, Paige Randall North
Cited by: 0
References: 40

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.

Fields of Study & Subjects

Logic programming and type systems Homotopy and Cohomology in Algebraic Topology Constraint Satisfaction and Optimization

Publication details

Journal / source
Proceedings of the ACM on Programming Languages
Volume
10
Issue
POPL
Pages
2409–2438
Publication date
8 January 2026
Language
EN