posted on 2009-01-21, 14:35authored byNicola Gambino, Richard Garner
We show that the classifying category of a dependent type theory 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.
History
Citation
Theoretical Computer Science, 2008, 409 (1), pp. 94-109.