### Table 1: The basic data types employed and their interpretation

2001

"... In PAGE 13: ...Table 1: The basic data types employed and their interpretation started when a process tool is idle. The data types providing the basis for the definitions of the CPN models developed in this example, are listed in Table1 . We notice that elements b1 and b2, appearing in Table 1, correspond to the ports of process tool p1.... In PAGE 13: ... Element b3 corresponds to the port of process tool p2, while elements b4 and b5 respectively denote the ports of stockers s1 and s2. The detailed semantics of the remaining elements of Table1 will be defined in the discussion of the following subsections. 3.... ..."

Cited by 2

### Table 5.1: Interpretation of the Bayesian recursion.

1997

Cited by 6

### Table 3 to rule R maps the -term interpreting A to that interpreting B.

1998

"... In PAGE 22: ... We now specify in full the language of the linear dialectic -calculus. Examples of all constructs can be found in Table3 below. Terms are built up from variables a; b; : : : ; x; y; : : : and types A; B; : : : using -abstraction, application, and pairing.... In PAGE 23: ...When the variable a of a -abstraction is positively typed by a con- junction or negatively typed by an implication (in which case we will have usually written x rather than a), a may be expanded as the pair (a1; a2) where the ai apos;s are variables of the appropriate type and sign depending on A and its sign. This expansion may be applied recursively to the ai apos;s, as for example in rule A1 of Table3 below. When a is positively typed by an implication, a may be written (a1; a2) but the ai apos;s do not have any type of their own independent of that of a.... In PAGE 24: ... f : (A? B) ?C : a : A : y B : f(a; y) C A200 f : (A ?B) ?C : x A : b : B : f(x; b) C C1 (a; b) : A B : (b; a) : B A C2 (f; f0) : A? B : (f0; f) : B ?A C20 (f; f0) : A ?B : (f0; f) : B? A D (f; c) : (A? B) C : a : A : (f(a); c) : B C D0 (f; c) : (A ?B) C : x A : (f(x); c) B ?C E1 (a; b) : A B : (f(a); g(b)) : A0 B0 E2 h : A0? B : ghf : A? B0 E3 h : A ?B0 : g0hf0 : A0 ?B Table3 . Transformations Associated to Rules of S2 Rules E1-E3 assume that A ` A0 is realized by (f; f0) : A? A0 and B ` B0 by (g; g0) : B? B0.... In PAGE 24: ... The remaining rules are interpreted along the same lines. Theorem 4 Every theorem of S2 is interpreted by Table3 as a transfor- mation represented by a closed term of the linear dialectic -calculus. Proof: This is a straightforward consequence of the form of Table 3.... In PAGE 24: ... Theorem 4 Every theorem of S2 is interpreted by Table 3 as a transfor- mation represented by a closed term of the linear dialectic -calculus. Proof: This is a straightforward consequence of the form of Table3 . The interpretations of the axiom instances and the rules are in the language, con- tain no free variables, -bind exactly one variable, and are typed compatibly with the rules.... ..."

Cited by 10

### Table 8: Interpretation of types in the Metalanguage

1991

"... In PAGE 18: ... De nition 3.7 (metalanguage) An interpretation [[ ]] of the metalanguage in a category C with terminal object !A: A ! 1, binary products A1;A2 i : A1 A2 ! Ai and a strong monad (T; ; ; t) is parametric in an interpretation of the symbols in the signature and is de ned by induction on the derivation of well-formedness for types (see Table8 ), terms and equations (see Table 9). Finite products A1;:::;An i : A1 : : : An ! Ai used to interpret contexts and variables are de ned by induction on n: 0 A1 : : : A0 = 1 n + 1 A1 : : : An+1 = (A1 : : : An) An+1 { A1;:::;An+1 n+1 = (A1 ::: An);An+1 2 { A1;:::;An+1 i = (A1 ::: An);An+1 1 ; A1;:::;An i The inference rules for the metalanguage (see Table 10) are divided into three groups: general rules for many sorted equational logic rules for nite products rules for T... ..."

Cited by 585

### Table 1 gives recursive rules defining lambda ex-

### Table 1. Interpretation of various types of knowledge Type Interpretations and Examples

2006

"... In PAGE 3: ... Classes can be related to corresponding types of individuals by an instantiation (I) link. Table1 presents various possible semantic interpretations of these graphic symbols. Table 1.... ..."

Cited by 6

### Table 5f Rules for Defining Next Terminals

