Pith. sign in

REVIEW 2 cited by

Coherence of strict equalities in dependent type theories

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.14166 v1 pith:2KQCLPN6 submitted 2020-10-27 cs.LO math.CTmath.LO

classification cs.LOmath.CTmath.LO
keywords typetheorytheoriesconservativitycoherencecongruencedefinitiondependent
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the conservativity of Extensional Type Theory over Intensional Type Theory. We generalize these methods to type theories without the Uniqueness of Identity Proofs principle, such as variants of Homotopy Type Theory, by introducing a notion of higher congruence over models of type theory. Our definition of higher congruence is inspired by Brunerie's type-theoretic definition of weak $\infty$-groupoid. For a large class of type theories, we reduce the problem of the conservativity of equational extensions to more tractable acyclicity conditions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Extension Types for Free

    cs.LO 2026-07 accept novelty 8.0 of 10 full

    Extension types are definable in two-level type theory, all their Riehl–Shulman rules become theorems, and cubical gluing is equivalent to univalence in this framework.

  2. A 2-categorical approach to the semantics of dependent type theory with computation axioms

    math.LO 2025-07 conditional novelty 7.0 of 10

    A display map 2-category semantics for axiomatic type theory is shown sound, yielding a semantic proof that the identity type computation rule is not admissible.

Pith tools