Related papers: Non-wellfounded trees in Homotopy Type Theory
We confirm the quasi-projective case of Saito's conjecture, namely that the cohomological characteristic classes defined by Abbes and Saito can be computed in terms of the characteristic cycles. We construct a cohomological characteristic…
Over a monoidal model category, under some mild assumptions, we equip the categories of colored PROPs and their algebras with projective model category structures. A Boardman-Vogt style homotopy invariance result about algebras over…
Quotient inductive-inductive types (QIITs) are generalized inductive types which allow sorts to be indexed over previously declared sorts, and allow usage of equality constructors. QIITs are especially useful for algebraic descriptions of…
Coinduction occurs in two guises in Horn clause logic: in proofs of self-referencing properties and relations, and in proofs involving construction of (possibly irregular) infinite data. Both instances of coinductive reasoning appeared in…
The homotopical approach to intensional type theory views proofs of equality as paths. We explore what is required of an object $I$ in a topos to give such a path-based model of type theory in which paths are just functions with domain $I$.…
Resolution lies at the foundation of both logic programming and type class context reduction in functional languages. Terminating derivations by resolution have well-defined inductive meaning, whereas some non-terminating derivations can be…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
The ability to cast values between related types is a leitmotiv of many flavors of dependent type theory, such as observational type theories, subtyping, or cast calculi for gradual typing. These casts all exhibit a common structural…
We construct a univalent universe in the sense of Voevodsky in some suitable model categories for homotopy types (obtained from Grothendieck's theory of test categories). In practice, this means for instance that, appart from the homotopy…
We show that the free construction from multicategories to permutative categories is a categorically-enriched non-symmetric multifunctor. Our main result then shows that the induced functor between categories of algebras is an equivalence…
The purpose of this paper is to explain why the functor that sends a stratified topological space $S$ to the $\infty$-category of constructible (hyper)sheaves on $S$ with coefficients in a large class of presentable $\infty$categories is…
Coinduction occurs in two guises in Horn clause logic: in proofs of circular properties and relations, and in proofs involving construction of infinite data. Both instances of coinductive reasoning appeared in the literature before, but a…
This paper extends the fibrational approach to induction and coinduction pioneered by Hermida and Jacobs, and developed by the current authors, in two key directions. First, we present a dual to the sound induction rule for inductive types…
The importance of subtyping to enable a wider range of well-typed programs is undeniable. However, the interaction between subtyping, recursion, and polymorphism is not completely understood yet. In this work, we explore subtyping in a…
We introduce dicodensity monads: a generalisation of pointwise codensity monads generated by functors to monads generated by mixed-variant bifunctors. Our construction is based on the notion of strong dinaturality (also known as Barr…
We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…
Graded Hecke algebras can be constructed in terms of equivariant cohomology and constructible sheaves on nilpotent cones. In earlier work, their standard modules and their irreducible modules where realized with such geometric methods. We…
We study the coinduction functor on the category of FI-modules and its variants. Using the coinduction functor, we give new and simpler proofs of (generalizations of) various results on homological properties of FI-modules. We also prove…
Higher inductive types (HITs) in Homotopy Type Theory (HoTT) allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types and allow to define types which are not sets in the…
We present a conservative extension ICaTT of the dependent type theory CaTT for weak $\omega$-categories with a type witnessing coinductive invertibility of cells. This extension allows for a concise description of the "walking equivalence"…