1 citations · 1 across the 3 of their papers we have counts for
4 papers
Monoidal categories graded by partial commutative monoids
Matthew Earnshaw, Chad Nester, Mario Román
Effectful categories have two classes of morphisms: pure morphisms, which form a monoidal category; and effectful morphisms, which can only be combined monoidally with central morp…
Resourceful Traces for Commuting Processes
Matthew Earnshaw, Chad Nester, Mario Román
We show that, when the actions of a Mazurkiewicz trace are considered not merely as atomic (i.e., mere names) but transformations from a specified type of inputs to a specified typ…
Context-Free Languages of String Diagrams
Matt Earnshaw, Mario Román
We introduce context-free languages of morphisms in monoidal categories, extending recent work on the categorification of context-free languages, and regular languages of string di…
Regular Monoidal Languages
Matthew Earnshaw, Paweł Sobociński
We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of wor…