### Table 9.3: Unsave Operators for Communication Objects

### Table C.3. Table of expressions. Expression Description

### Table expressions are expressions (usually queries) which

### Table 3: Semantics of expressions.

2002

"... In PAGE 4: ... It is easy to show if T U then [[T]] [[U]]. Table3 gives the semantics of expressions, dependent on an arbitrary method environment in [[MEnv]]. Table 4 gives the semantics of commands.... ..."

Cited by 74

### Table 5: Valid Proof Expressions

1993

"... In PAGE 18: ... We write FV( ) for the set of free variables of the formulas apos;i in , and dom( ) for the set of i apos;s in . In Table5 we give rules for proving assertions of the form X; ` : apos;, which is to be read as \ is a valid proof of apos; with respect to the proof context (X; ). quot; The derivability of such an assertion means that a number of general rules are obeyed (e.... In PAGE 20: ... To encode natural deduction proofs as LF terms we assume that the LF variables include the rst-order variables and the occurrence markers. For each proof context (X; ) we inductively de ne a function quot;X; from valid proofs with respect to (X; ) (de ned in Table5 ) to LF terms as follows: quot;X; (hyp apos;( )) = quot;X; (raa apos;( )) = raa quot;X( apos;) quot;X; ( ) quot;X; (imp-i apos;; ( : )) = imp-i quot;X( apos;) quot;X( ) :true( quot;X( apos;)): quot;X;( ; : apos;)( ) quot;X; (all-ix; apos;( )) = all-i ( x: : quot;X;x( apos;)) ( x: : quot;(X;x); ( )) quot;X; (all-ex; apos;;t( )) = all-e ( x: : quot;X;x( apos;)) quot;X(t) quot;X; ( ) quot;X; (some-ex; apos;; ( 0; : )) = some-e ( x: : quot;X;x( apos;)) quot;X( ) quot;X; ( 0) ( x: : :true( quot;X;x( apos;)): quot;(X;x);( ; : apos;)( )) In the cases involving individual variables x and occurrence markers , it is assumed that x and are chosen to be the rst such variable or occurrence marker (in some standard enumeration) not occurring in X or , respectively.... ..."

Cited by 571

### Table 1. Design rules. The rules marked with * represent families of rules, oriented to solve the same type of problem with dif- ferent design strategies.

2003

"... In PAGE 2: ... Alike the designer behaviour, rules take into account the conceptual and source schemas as well as the design guidelines and mappings, and then perform a schema design transformation. Table1 shows a table with the proposed set of rules. Table 1.... ..."

Cited by 1