### Table 1. Early operational semantics for -calculus terms

"... In PAGE 5: ... The type action is de ned as follows: Inductive action : Set := Ain : nat - gt; name - gt; l_name - gt; action | Aou : nat - gt; name - gt; l_name - gt; action | Tau : action. Transition relation The type commit, used to represent the transition relation, is inductively de ned a la Prolog, each constructor expressing one of the rules of Table1 . Without stating the full de nition of commit, which would require some pretty technical explanations, we will focus on a few examples, that we consider to be emblematic of the strong in uence of the de Bruijn notation in our implementation.... In PAGE 6: ...e. it should be provable from the rules of Table1 that these processes are bisimilar). If we de ne these processes within the de Bruijn notation, we get (informally) P0 1 = k[1; 0]:0 and P0 2 = k[0; 1]:0, k being the index that represents free name a in the translation.... In PAGE 9: ... To describe function C, that builds the closure under contexts of a relation (we shall write RC), we must rst de ne contexts. Here again, the syntax of our processes dictates the shape of the contexts we use: while in [San95b] Sangiorgi could restrict his study to monadic contexts (contexts with one occurrence of the hole), having recursive de nitions in his calculus, the presence of the replication operator compells us to work with polyadic contexts, because of the shape of the BANG rule (see Table1 ). We then de ne function C as follows: De nition 3.... ..."

### Table 2. Including containers into the query calculus value-based relation r(a1:s1,:::,an:sn)

1994

"... In PAGE 16: ... To summarize the di erence: Queries are formulated from the perspect- ive of local objects rather than starting from a xed schema level. Table 3, being a continuation of Table2 , shows the technical details to deal with queries in context of TROLL light. Table 3.... ..."

Cited by 8

### Table 1 The Calculus SAP

2002

"... In PAGE 3: ...n the full version [9], available at http://www.cogs.susx.ac.uk/reports.html. 2 The Calculus SAP The syntax of processes is given in Table1 and is basically the same as that in [5], except that each of the original capabilities has a co-capability, as in [8], and that now each capability has an extra argument h, 1Here, as in much of the paper, we will ignore passwords unless they play a central role in the discussion... ..."

Cited by 51

### Table 4: The calculus LHO

1999

"... In PAGE 19: ... We call the resulting calculus Local Higher-Order -calculus, brie y LHO . Its syntax and operational semantics are de ned by adding the productions and rules in Table4 to those of L . Passing a process is like passing a parameterless procedure.... ..."

### Table 4: The calculus LHO

"... In PAGE 19: ... We call the resulting calculus Local Higher-Order -calculus, brie y LHO . Its syntax and operational semantics are de ned by adding the productions and rules in Table4 to those of L . Passing a process is like passing a parameterless procedure.... ..."

### Table 1: -calculus

1999

Cited by 10

### Table 2: -calculus (continued)

1999

Cited by 10