English
Related papers

Related papers: Binding bigraphs as symmetric monoidal closed theo…

200 papers

This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects. In our setting, one first specifies an SMC theory T, which may…

Logic in Computer Science · Computer Science 2009-05-27 Richard Garner , Tom Hirschowitz , Aurélien Pardon

We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…

Combinatorics · Mathematics 2021-08-12 Eric Marberg

The bigraph theory is a relatively young, yet formally rigorous, mathematical framework encompassing Robin Milner's previous work on process calculi, on the one hand, and provides a generic meta-model for complex systems such as multi-agent…

Discrete Mathematics · Computer Science 2020-02-19 Dominik Grzelak , Barbara Priwitzer , Uwe Aßmann

A compact closed bicategory is a symmetric monoidal bicategory where every object is equipped with a weak dual. The unit and counit satisfy the usual "zig-zag" identities of a compact closed category only up to natural isomorphism, and the…

Category Theory · Mathematics 2016-08-22 Michael Stay

String diagrams are a powerful and intuitive graphical syntax for terms of symmetric monoidal categories (SMCs). They find many applications in computer science and are becoming increasingly relevant in other fields such as physics and…

Category Theory · Mathematics 2016-12-01 Filippo Bonchi , Fabio Gadducci , Aleks Kissinger , Pawel Sobocinski , Fabio Zanasi

String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to…

Category Theory · Mathematics 2010-11-19 Lucas Dixon , Aleks Kissinger

Equality saturation, a technique for program optimisation and reasoning, has gained attention due to the resurgence of equality graphs (e-graphs). E-graphs represent equivalence classes of terms under rewrite rules, enabling simultaneous…

Logic in Computer Science · Computer Science 2025-05-05 Aleksei Tiurin , Dan R. Ghica , Nick Hu

Recently, there has been growing interest in bicategorical models of programming languages, which are "proof-relevant" in the sense that they keep distinct account of execution traces leading to the same observable outcomes, while assigning…

Logic in Computer Science · Computer Science 2023-01-30 Pierre Clairambault , Simon Forest

Bigraphs are a universal computational modelling formalism for the spatial and temporal evolution of a system in which entities can be added and removed. We extend bigraphs to probablistic bigraphs, and then again to action bigraphs, which…

Logic in Computer Science · Computer Science 2022-06-28 Blair Archibald , Muffy Calder , Michele Sevegnani

We present a method of constructing monoidal, braided monoidal, and symmetric monoidal bicategories from corresponding types of monoidal double categories that satisfy a lifting condition. Many important monoidal bicategories arise…

Category Theory · Mathematics 2019-11-26 Linde Wester Hansen , Michael Shulman

Indexed symmetric monoidal categories are an important refinement of bicategories -- this structure underlies several familiar bicategories, including the homotopy bicategory of parametrized spectra, and its equivariant and fiberwise…

Category Theory · Mathematics 2023-06-21 Cary Malkiewich , Kate Ponto

We show that braided, sylleptic and symmetric monoidal bicategories are precisely the $\mathsf{E}_k$-monoids in the cartesian monoidal $(\infty,1)$-category of bicategories for respective integers $k$. To manage the underlying computations,…

Category Theory · Mathematics 2026-02-17 Raffael Stenzel

We develop a theory of rewriting for structured cospans in order to extend compositional methods for modeling open networks. First, we introduce a category whose objects are structured cospans, and establish conditions under which it is…

Category Theory · Mathematics 2026-04-06 Daniel Cicala

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…

Category Theory · Mathematics 2019-08-27 Jules Hedges

We give an alternate conception of string diagrams as labeled 1-dimensional oriented cobordisms, the operad of which we denote by Cob/O, where O is the set of string labels. The axioms of traced (symmetric monoidal) categories are fully…

Category Theory · Mathematics 2018-06-06 David I. Spivak , Patrick Schultz , Dylan Rupel

We define a notion of symmetric monoidal closed (SMC) theory, consisting of a SMC signature augmented with equations, and describe the classifying categories of such theories in terms of proof nets.

Logic in Computer Science · Computer Science 2009-06-08 Richard Garner , Tom Hirschowitz , Aurélien Pardon

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…

Quantum Algebra · Mathematics 2014-11-19 Gabriella Böhm , Stephen Lack

We study monoidal 2-categories and bicategories in terms of categorical extensions and the cohomological data they determine in appropriate cohomology theories with coefficients in Picard groupoids. In particular, we analyze the hierarchy…

Category Theory · Mathematics 2024-11-19 Ettore Aldrovandi , Milind Gunjal

We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…

Commutative Algebra · Mathematics 2016-11-09 Davide Alberelli

Skew monoidal categories are monoidal categories with non-invertible `coherence' morphisms. As shown in a previous paper bialgebroids over a ring R can be characterized as the closed skew monoidal structures on the category Mod R in which…

Category Theory · Mathematics 2016-08-30 K. Szlachanyi
‹ Prev 1 2 3 10 Next ›