3 citations · 7 across the 4 of their papers we have counts for
3 papers · 1 filter
Variable binding, symmetric monoidal closed theories, and bigraphs
Richard Garner, Tom Hirschowitz, Aurélien Pardon
This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects. In our…
Graphical Presentations of Symmetric Monoidal Closed Theories
Richard Garner, Tom Hirschowitz, Aurélien Pardon
We define a notion of symmetric monoidal closed (SMC) theory, consisting of a SMC signature augmented with equations, and describe the classifying categories of such theories in te…
Binding bigraphs as symmetric monoidal closed theories
Tom Hirschowitz, Aurélien Pardon
Milner's bigraphs are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the pi-calculus and…