Table of Contents
Fetching ...

Polynomial functors in π-clans for the semantics of type theory

Joseph Hua, Yiming Xu

TL;DR

This work develops a theory of polynomial functors in $\pi$-clans to provide a strict semantic framework for Martin-Löf type theory with unit, sigma, and pi types. It introduces two equivalent strict viewpoints—elementary semantics and algebraic semantics—and proves translations between them, enabling construction of MLTT models in weaker, non-LCC contexts. The central contribution is the algebraic presentation of type formers via polynomial functors in $\pi$-clans, together with a method to extract algebraic formers from a clan and to recover elementary models from algebraic ones. The results generalize polynomial-functor techniques beyond locally Cartesian closed categories and are formalized in the Lean-based HoTTLean project, with potential applications to groupoid models and broader semantic frameworks for 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.

Polynomial functors in π-clans for the semantics of type theory

TL;DR

This work develops a theory of polynomial functors in -clans to provide a strict semantic framework for Martin-Löf type theory with unit, sigma, and pi types. It introduces two equivalent strict viewpoints—elementary semantics and algebraic semantics—and proves translations between them, enabling construction of MLTT models in weaker, non-LCC contexts. The central contribution is the algebraic presentation of type formers via polynomial functors in -clans, together with a method to extract algebraic formers from a clan and to recover elementary models from algebraic ones. The results generalize polynomial-functor techniques beyond locally Cartesian closed categories and are formalized in the Lean-based HoTTLean project, with potential applications to groupoid models and broader semantic frameworks for 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.
Paper Structure (19 sections, 22 theorems, 33 equations)

This paper contains 19 sections, 22 theorems, 33 equations.

Key Result

Lemma 2.5

The construction $\mathsf{unit}_\Gamma$ is stable under substitution, meaning that for any $\sigma : \Delta \to \Gamma$ we have

Theorems & Definitions (67)

  • Definition 2.1: https://github.com/sinhp/HoTTLean/blob/TYPES2026/HoTTLean/Model/Unstructured/UnstructuredUniverse.lean#L19
  • Remark 2.2
  • Definition 2.3: https://github.com/sinhp/HoTTLean/blob/TYPES2026/HoTTLean/Model/Unstructured/UnstructuredUniverse.lean#L98
  • Definition 2.4: $\mathsf{Unit}$-types
  • Lemma 2.5
  • proof
  • Definition 2.6: $\Pi$-types, https://github.com/sinhp/HoTTLean/blob/TYPES2026/HoTTLean/Model/Unstructured/UnstructuredUniverse.lean#L332
  • Lemma 2.7: https://github.com/sinhp/HoTTLean/blob/TYPES2026/HoTTLean/Model/Unstructured/UnstructuredUniverse.lean#L360
  • proof
  • Lemma 2.8
  • ...and 57 more