Resourceful Traces for Commuting Processes
Abstract
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 type of outputs, we obtain a novel notion of presentation for effectful categories (also known as generalised Freyd categories), a well-known algebraic structure in the semantics of side-effecting computation. Like the usual representation of traces as graphs, our notion of presentation gives rise to a graphical calculus for effectful categories. We use our presentations to give a construction of the commuting tensor product of free effectful categories, capturing the combination of systems in which the actions of each must commute with one another, while still permitting exchange of resources
Cite
@article{arxiv.2507.18246,
title = {Resourceful Traces for Commuting Processes},
author = {Matthew Earnshaw and Chad Nester and Mario Román},
journal= {arXiv preprint arXiv:2507.18246},
year = {2025}
}