Related papers: A Functorial Perspective on (Multi)computational I…
We study monoidal profunctors as a tool to reason and structure pure functional programs both from a categorical perspective and as a Haskell implementation. From the categorical point of view we approach them as monoids in a certain…
The notion of the center of an algebra over a field k has a far reaching generalization to algebras in monoidal categories. The center then lives in the monoidal center of the original category. This generalization plays an important role…
We introduce homotopical methods based on rewriting on higher-dimensional categories to prove coherence results in categories with an algebraic structure. We express the coherence problem for (symmetric) monoidal categories as an…
We develop a functorial approach to the study of $n$-abelian categories by reformulating their axioms in terms of their categories of finitely presented functors. Such an approach allows the use of classical homological algebra and…
Modular functors are traditionally defined as systems of projective representations of mapping class groups of surfaces that are compatible with gluing. They can formally be described as modular algebras over central extensions of the…
Cobordism categories have played an important role in classical geometry and more recently in mathematical treatments of quantum field theory. Here we will compute localisations of two-dimensional discrete cobordism categories. This allows…
We introduce the homotopy surface category of a space which generalizes the 1+1-dimensional cobordism category of circles and surfaces to the situation where one introduces a background space. We explain how for a simply connected…
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 concept of process is ubiquitous in science, engineering and everyday life. Category theory, and monoidal categories in particular, provide an abstract framework for modelling processes of many kinds. In this paper, we concentrate on…
To characterize categorical constraints - associativity, commutativity and monoidality - in the context of quasimonoidal categories, from a cohomological point of view, we define the notion of a parity (quasi)complex. Applied to groups…
This work continues the development of an intensional approach to computability initiated in previous work, in which programs and computations, rather than functions, constitute the primary objects of study. In this setting, models of…
In categorical realizability, it is common to construct categories of assemblies and categories of modest sets from applicative structures. These categories have structures corresponding to the structures of applicative structures. In the…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…
The natural problem we approach in the present paper is to show how the notion of formally smooth (co)algebra inside monoidal categories can substitute that of (co)separable (co)algebra in the study of splitting bialgebra homomorphisms.…
In this paper, we revisit Moggi's celebrated calculus of computational effects from the perspective of logic of monoidal action (actegory). Our development takes the following steps. Firstly, we perform proof-theoretic reconstruction of…
We develop the theory of (op)fibrations of 2-multicategories and use it to define abstract six-functor-formalisms. We also give axioms for Wirthm\"uller and Grothendieck formalisms (where either $f^!=f^*$ or $f_!=f_*$) or intermediate…
Indexed symmetric monoidal categories are an important refinement of bicategories -- this structure underlies several familiar bicategories, including the homotopy bicategory of parametrized spectra, and its equivariant and fiberwise…
Functionals are an important research subject in Mathematics and Computer Science as well as a challenge in Information Technologies where the current programming paradigm states that only symbolic computations are possible on higher order…
We define a higher-order generalisation of the CPM construction based on arbitrary finite abelian group symmetries of symmetric monoidal categories. We show that our new construction is functorial, and that its closure under iteration can…
We develop and investigate a general theory of representations of second-order functionals, based on a notion of a right comodule for a monad on the category of containers. We show how the notion of comodule representability naturally…