CaTT contexts are finite computads
From MaRDI portal
Cites work
- A cellular nerve for higher categories
- A syntactical approach to weak omega-groupoids
- A Type-Theoretical Definition of Weak {\omega}-Categories
- Computads for weak -categories as an inductive type
- Formalisation of dependent type theory: The example of CaTT
- Higher-dimensional word problems with applications to equational logic
- Homomorphisms of higher categories
- Homotopy type theory. Univalent foundations of mathematics
- scientific article; zbMATH DE number 2125667 (Why is no real title available?)
- scientific article; zbMATH DE number 2134022 (Why is no real title available?)
- scientific article; zbMATH DE number 1303765 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- Internal type theory
- Iterated algebraic injectivity and the faithfulness conjecture
- Limits indexed by category-valued 2-functors
- Monoidal globular categories as a natural environment for the theory of weak \(n\)-categories
- On the homotopy hypothesis for 3-groupoids
- Polygraphic resolutions and homology of monoids
- The petit topos of globular sets
- Towards 3-dimensional rewriting theory
- Types are weak -groupoids
- Weak ω-Categories from Intensional Type Theory
This page was built for publication: CaTT contexts are finite computads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6831454)