Related papers: Cellular Monads from Positive GSOS Specifications
We exhibit sufficient conditions for a monoidal monad T on a monoidal category C to induce a monoidal structure on the Eilenberg--Moore category C^T that represents bimorphisms. The category of actions in C^T is then shown to be monadic…
Process theories provide a powerful framework for describing compositional structures across diverse fields, from quantum mechanics to computational linguistics. Traditionally, they have been formalized using symmetric monoidal categories…
Two novel descriptions of weak {\omega}-categories have been recently proposed, using type-theoretic ideas. The first one is the dependent type theory CaTT whose models are {\omega}-categories. The second is a recursive description of a…
In this paper we put forward the definition of particular subsets on a unital C*-algebra, that we call isocones, and which reduce in the commutative case to the set of continuous non-decreasing functions with real values for a partial order…
There are different categorical approaches to variations of transition systems and their bisimulations. One is coalgebra for a functor G, where a bisimulation is defined as a span of G-coalgebra homomorphism. Another one is in terms of path…
In this paper we examine a natural operator system structure on Pisier's self-dual operator space. We prove that this operator system is completely order isomorphic to its dual with the cb-condition number of this isomorphism as small as…
In the first part of the paper we recall the coalgebraic approach to handling the so-called invisible transitions that appear in different state-based systems semantics. We claim that these transitions are always part of the unit of a…
We present a unified framework for categorical systems theory which packages a collection of open systems, their interactions, and their maps into a symmetric monoidal loose right module of systems over a symmetric monoidal double category…
Graded monads refine traditional monads using effect annotations in order to describe quantitatively the computational effects that a program can generate. They have been successfully applied to a variety of formal systems for reasoning…
The category of (colored) props is an enhancement of the category of colored operads, and thus of the category of small categories. The titular category has nice formal properties: it is bicomplete and is a symmetric monoidal category, with…
We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…
This paper studies the homotopy theory of the Grothendieck construction using model categories and semi-model categories, provides a unifying framework for the homotopy theory of operads and their algebras and modules, and uses this…
In this note, we define an analogue of R-matrices for bialgebras in the setting of a monad that is opmonoidal over two tensor products. Analogous to the classical case, such structures bijectively correspond to duoidal structures on the…
We show that in a weak globular $\omega$-category, all composition operations are equivalent and commutative for cells with sufficiently degenerate boundary, which can be considered a higher-dimensional generalisation of the Eckmann-Hilton…
Formalising the pi-calculus is an illuminating test of the expressiveness of logical frameworks and mechanised metatheory systems, because of the presence of name binding, labelled transitions with name extrusion, bisimulation, and…
Soundness and completeness with respect to equational theories for programming languages are fundamental properties in the study of categorical semantics. However, completeness results have not been established for programming languages…
We investigate a canonical way of defining bisimilarity of systems when their semantics is given by a coreflection, typically in a category of transition systems. We use the fact, from Joyal et al., that coreflections preserve open…
Given a Hopf algebra in a symmetric monoidal category with duals, the category of modules inherits the structure of a monoidal category with duals. If the notion of algebra is replaced with that of monad on a monoidal category with duals…
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…
It is natural that we can extend Structural Operational Semantics (SOS) to SOS for true concurrency. From SOS to SOS for true concurrency, it is in nature to give the related concepts in SOS a truly concurrent semantics foundation, i.e., a…