Canonicity for Indexed Inductive-Recursive Types
Journal article, 2026

We prove canonicity for a Martin-Löf type theory with a countable universe hierarchy where each universe supports indexed inductive-recursive (IIR) types. We proceed in two steps. First, we construct IIR types from inductive-recursive (IR) types and other basic type formers, in order to simplify the subsequent canonicity proof. The constructed IIR types support the same definitional computation rules that are available in Agda's native IIR implementation. Second, we give a canonicity proof for IR types, building on the established method of gluing along the global sections functor. The main idea is to encode the canonicity predicate for each IR type using a metatheoretic IIR type.

inductive-recursive types, canonicity

Author

Andras Kovacs

University of Gothenburg

Chalmers, Computer Science and Engineering (Chalmers), Computing Science

Proceedings of the ACM on Programming Languages

24751421 (eISSN)

Vol. 10 43

Subject Categories (SSIF 2025)

Formal Methods

Computer Sciences

DOI

10.1145/3776685

More information

Latest update

1/30/2026