The identity type weak factorisation system

45Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

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. © 2008 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Gambino, N., & Garner, R. (2008). The identity type weak factorisation system. Theoretical Computer Science, 409(1), 94–109. https://doi.org/10.1016/j.tcs.2008.08.030

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free