🤖 AI Summary
This work addresses the formal modeling of interactive concurrent processes by proposing a multi-categorical parameterized term rewriting system. For the first time, process interaction is characterized as a confluent and terminating rewrite relation, and it is shown that the resulting term structures naturally form a virtual double category. The central contribution lies in the construction of a denotational semantic functor from this computational syntax to the free corner construction in free monoidal categories, thereby providing a rigorous semantic foundation and mathematical guarantee for interactive behavior.
📝 Abstract
We present a calculus that models a simple sort of process interaction. Our calculus consists of a collection of terms together with a rewrite relation, parameterised by an arbitrary multicategory whose morphisms we understand as non-interactive processes. We show that our calculus is confluent and terminating, and that terms modulo the induced convertibility relation form a virtual double category. We relate our calculus to the free cornering of a monoidal category, which is a double-categorical model of process interaction that is similar in spirit to the calculus presented herein. Precisely, we construct a functor from the virtual double category given by our calculus into the underlying virtual double category of the free cornering of the free monoidal category on the multicategory of non-interacting processes. If we think of the terms of our calculus as programs and the rewriting system as an operational semantics for these programs, this functor gives a sound denotational semantics for our calculus in terms of the free cornering.