"... In PAGE 9: ...Rules Used in the CAMSNET-MIB Table5 a Rule for Defining a Fast Machine fast_machine(Device, Model, Type) :- device(Device, Model, Asset, Serial, Type, Loc, Own, User, Sup, Name), Model = dx486, Type = cpu. *This relation finds fast machines with two arguments Table 5b Rules for Defining a Device List device_list(Device) :- device(Device, _, _, _, _, _, _, _, _, _).... In PAGE 9: ...Rules Used in the CAMSNET-MIB Table 5a Rule for Defining a Fast Machine fast_machine(Device, Model, Type) :- device(Device, Model, Asset, Serial, Type, Loc, Own, User, Sup, Name), Model = dx486, Type = cpu. *This relation finds fast machines with two arguments Table5 b Rules for Defining a Device List device_list(Device) :- device(Device, _, _, _, _, _, _, _, _, _). *Relation gives device names with one argument device_list(Device, Loc) :- device(Device, _, _, _, _, Loc, _, _, _, _).... In PAGE 9: ... *Gives device names with two arguments device_list(Device, Model, Type, Loc) :- device(Device, Model, _, _, Type, Loc, _,_,_,_). * quot; quot; four arguments Table5 c Rule for Defining IBM Equipment ibm_equipment(Device) :- device(Device, _, _, _, _, _, _, _, Sup, _), Sup = ibm. *Devices supplied by ibm Table 5d Rules for Defining a Path path(X, Y) :- cable_connection(X, _, Y, _, _, _).... In PAGE 9: ... * quot; quot; four arguments Table 5c Rule for Defining IBM Equipment ibm_equipment(Device) :- device(Device, _, _, _, _, _, _, _, Sup, _), Sup = ibm. *Devices supplied by ibm Table5 d Rules for Defining a Path path(X, Y) :- cable_connection(X, _, Y, _, _, _). path(X, Y) :- cable_connection(X, _, Z, _, _, _), path(Z, Y).... In PAGE 9: ... path(X, Y) :- cable_connection(X, _, Z, _, _, _), path(Z, Y). *Recursive rule for finding path Table5 e Rule for Defining a Terminal terminal(Device, Loc) :- device(Device, _, _, _, Type, Loc, _, _, _, _), Type = cpu. *Relation gives terminal name *connected to both segments with their location Table 5f Rules for Defining Next Terminals... In PAGE 9: ... Table5 g Rules for Defining Bus 1 and Bus 2 bus1(Device) :- device(Device, Model, _, _, _, _, _, _, _, _), Model = dx486, port(Device, _, Type), Type = ethernet. *Relation gives all terminals connected to segment one bus1(Device, Loc) :- device(Device, Model, _, _, _, Loc, _, _, _, _), Model = dx486, port(Device, _, Type), Type = ethernet.... ..."

### Table 1: Terms and their interpretation

1989

"... In PAGE 8: ...Extending the language In this section we discuss how to interpret terms with any nite number of variables (instead of exactly one as in Table1 ) and how datatypes relate to computations. We will consider only product and functional types, because sum types are completely straightforward5.... In PAGE 8: ... If T were IdC, then [[x1: 1 ` (let x2=e2 in e): ]] would be hid 1; g2i; g. In the general case, Table1 says that ; above is indeed composition in the Kleisli category, therefore hid 1; g2i; g becomes hid 1; g2i; T g; . But in hid 1; g2i; T g; there is a type mismatch, since the codomain of hid 1; g2i is 1 T 2, while the domain of T g is T ( 1 2).... In PAGE 18: ...SYNTAX SEMANTICS var x1; : : : ; xn ` xi = n i ; V let x ` e1 = g1 x; x ` e2 = g2 x ` (let x=e1 in e2) = hidV n; g1i; tV n;V ; T g2; V x; x ` e = g x ` ( x:e) = T V;V;V n(g); G; V V T app x ` e1 = g1 x ` e = g x ` e(e1) = hg; g1i; appv Table 9: call-by-value interpretation RULE SYNTAX SEMANTICS var x1; : : : ; xn ` xi = n i let x ` e1 = g1 x; x ` e2 = g2 x ` (let x=e1 in e2) = hid(TN)n; g1i; t(TN)n;N; T (id(TN)n N); T g2; N x; x ` e = g x ` ( x:e) = T TN;N;(TN)n(g); G; NTN T app x ` e1 = g1 x ` e = g x ` e(e1) = hg; g1i; appn Table1 0: call-by-name interpretation... ..."

Cited by 369

### TABLE 1: Interpretation of link expressions

1998

Cited by 2

### Table 1: Defining Policy Types

"... In PAGE 4: ... Each type of SOA policy is vitally important to achieving reli- ability and trust, as shown in Table 1. Currently, most technologists focus on testing the structural policy type men- tioned in Table1 . True, integration stan- dards are important, but once those types of problems are solved, behavioral and performance level validation will gain prominence.... ..."