Related papers: Coinductive Invertibility in Higher Categories
Higher inductive-inductive types (HIITs) generalize inductive types of dependent type theories in two ways. On the one hand they allow the simultaneous definition of multiple sorts that can be indexed over each other. On the other hand they…
We describe a construction that to each algebraically specified notion of higher-dimensional category associates a notion of homomorphism which preserves the categorical structure only up to weakly invertible higher cells. The construction…
We prove a coherence theorem for invertible objects in a symmetric monoidal category. This is used to deduce associativity, skew-commutativity, and related results for multi-graded morphism rings, generalizing the well-known versions for…
We formulate a framework for describing behaviour of effectful higher-order recursive programs. Examples of effects are implemented using effect operations, and include: execution cost, nondeterminism, global store and interaction with a…
Category theory in homotopy type theory is intricate as categorical laws can only be stated "up to homotopy", and thus require coherences. The established notion of a univalent category (Ahrens, Kapulkin, Shulman) solves this by considering…
Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…
The humble $\dagger$ ("dagger") is used to denote two different operations in category theory: Taking the adjoint of a morphism (in dagger categories) and finding the least fixed point of a functional (in categories enriched in domains).…
We describe a way to represent computable functions between coinductive types as particular transducers in type theory. This generalizes earlier work on functions between streams by P. Hancock to a much richer class of coinductive types.…
We explore an alternative definition of unit in a monoidal category originally due to Saavedra: a Saavedra unit is a cancellative idempotent (in a 1-categorical sense). This notion is more economical than the usual notion in terms of…
In recent years, significant progress has been made in the study of integrable systems from a gauge theoretic perspective. This development originated with the introduction of $4$d Chern-Simons theory with defects, which provided a…
We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…
We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…
The Schur orthogonality relations are a cornerstone in the representation theory of groups. We utilize a generalization to weak Hopf algebras to provide a new, readily verifiable condition on the skeletal data for deciding whether a given…
We combine the theory of inductive data types with the theory of universal measurings. By doing so, we find that many categories of algebras of endofunctors are actually enriched in the corresponding category of coalgebras of the same…
We give a new description of computads for weak globular $\omega$-categories by giving an explicit inductive definition of the free words. This yields a new understanding of computads, and allows a new definition of $\omega$-category that…
Two novel descriptions of weak {\omega}-categories have been recently proposed, using type-theoretic ideas. The first one is the dependent type theory CaTT whose models are {\omega}-categories. The second is a recursive description of a…
Higher inductive types are inductive types that include nontrivial higher-dimensional structure, represented as identifications that are not reflexivity. While work proceeds on type theories with a computational interpretation of univalence…
We describe an inductive machinery to prove various properties of representations of a category equipped with a generic shift functor. Specifically, we show that if a property (P) of representations of the category behaves well under the…
Guarded recursion is a powerful modal approach to recursion that can be seen as an abstract form of step-indexing. It is currently used extensively in separation logic to model programming languages with advanced features by solving domain…
Models of dependent type theories are contextual categories with some additional structure. We prove that if a theory $T$ has enough structure, then the category $T\text{-}\mathbf{Mod}$ of its models carries the structure of a model…