Variable binding, symmetric monoidal closed theories, and bigraphs

Details Variable binding, symmetric monoidal closed theories, and bigraphs Variable binding, symmetric monoidal closed theories, and bigraphs

2009-05-26

arxiv.org/abs/0905.4200v1

Computer Science

Logic in Computer Science

An introduction to two more technical previous preprints. Accepted at Concur '09

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Variable binding, symmetric monoidal closed theories, and bigraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Variable binding, symmetric monoidal closed theories, and bigraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Variable binding, symmetric monoidal closed theories, and bigraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647204