Related papers: Functor is to Lens as Applicative is to Biplate: I…
This paper studies algebras arising as algebraic semantics for logics used to model reasoning with incomplete or inconsistent information. In particular we study, in a uniform way, varieties of bilattices equipped with additional…
If $\mathbf{C}$ is a category with pullbacks then there is a bicategory with the same objects as $\mathbf{C}$, spans as morphisms, and maps of spans as 2-morphisms, as shown by Benabou. Fong has developed a theory of "decorated" cospans,…
For every oriented surface of finite type, we construct a functorial Khovanov homology for links in a thickening of the surface, which takes values in a categorification of the corresponding gl(2) skein module. The latter is a mild…
This is a short introduction to categories with some emphasis on coalgebras. We start from introducing basic notions (categories, functors, natural transformations), move to Kleisli tripels and monads, with a short discussion of monads in…
The category of small covariant functors from simplicial sets to simplicial sets supports the projective model structure. In this paper we construct various localizations of the projective model structure and also give a variant for…
The goal of this paper is to prove coherence results with respect to relational graphs for monoidal monads and comonads, i.e. monads and comonads in a monoidal category such that the endofunctor of the monad or comonad is a monoidal functor…
Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…
For a cofibrantly generated Quillen model category, we show that the cofibrant replacement functor constructed using the small object argument admits a cotriple structure. If all acyclic cofibrations are monomorphisms, the fibrant…
Let $\mathcal{S}$ be a small category, and suppose that we are given a full subcategory $\mathcal{U}$ such that every object of $\mathcal{S}$ can be embedded into some object of $\mathcal{U}$ in the same way as every quasi-projective…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
We present a library for generic programming in OCaml, adapting some techniques borrowed from other functional languages. The library makes use of three recent additions to OCaml: generalised abstract datatypes are essential to reflect…
In this paper we introduce and study a variety of algebras that properly includes integral distributive commutative residuated lattices and weak Heyting algebras. Our main goal is to give a characterization of the principal congruences in…
We develop a general theory of (extended) inner autoequivalences of objects of any 2-category, generalizing the theory of isotropy groups to the 2-categorical setting. We show how dense subcategories let one compute isotropy in the presence…
Using crossed homomorphisms, we show that the category of weak representations (resp. admissible representations) of Lie-Rinehart algebras (resp. Leibniz pairs) is a left module category over the monoidal category of representations of Lie…
With a view on applications in computing, in particular concurrency theory and higher-dimensional rewriting, we develop notions of $n$-fold monoid and comonoid objects in $n$-fold monoidal categories and bicategories. We present a series of…
Datatype-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed over the years, most of them for Haskell, but…
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
Recently, a geometrical characterization of vector spaces served to generalize them into a new class of algebras. Instead of the algebraic properties of the underlying fields, we generalized the recently discovered property of such spaces…
Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…
We investigate the arithmetic-geometric structure of the lecture hall cone \[ L_n \ := \ \left\{\lambda\in \mathbb{R}^n: \, 0\leq \frac{\lambda_1}{1}\leq \frac{\lambda_2}{2}\leq \frac{\lambda_3}{3}\leq \cdots \leq…