Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs

Richard Garner*, Tom Hirschowitz, Aurélien Pardon

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

2 Citations (Scopus)


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 this setting, one first specifies an smc theory, which may express binding operations, in a way reminiscent from higher-order abstract syntax (hoas). This theory generates an smc category whose morphisms are, in a sense, terms in the desired syntax. We apply our approach to Jensen and Milner's (abstract binding) bigraphs, in which processes behave linearly, but names do not. This leads to an alternative category of bigraphs, which we compare to the original.

Original languageEnglish
Title of host publicationCONCUR 2009 - Concurrency Theory 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings
EditorsMario Bravetti, Gianluigi Zavattaro
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Number of pages17
Volume5710 LNCS
ISBN (Electronic)9783642040818
ISBN (Print)3642040802, 9783642040801
Publication statusPublished - Sept 2009
Externally publishedYes
Event20th International Conference on Concurrency Theory, CONCUR - 2009 - Bologna, Italy
Duration: 1 Sept 20094 Sept 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5710 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349


Other20th International Conference on Concurrency Theory, CONCUR - 2009


Dive into the research topics of 'Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs'. Together they form a unique fingerprint.

Cite this