Homotopical inverse diagrams in categories with attributes

  title={Homotopical inverse diagrams in categories with attributes},
  author={Chris Kapulkin and Peter LeFanu Lumsdaine},
  journal={arXiv: Logic},
We define and develop the infrastructure of homotopical inverse diagrams in categories with attributes (CwA's). Specifically, given a category with attributes C and an ordered homotopical inverse category I, we construct the category with attributes C^I of homotopical diagrams of shape I in C and Reedy types over these, and we show how various logical structure (Pi-types, identity types, and so on) lifts from the original CwA to the diagram CwA. This may be seen as providing a general class… 
6 Citations
The homotopy theory of type theories
We construct a left semi-model structure on the category of intensional type theories (precisely, on $\mathbf{CxlCat}_{Id,1,\Sigma(,\Pi_{ext})}$). This presents an infinity-category of such type
Coherence of strict equalities in dependent type theories
The definition of higher congruence is inspired by Brunerie's type-theoretic definition of weak $\infty$-groupoid, and reduces the problem of the conservativity of equational extensions to more tractable acyclicity conditions.
Strictification of weakly stable type-theoretic structures using generic contexts
This work presents a new strictification method for type-theoretic structures that are only weakly stable under substitution and shows that generic contexts can also be constructed in any category with families which is freely generated by collections of types and terms, without any definitional equality.
The next 700 relational program logics
The first framework for defining relational program logics for arbitrary monadic effects is proposed, and it is shown that this generic framework can be used to define relational programLogics for effects as diverse as state, input-output, nondeterminism, and discrete probabilities.
Principles of Program Verification for Arbitrary Monadic Effects. (Principes de la Vérification de Programmes à Effets Monadiques Arbitraires)
The goal of this thesis is to devise a principled semantic framework for verifying programs with arbitrary monadic effects in a generic way with respect to rich specifications, for properties such as program equivalence.
The Marriage of Univalence and Parametricity
This work first clarifies the limitations of these two concepts when considered in isolation and then devises a fruitful marriage between both, which is an extension of parametricity strengthened with univalence that fully realizes programming and proving modulo equivalences.


Univalence for inverse diagrams and homotopy canonicity
  • Michael Shulman
  • Computer Science, Mathematics
    Mathematical Structures in Computer Science
  • 2014
A homotopical version of the relational and gluing models of type theory that uses the Reedy homotopy theory on inverse diagrams, and relies on the fact that Reedy fibrant diagrams correspond to contexts of a certain shape in type theory.
Space-Valued Diagrams, Type-Theoretically (Extended Abstract)
It is shown how to define homotopy coherent diagrams which come with all higher coherence laws explicitly, with two variants that come with assumption on the index category or on the type theory.
The homotopy theory of type theories
We construct a left semi-model structure on the category of intensional type theories (precisely, on $\mathbf{CxlCat}_{Id,1,\Sigma(,\Pi_{ext})}$). This presents an infinity-category of such type
Cofibrations in Homotopy Theory
We define Anderson-Brown-Cisinski (ABC) cofibration categories, and construct homotopy colimits of diagrams of objects in ABC cofibration categories. Homotopy colimits for Quillen model categories
Homotopy Limit Functors on Model Categories and Homotopical Categories
Model categories: An overview Model categories and their homotopy categories Quillen functors Homotopical cocompleteness and completeness of model categories Homotopical categories: Summary of part
The Local Universes Model
We present a new coherence theorem for comprehension categories, providing strict models of dependent type theory with all standard constructors, including dependent products, dependent sums,
Truncation levels in homotopy type theory
A generalised universal property of the propositional truncation is presented, using a construction of coherently constant functions, which is equivalent to the type of functions with the truncation of A as domain and B as codomain.
The simplicial model of Univalent Foundations (after Voevodsky)
In this largely expository paper, we construct and investigate a model of the Univalent Foundations of Mathematics in the category of simplicial sets. To this end, we first give a new technique for
Categories with families, FOLDS and logic enriched type theory
Categories with families (cwfs) is an established semantical structure for dependent type theories, such as Martin-Lo type theory. Makkai's first-order logic with dependent sorts (FOLDS) is an
The identity type weak factorisation system
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