Related papers: Equivalence of Applicative Functors and Multifunct…
In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook…
We develop and extend the theory of Mackey functors as an application of enriched category theory. We define Mackey functors on a lextensive category $\E$ and investigate the properties of the category of Mackey functors on $\E$. We show…
We prove that any right Quillen functor between arbitrary model categories admits non trivial functorial factorizations that are similar to those of a model structure. We also prove that these factorizations can be made for lax monoidal…
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…
For a strongly connected category $\mathcal C$ with pair-wise coproducts, we introduce a cosimplicial object, which serves as a sort of resolution for computing higher derived functors of ${\sf lim} : \mathrm{Ab}^{\mathcal C}\to…
We study Appell functions associated to an arbitrary positive definite lattice $\Lambda$ and a choice of $M\leq {\rm dim}(\Lambda)$ linearly independent vectors $d_r\in \Lambda$, $r=1,\dots,M$. These functions are instances of…
We give sufficient conditions which ensure that a functor of finite length from an additive category to finite-dimensional vector spaces has a projective resolution whose terms are finitely generated. For polynomial functors, we study also…
The goal of this paper is to associate functorially to every symmetric monoidal additive category $\mathbf{A}$ with a strict $G$-action a lax symmetric monoidal functor $\mathbf{V}_{\mathbf{A}}^{G}:G\mathbf{BornCoarse}\to…
We apply the notion of relative adjoint functor to generalise closed monoidal categories. We define representations in such categories and give their relation with left actions of monoids. The translation of these representations under lax…
We uncover several general phenomenas governing functor homology over additive categories. In particular, we generalize the strong comparison theorem of Franjou Friedlander Scorichenko and Suslin to the setting of Fp-linear additive…
Bidirectional data accessors such as lenses, prisms and traversals are all instances of the same general 'optic' construction. We give a careful account of this construction and show that it extends to a functor from the category of…
In this paper we consider the conditions that need to be satisfied by two families of pseudofunctors with a common codomain for them to be collated into a bifunctor. We observe similarities between these conditions and distributive laws of…
In [arXiv:1509.02937], the notion of a module tensor category was introduced as a braided monoidal central functor $F\colon \mathcal{V}\longrightarrow \mathcal{T}$ from a braided monoidal category $\mathcal{V}$ to a monoidal category…
We consider three (2-)categories and their (anti-)equivalence. They are the category of small abelian categories and exact functors, the category of definable additive categories and interpretation functors, the category of locally coherent…
User defined recursive types are a fundamental feature of modern functional programming languages like Haskell, Clean, and the ML family of languages. Properties of programs defined by recursion on the structure of recursive types are…
Monadic programming presents a significant challenge for many programmers. In light of category theory, we offer a new perspective on the use of monads in functional programming. This perspective is clarified through numerous examples coded…
A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
This is the first part of a project aimed at formalizing Rozansky-Witten models in the functorial field theory framework. Motivated by work of Calaque-Haugseng-Scheimbauer, we construct a family of symmetric monoidal $(\infty,3)$-categories…
We want to replace categories, functors and natural transformations by categories, open functors and open natural transformations. In analogy with open dynamical systems, the adjective open is added here to mean that some external…