11 search results - page 2 / 3 » Axiomatizing Binding Bigraphs |
CONCUR
2009
Springer
13 years 12 months ago
2009
Springer
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
ENTCS
2007
13 years 5 months ago
2007
d Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA We explore an axiomatize...
ICFP
2005
ACM
14 years 5 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...
AMAST
1998
Springer
13 years 9 months ago
1998
Springer
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...