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...
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...
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...
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 ...