Abstract
This entry develops the structural metatheory of a finitary, one-dimensional, nondependent calculus of higher inductive types directly in Isabelle/HOL. Its inductive syntax, raw typing relation, reduction relation, and signature environment uniformly describe ordinary inductive types and higher inductive types.
Signatures declare finite point and path constructors with checked endpoints. Path methods must respect both declared faces. A finite open-term boundary criterion checks each method once under canonical constructor arguments, and simultaneous substitution transports those obligations to every typed instance. Strong normalization and confluence yield a canonical normal-form comparison theorem: typed terms are joinable exactly when their unique normal forms agree. The selected canonical function uses Hilbert choice and is not an executable normalizer.
The development proves weakening, term and dimension substitution, subject reduction, progress, strong normalization, Church-Rosser confluence, unique normal forms, canonicity, and empty-signature consistency. It also formalizes the boundary-computation square and dimension-capture counterexample that motivate the calculus design.
License
Note
AI assistance was used for proof engineering.
Topics
- Computer science/Programming languages/Type systems
- Computer science/Semantics and reasoning
- Logic/Proof theory
Related publications
- Chen, J. (2021). Homotopy Type Theory in Isabelle. In L. Cohen & C. Kaliszyk (Eds.), LIPIcs, Volume 193, ITP 2021 (No. 12; Vol. 193, pp. 12:1–12:8). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITP.2021.12
- Kaposi, A., & Kovács, A. (2020). Signatures and Induction Principles for Higher Inductive-Inductive Types. Logical Methods in Computer Science, Volume 16, Issue 1. https://doi.org/10.23638/lmcs-16(1:10)2020
- Cavallo, E., & Harper, R. (2019). Higher inductive types in cubical computational type theory. Proceedings of the ACM on Programming Languages, 3(POPL), 1–27. https://doi.org/10.1145/3290314
- Veltri, N., & van der Weide, N. (2021). Constructing Higher Inductive Types as Groupoid Quotients. Logical Methods in Computer Science, Volume 17, Issue 2. https://doi.org/10.23638/lmcs-17(2:8)2021
Session HoTT_HIT_Metatheory
- HIT_Syntax
- HIT_Reduction
- HIT_Typing
- HIT_Signature
- HIT_Dimensions
- HIT_Coherence
- HIT_Substitution
- HIT_Preservation
- HIT_Canonicity
- HIT_Normalization
- HIT_Confluence
- HIT_Canonical_Normal_Forms
- HIT_Open_Boundary_Check
- HIT_Examples