6 research outputs found
Graphical Presentations of Symmetric Monoidal Closed Theories
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 terms of proof nets.Comment: Uses Paul Taylor's diagram
Graphical Presentations of Symmetric Monoidal Closed Theories
Uses Paul Taylor's diagrams.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 terms of proof nets
Variable binding, symmetric monoidal closed theories, and bigraphs
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 setting, one first specifies an SMC theory T, which may
express binding operations, in a way reminiscent from higher-order abstract
syntax. This theory generates an SMC category S(T) whose morphisms are, in a
sense, terms in the desired syntax. We apply our approach to Jensen and
Milner's (abstract binding) bigraphs, which are linear w.r.t. processes. This
leads to an alternative category of bigraphs, which we compare to the original.Comment: An introduction to two more technical previous preprints. Accepted at
Concur '0
Binding bigraphs as symmetric monoidal closed theories
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 the Ambient calculus. This paper is only concerned
with bigraphical syntax: given what we here call a bigraphical signature K,
Milner constructs a (pre-) category of bigraphs BBig(K), whose main features
are (1) the presence of relative pushouts (RPOs), which makes them well-behaved
w.r.t. bisimulations, and that (2) the so-called structural equations become
equalities. Examples of the latter include, e.g., in pi and Ambient, renaming
of bound variables, associativity and commutativity of parallel composition, or
scope extrusion for restricted names. Also, bigraphs follow a scoping
discipline ensuring that, roughly, bound variables never escape their scope.
Here, we reconstruct bigraphs using a standard categorical tool: symmetric
monoidal closed (SMC) theories. Our theory enforces the same scoping discipline
as bigraphs, as a direct property of SMC structure. Furthermore, it elucidates
the slightly mysterious status of so-called links in bigraphs. Finally, our
category is also considerably larger than the category of bigraphs, notably
encompassing in the same framework terms and a flexible form of higher-order
contexts.Comment: 17 pages, uses Paul Taylor's diagram