5 search results - page 1 / 1 » Binding bigraphs as symmetric monoidal closed theories |
111
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
81
Voted
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
82
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. 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 theo...
75
Voted
ICFP
2005
ACM
15 years 10 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
ENTCS
2002
14 years 10 months ago
2002
In the quest for an elegant formulation of the notion of "polycategory" we develop a more symmetric counterpart to Burroni's notion of "T-category", where ...