Related papers: The Produoidal Algebra of Process Decomposition
We decribe the correspondence between normalised $\omega$-operads and certain lax monoidal structures on the category of globular sets. As with ordinary monoidal categories, one has a notion of category enriched in a lax monoidal category.…
We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagrams annotated by objects and morphisms from the original…
Emerging computational paradigms, such as probabilistic and hybrid programming, introduce new primitive operations that often need to be combined with classic programming constructs. However, it still remains a challenge to provide a…
This paper studies algebras arising as algebraic semantics for logics used to model reasoning with incomplete or inconsistent information. In particular we study, in a uniform way, varieties of bilattices equipped with additional…
We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…
We endow categories of non-symmetric operads with natural model structures. We work with no restriction on our operads and only assume the usual hypotheses for model categories with a symmetric monoidal structure. We also study categories…
We define bicategories internal to 2-categories. When the ambient 2-category is symmetric monoidal categories, this provides a convenient framework for encoding the structures of a symmetric monoidal 3-category. This framework is well…
We prove coherence theorems for dualizable objects in monoidal bicategories and for fully dualizable objects in symmetric monoidal bicategories, describing coherent dual pairs and coherent fully dual pairs. These are property-like…
Due to the increased complexity of software development projects more and more systems are described by models. The sheer size makes it impractical to describe these systems by a single model. Instead many models are developed that provide…
We survey some basic mathematical structures, which arguably are more primitive than the structures taught at school. These structures are orders, with or without composition, and (symmetric) monoidal categories. We list several `real life'…
A model of a discrete pregeometry on a microscopic scale is introduced. This model is a finite network of finite elementary processes. The mathematical description is a d-graph that is a generalization of a graph. This is the particular…
In this note we provide a characterization, in terms of additional algebraic structure, of those intervals (certain cocategory objects) in a symmetric monoidal closed category E that are representable in the sense of inducing on E the…
We present a unifying framework for type systems for process calculi. The core of the system provides an accurate correspondence between essentially functional processes and linear logic proofs; fragments of this system correspond to…
Families of objects appear in several contexts, like algebraic topology, theory of deformations, theoretical physics, etc. An unified coordinate-free algebraic framework for families of geometrical quantities is presented here, which allows…
A PROB is a "product and braid" category. Such categories can be used to encode the structure borne by an object in a braided monoidal category. In this paper we provide PROBs whose categories of algebras in a braided monoidal category are…
Conditional independence has been widely used in AI, causal inference, machine learning, and statistics. We introduce categoroids, an algebraic structure for characterizing universal properties of conditional independence. Categoroids are…
This survey provides an elementary introduction to operads and to their applications in homotopical algebra. The aim is to explain how the notion of an operad was prompted by the necessity to have an algebraic object which encodes higher…
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with which all existence theorems have an explicit algorithmic…
We introduce the concept of a dendroidal set. This is a generalization of the notion of a simplicial set, specially suited to the study of operads in the context of homotopy theory. We define a category of trees, which extends the category…
Every small monoidal category with universal finite joins of central idempotents is monoidally equivalent to the category of global sections of a sheaf of local monoidal categories on a topological space. Every small stiff monoidal category…