Protocol Choice and Iteration for the Free Cornering

by   Chad Nester, et al.

We extend the free cornering of a symmetric monoidal category, a double categorical model of concurrent interaction, to support branching communication protocols and iterated communication protocols. We validate our constructions by showing that they inherit significant categorical structure from the free cornering, including that they form monoidal double categories. We also establish some elementary properties of the novel structure they contain. Further, we give a model of the free cornering in terms of strong functors and strong natural transformations, inspired by the literature on computational effects.


page 1

page 2

page 3

page 4


The word problem for double categories

We solve the word problem for double categories by translating it to the...

Rewriting in Free Hypegraph Categories

We study rewriting for equational theories in the context of symmetric m...

Rewriting in Free Hypergraph Categories

We study rewriting for equational theories in the context of symmetric m...

Double pushout rewriting of C-sets

We generalize a pushout complement algorithm from graph rewriting to fin...

Space-time tradeoffs of lenses and optics via higher category theory

Optics and lenses are abstract categorical gadgets that model systems wi...

Free gs-monoidal categories and free Markov categories

Categorical probability has recently seen significant advances through t...

Categorical composable cryptography

We formalize the simulation paradigm of cryptography in terms of categor...

Please sign up or login with your details

Forgot password? Click here to reset