Polynomial functors in π-clans for the semantics of type theory
Abstract
The category of contexts underlying a model of Martin-Löf type theory with Unit-, $Σ$-, and $Π$-types need not be locally Cartesian closed, but is necessarily a $π$-clan. We exploit this $π$-clan structure to build the theory of polynomial functors. This paper presents two equivalent notions of strict semantics for MLTT in this weaker setting, respectively "elementary models" - reformulating categories with families - and "algebraic models" - reformulating natural models. These components fit into a practical sequence of steps for constructing models of MLTT: building an elementary model, extracting a $π$-clan from the elementary model, and then using polynomial functors built on the $π$-clan structure to convert the elementary model into an algebraic one.
Fields of Study & Subjects
Logic
programming
and type systems
Advanced Algebra and Logic
Homotopy and Cohomology in Algebraic Topology
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 5 February 2026
- Document type
- Preprint