From Semantics to Syntax: A Type Theory for Comprehension Categories

March 13, 2025 Β· Declared Dead Β· πŸ› Proc. ACM Program. Lang.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Niyousha Najmaei, Niels van der Weide, Benedikt Ahrens, Paige Randall North arXiv ID 2503.10868 Category cs.PL: Programming Languages Cross-listed cs.LO, math.CT Citations 2 Venue Proc. ACM Program. Lang. Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted