2000 character limit reached
Dynamics and Coherence for the Free Cornering with Protocol Choice
Published 1 Aug 2025 in math.CT and cs.LO | (2508.00633v1)
Abstract: We present a term rewriting system that models the dynamic aspects of the free cornering with protocol choice of a monoidal category, which has been proposed as a categorical model of process interaction. This term rewriting system is confluent and terminating in an appropriate sense. We use this machinery to prove a coherence theorem for the free cornering with protocol choice.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.