English

The Produoidal Algebra of Process Decomposition

Logic in Computer Science 2023-01-30 v1 Category Theory

Abstract

We introduce the normal produoidal category of monoidal contexts over an arbitrary monoidal category. In the same sense that a monoidal morphism represents a process, a monoidal context represents an incomplete process: a piece of a decomposition, possibly containing missing parts. We characterize monoidal contexts in terms of universal properties. In particular, symmetric monoidal contexts coincide with monoidal lenses, endowing them with a novel universal property. We apply this algebraic structure to the analysis of multi-party interaction protocols in arbitrary theories of processes.

Keywords

Cite

@article{arxiv.2301.11867,
  title  = {The Produoidal Algebra of Process Decomposition},
  author = {Matt Earnshaw and James Hefford and Mario Román},
  journal= {arXiv preprint arXiv:2301.11867},
  year   = {2023}
}

Comments

56 pages, 41 figures

R2 v1 2026-06-28T08:23:43.248Z