Related papers: Cellular Monads from Positive GSOS Specifications
The notion of a formally smooth bimodule is introduced and its basic properties are analyzed. In particular it is proven that a $B$-$A$ bimodule $M$ which is a generator left $B$-module is formally smooth if and only if the $M$-Hochschild…
Structural operational semantics (SOS) is a technique for defining operational semantics for programming and specification languages. Because of its intuitive appeal and flexibility, SOS has found considerable application in the study of…
The category $_{A}\mathbb{S}_{A}$ of bisemimodules over a semialgebra $A,$ with the so called Takahashi's tensor product $-\boxtimes_{A}-,$ is semimonoidal but not monoidal. Although not a unit in $_{A}\mathbb{S}%_{A},$ the base semialgebra…
We give $\operatorname{CMSO}$-transductions that, given a graph $G$, output its modular decomposition, its split decomposition and its bi-join decomposition. This improves results by Courcelle [Logical Methods in Computer Science, 2006] who…
Small-step and big-step operational semantics are two fundamental styles of structural operational semantics (SOS), extensively used in practice. The former one is more fine-grained and is usually regarded as primitive, as it only defines a…
In earlier work, Batanin has shown that an important class of definitions of higher categories could be apprehended together simply as monads over globular sets. This allowed him to generalize the notion of polygraph, initially introduced…
We introduce a general construction on 2-monads. We develop background on maps of 2-monads, their left semi-algebras, and colimits in 2-category. Then, we introduce the construction of a colimit induced by a map of 2-monads, show that we…
Motivated by viewing categories as bimodule monoids over their isomorphism groupoids, we construct monoidal structures called plethysm products on three levels: that is for bimodules, relative bimodules and factorizable bimodules. For the…
Terminal coalgebras for a functor serve as semantic domains for state-based systems of various types. For example, behaviors of CCS processes, streams, infinite trees, formal languages and non-well-founded sets form terminal coalgebras. We…
We consider a bag (multiset) monad on the category of standard Borel spaces, and show that it gives a free measurable commutative monoid. Firstly, we show that a recent measurability result for probabilistic database queries (Grohe and…
This thesis details a project to define a fully compositional theory of synchronous sequential circuits built from primitive components, motivated by applying techniques successfully used in programming languages to hardware. The first part…
Let G be a split semisimple algebraic group with trivial center. Let S be a compact oriented surface, with or without boundary. We define {\it positive} representations of the fundamental group of S to G(R), construct explicitly all…
After a review of the concept of "monad with arities" we show that the category of algebras for such a monad has a canonical dense generator. This is used to extend the correspondence between finitary monads on sets and Lawvere's algebraic…
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof techniques for checking properties of different kinds of systems. We prove the soundness of such techniques in a fibrational setting,…
In this thesis, we generalize the Koszul duality for associative algebras and operads to PROPs. The operads are algebraic objects that represent the operations with multiple inputs but only one output acting on a certain type of algebras. A…
Our main purpose is to describe the category of isotropic cellular spectra over flexible fields. Guided by [6], we show that it is equivalent, as a stable $\infty$-category equipped with a $t$-structure, to the derived category of left…
Monads can be interpreted as encoding formal expressions, or formal operations in the sense of universal algebra. We give a construction which formalizes the idea of "evaluating an expression partially": for example, "2+3" can be obtained…
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comonads. We explore the viability and value of similar modeling…
Fong developed `decorated cospans' to model various kinds of open systems: that is, systems with inputs and outputs. In this framework, open systems are seen as the morphisms of a category and can be composed as such, allowing larger open…
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequence. Due to transparency, the correspondence between…