Related papers: The Produoidal Algebra of Process Decomposition
Bimorphic lenses are a simplification of polymorphic lenses that (like polymorphic lenses) have a type defined by 4 parameters, but which are defined in a monomorphic type system (i.e. an ordinary category with finite products). We show…
We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…
The notion of associativity (which differs from the straightforward generalization of the usual associativity given by the move of parentheses in the relevant expression) for operations of high arity is introduced. It is proved that the…
A combinatorial construction is used to analyze the properties of polyhedral products and generalized moment-angle complexes with respect to certain operations on CW pairs including exponentiation. This allows for the construction of…
In this paper we introduce the notion of (pointed) prenormal category, modelled after regular categories, but with the key notions of coequaliser and kernel pair replaced by those of cokernel and kernel. This framework provides a natural…
We prove that the monoidal 2-category of cospans of finite linear orders and surjections is the universal monoidal category with an object X with a semigroup and a cosemigroup structures, where the two structures satisfy a certain…
In this paper we start from a basic notion of process, which we structure into two groupoids, one orthogonal and one symplectic. By introducing additional structure, we convert these groupoids into orthogonal and symplectic Clifford…
This monograph is a study of the category of polynomial endofunctors on the category of sets and its applications to modeling interaction protocols and dynamical systems. We assume basic categorical background and build the categorical…
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…
Multiplier bimonoids (or bialgebras) in arbitrary braided monoidal categories are defined. They are shown to possess monoidal categories of comodules and modules. These facts are explained by the structures carried by their induced…
This paper is a study of monoidal categories with duals where the tensor product need not be commutative. The motivating examples are categories of representations of Hopf algebras and the motivating application is the definition of…
We establish a correspondence between modules and spans of algebras within a general monoidal 2-category $\mathfrak{C}$. Specifically, for an algebra $A$ in $\mathfrak{C}$, we construct a normalized lax 3-functor from the 2-category of…
Logical relations and their generalizations are a fundamental tool in proving properties of lambda-calculi, e.g., yielding sound principles for observational equivalence. We propose a natural notion of logical relations able to deal with…
We extend the arithmetic product of species of structures and symmetric sequences studied by Maia and Mendez and by Dwyer and Hess to coloured symmetric sequences and show that it determines a normal oplax monoidal structure on the…
We discuss a class of linear representations of the product poset of totally ordered sets $P= T_1 \times \cdots \times T_n$ which decompose into interval representations for block intervals. These can be characterised in terms of a…
We have generalised the notion of categorical theory in model theory to the context of coherent theories. We prove a duality result between the full sub-2-category of pretopoi which are categorical, and the 2-category of profinite monoids.…
MSO transductions are binary relations between structures which are defined using monadic second-order logic. MSO transductions form a category, since they are closed under composition. We show that many notions from language theory, such…
We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…
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 purpose of this paper is to show that the dual notions of elements & distinctions are the basic analytical concepts needed to unpack and analyze morphisms, duality, and universal constructions in the Sets, the category of sets and…