activity
20092026
most citedGeneralizing determinization from automata to coalgebras

111 citations · 374 across the 31 of their papers we have counts for

collaborators
Showing 2021Show all

6 papers · 1 filter

cs.LO2021★ 5 cited

String Diagram Rewrite Theory III: Confluence with and without Frobenius

Filippo Bonchi, Fabio Gadducci, Aleks Kissinger +2

In this paper we address the problem of proving confluence for string diagram rewriting, which was previously shown to be characterised combinatorically as double-pushout rewriting…

cs.LO2021

Convexity via Weak Distributive Laws

Filippo Bonchi, Alessio Santamaria

We study the canonical weak distributive law of the powerset monad over the semimodule monad for a certain class of semirings containing, in particular, positive semifields. Fo…

cs.LO2021

On Doctrines and Cartesian Bicategories

Filippo Bonchi, Alessio Santamaria, Jens Seeber +1

We study the relationship between cartesian bicategories and a specialisation of Lawvere's hyperdoctrines, namely elementary existential doctrines. Both provide different ways of a…

cs.LO2021

Diagrammatic Polyhedral Algebra

Filippo Bonchi, Alessandro Di Giorgio, Pawel Sobocinski

We extend the theory of Interacting Hopf algebras with an order primitive, and give a sound and complete axiomatisation of the prop of polyhedral cones. Next, we axiomatise an affi…

cs.LO2021★ 5 cited

String Diagram Rewrite Theory II: Rewriting with Symmetric Monoidal Structure

Filippo Bonchi, Fabio Gadducci, Aleks Kissinger +2

Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or disc…

cs.CL2021★ 2 cited

Combining Semilattices and Semimodules

Filippo Bonchi, Alessio Santamaria

We describe the canonical weak distributive law of the powerset monad over the -left-semimodule monad $\ma…