"... In PAGE 11: ...15 seconds on our computer, a 2 GHz AMD Athlon MP 2400+ processor with 256 KB cache and 1GB RAM.5 The different algorithmic choices, whose effects we want to examine, are described in Table2 . We need to split the analysis into four separate experi- mental designs, one for each type of approach, that is, one for each row of the table.... ..."

"... In PAGE 11: ...if and only if it has received an even number of true inputs: fun Parity #28a,b#29 = let val p = signal false in Xor #28a,b,p#29 || Reg #28p,b#29 end Reg Xor a b p The val p = :::declaration introduces an internal signal whose initial value is false. Table1 summarizes the behavioral constructs of HML. Wehave implemented a simple simulator which allows HML behavioral descriptions to be executed interactively #7B indeed, all the descriptions in this section were developed with the aid of the simulator.... ..."

"... In PAGE 18: ... These checks are not needed in the other solutions since they use a more precisely typed representation for the relations, so that most of the necessary checks are performed statically by the compiler. Table3 shows the measured times for constructing the relations: they are significant compared with the execution time for the small data set, but become less so as the data size increases.... ..."

"... In PAGE 18: ... These checks are not needed in the other solutions since they use a more precisely typed representation for the relations, so that most of the necessary checks are performed statically by the compiler. Table3 shows the measured times for constructing the relations: they are significant compared with the execution time for the small data set, but become less so as the data size increases.... ..."

"... In PAGE 24: ... In setting 3, pre-compilation is only possible for theories that are stored explicitly and not for theories that are constructed at run time. Table2 shows which theories are pre-compiled in setting 3. The experiments on the Cancer data were run on an Intel P4, 2Ghz, 512MB, the other experiments on an Intel P4, 1.... In PAGE 30: ... If a theory T is constructed based on a number of other theories Ti, then the compiled version of T could be computed from the compiled versions of the Ti. For predicate disjoint theories with no parameters, included in T with add/1 meta-rules, this is trivial and already supported by our prototype implementation ( Table2 ). If the theories are not predicate disjoint or if more general meta-rules are used, this becomes much more involved.... ..."

"... In PAGE 21: ... (The code uses some arithmetic primitives and local let declarations.) The code in Table14 is of course an inefficient implementation of arrays, but it illustrates a point: the type rules for more complex constructions can be derived from the type rule for simpler construc- tions. The typing rules for array operations shown in Table 15 can be easily derived from Table 14, according to the rules for products, functions, and refs.... In PAGE 21: ...) The code in Table 14 is of course an inefficient implementation of arrays, but it illustrates a point: the type rules for more complex constructions can be derived from the type rule for simpler construc- tions. The typing rules for array operations shown in Table 15 can be easily derived from Table14 , according to the rules for products, functions, and refs. Table 15.... ..."

"... In PAGE 10: ... 4.1 Theory stdlang: Language definitions Table1 summarizes the definitions in theory stdlang.5 Type void intends to serve as the type of procedures and statements, as opposed to functions and expressions.... ..."

"... In PAGE 8: ... For those who make adoption decisions earlier, their actions may reveal private information to others, which generates information externalities (Zhang, 1997). (See Table2 for key constructs in the information cascade theory.) ... ..."