Related papers: Indexed Induction and Coinduction, Fibrationally
We introduce a string diagram calculus for strict $4$-categories and use it to prove that given a cofinite inclusion of $4$-categorical presentations, the induced restriction functor on mapping spaces to a fixed target strict $4$-category…
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 are obtained as a particular case. We…
For general finite-dimensional self-injective algebra $A$ we construct a family of injective coassociative coproducts $A\to A\otimes A$, all $A$-bimodule morphisms. In particular such structures always exist, confirming a conjecture of…
This paper proves that the functor $C(*)$ that sends pointed, simply-connected CW-complexes to their chain-complexes equipped with diagonals and iterated higher diagonals, determines their integral homotopy type --- even inducing an…
For any algebra morphism in a monoidal category, we provide sufficient conditions (which are also necessary if the unit is a left tensor generator) for the attached induction functor being semiseparable. Under mild assumptions, we prove…
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…
We recall the notions of a graded cocategory, conilpotent cocategory, morphisms of such (cofunctors), coderivations and define their analogs in $\mathbb L$-filtered setting. The difference with the existing approaches: we do not impose any…
We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…
Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy…
Recursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations,…
The aim of the paper is to provide solid foundations for a programming paradigm natively supporting the creation and manipulation of cyclic data structures. To this end, we describe coFJ, a Java-like calculus where objects can be infinite…
Higher Homotopy van Kampen Theorems allow the computation as colimits of certain homotopical invariants of glued spaces. One corollary is to describe homotopical excision in critical dimensions in terms of induced modules and crossed…
The intuitionistic fragment of the call-by-name version of Curien and Herbelin's \lambda\_mu\_{\~mu}-calculus is isolated and proved strongly normalising by means of an embedding into the simply-typed lambda-calculus. Our embedding is a…
Acoustics-to-word models are end-to-end speech recognizers that use words as targets without relying on pronunciation dictionaries or graphemes. These models are notoriously difficult to train due to the lack of linguistic knowledge. It is…
We investigate inductive types in type theory, using the insights provided by homotopy type theory and univalent foundations of mathematics. We do so by introducing the new notion of a homotopy-initial algebra. This notion is defined by a…
We introduce a method to lift monads on the base category of a fibration to its total category. This method, which we call codensity lifting, is applicable to various fibrations which were not supported by its precursor, categorical…
We introduce the notion of an enriched fibration, i.e. a fibration whose total category and base category are enriched in those of a monoidal fibration in an appropriate way. Furthermore, we provide a way to obtain such a structure,…
In this dissertation we examine enrichment relations between categories of dual structure and we sketch an abstract framework where the theory of fibrations and enriched category theory are appropriately united. We initially work in the…
Reachability Logic is a formalism that can be used, among others, for expressing partial-correctness properties of transition systems. In this paper we present three proof systems for this formalism, all of which are sound and complete and…
Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are…