Variable binding, symmetric monoidal closed theories, and bigraphs
| dc.creator | Garner, Richard | |
| dc.creator | Hirschowitz, Tom | |
| dc.creator | Pardon, Aurélien | |
| dc.date | 2009-05-26 | |
| dc.date.accessioned | 2026-07-07T13:18:13Z | |
| dc.date.available | 2026-07-07T13:18:13Z | |
| dc.description | 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. | |
| dc.description | An introduction to two more technical previous preprints. Accepted at Concur '09 | |
| dc.identifier | https://arxiv.org/abs/0905.4200 | |
| dc.identifier | http://arxiv.org/abs/0905.4200 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/231364 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Programming Languages | |
| dc.subject | Category Theory | |
| dc.title | Variable binding, symmetric monoidal closed theories, and bigraphs | |
| dc.type | text |