Arrow Research search
Back to TCS

TCS 2008

The identity type weak factorisation system

Journal Article journal-article Computer Science ยท Theoretical Computer Science

Abstract

We show that the classifying category C ( T ) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the right class of the weak factorisation system. This characterisation is applied to relate identity types and the homotopy theory of groupoids.

Authors

Keywords

  • Dependent type theory
  • Identity type
  • Weak factorisation system

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
274888781590870153
v2026.09.13