Related papers: Cellular Monads from Positive GSOS Specifications
This paper studies the existence of model category structures on algebras and modules over operads in monoidal model categories.
It is well known that Kleisli categories provide a natural language to model side effects. For instance, in the theory of coalgebras, behavioural equivalence coincides with language equivalence (instead of bisimilarity) when…
We define $A_{\infty}$-structures -- algebras, coalgebras, modules, and comodules -- in an arbitrary monoidal DG category or bicategory by rewriting their definitions in terms of unbounded twisted complexes. We develop new notions of strong…
Reasoning about program equivalence in imperative languages is notoriously challenging, as the presence of states (in the form of variable stores) fundamentally increases the observational power of program terms. The key desideratum for any…
We construct a monoidal category of open transition systems that generate material history as transitions unfold, which we call situated transition systems. The material history generated by a composite system is composed of the material…
We give a conceptual treatment of the notion of joints, marginals, and independence in the setting of categorical probability. This is achieved by endowing the usual probability monads (like the Giry monad) with a monoidal and an opmonoidal…
Starting from any operad P, one can consider on one hand the free operad on P, and on the other hand the Baez--Dolan construction on P. These two new operads have the same space of operations, but with very different notions of arity and…
Given a 2-category $\twocat{K}$ admitting a calculus of bimodules, and a 2-monad T on it compatible with such calculus, we construct a 2-category $\twocat{L}$ with a 2-monad S on it such that: (1)S has the adjoint-pseudo-algebra property.…
We present a new soundness proof of Concurrent Separation Logic (CSL) based on a structural operational semantics (SOS). We build on two previous proofs and develop new auxiliary notions to achieve the goal. One uses a denotational…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
Monads and their composition via distributive laws have many applications in program semantics and functional programming. For many interesting monads, distributive laws fail to exist, and this has motivated investigations into weaker…
In this paper, a monad-based denotational model is introduced and shown adequate for the Proto-Quipper family of calculi, themselves being idealized versions of the Quipper programming language. The use of a monadic approach allows us to…
This paper gives an explicit description of the categorical operad whose algebras are precisely symmetric monoidal categories. This allows us to place the operad in a sequence of four, and therefore a sequence of four successively stricter…
Specification theories as a tool in model-driven development processes of component-based software systems have recently attracted a considerable attention. Current specification theories are however qualitative in nature, and therefore…
We introduce the notion of the $\infty$-category of (complete) derived $G$-graded modules over a $G$-graded ring $R$ for a torsion-free abelian group $G$, and we study its foundational properties. Moreover, we prove a categorical…
In this paper we consider dimonoids, which are sets equipped with two associative binary operations. Dimonoids in the sense of J.-L. Loday are xamples of duplexes. The set of all permutations, gives an example of a duplex which is not a…
In this article we show how to build main aspects of our paper on globular weak $(\infty,n)$-categories, but now for the cubical geometry. Thus we define a monad on the category $\mathbb{C}\mathbb{S}ets$ of cubical sets which algebras are…
We develop a unified framework based on topological crossed modules for various lifting obstructions for $\Gamma$-kernels. It allows us to identify actions, cocycle actions and $\Gamma$-kernels up to their natural equivalence relations with…
We set up a parametrised monadic translation for a class of call-by-value functional languages, and prove a corresponding soundness theorem. We then present a series of concrete instantiations of our translation, demonstrating that a number…
We present several naturally occurring classes of spectral spaces using commutative algebra on pointed monoids. For this purpose, our main tools are finite type closure operations and continuous valuations on monoids which we introduce in…