Sciweavers

3 search results - page 1 / 1
» Variable Binding, Symmetric Monoidal Closed Theories, and Bi...
Sort
View
131
Voted
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 15 days ago
Binding bigraphs as symmetric monoidal closed theories
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...
Tom Hirschowitz, Aurélien Pardon
97
Voted
CONCUR
2009
Springer
15 years 7 months ago
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
Richard H. G. Garner, Tom Hirschowitz, Auré...
86
Voted
ICFP
2005
ACM
16 years 11 days ago
A unified category-theoretic formulation of typed binding signatures
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...
Miki Tanaka, John Power