### Table 2 References [A] G.E. Andrews, The theory of partitions, Addison-Wesley, 1976. [B] R.E. Borcherds, Vertex algebras, Kac-Moody algebras and the Monster, Proc. Natl. Acad. Sci. USA 83 (1986), 3068-3071. [Ber] A. Berkovich, Fermionic counting of RSOS-states and Virasoro character formulas for the unitary minimal series M( ; + 1): Exact results, Bonn preprint;hep-th/9403073. [BLS] P. Bouwknegt, A. Ludwig and K. Schoutens, Spinon bases, Yangian symmetry and fermionic representations of Virasoro characters in conformal eld theory, preprint USC-94/9, PUPT-1469, hep-th/9406020.

in Combinatorial constructions of modules for infinite-dimensional Lie algebras, I. Principal subspace.

"... In PAGE 5: ...7) (x 2(mr(1) 2 ;2) x 2(mr(2) 2 +1;2)x2 2(mr(2) 2 ;2) x2 2(m1;2) x 1(mr(1) 1 ;1) x 1(mr(2) 1 +1;1)x2 1(mr(2) 1 ;1) x2 1(m1;1) mp;i 2 r(2) i?1 + r(2) i?1 ? 2 ? N for 1 p r(2) i ; mp+1;i mp;i ? 4 for 1 p lt; r(2) i ; i = 1; 2; mp;i 2 r(1) i?1 ? 2r(2) i ? 1 ? N for r(2) i lt; p r(1) i ; mp+1;i mp;i ? 2 for r(2) i lt; p lt; r(1) i ; i = 1; 2 9 gt; gt; gt; gt; gt; = gt; gt; gt; gt; ; ; where r(1) 0 = r(2) 0 := 0: For an explicit list of some basis elements with low enegies, see Example 5.1, Section 5 and the corresponding Table2 in the Appendix. (The quasi- particle monomial basis for g = sl(n + 1; C ) and level k highest weight ^ = k0 ^ 0 + kj ^ j; k0 + kj = k; 1 j n; is given in De nition 5.... In PAGE 28: ...W (2^ 0): We shall denote for brevity the quasi-particle monomial xs0 2(s) xt0 1(t) by (ss0 2 : : : tt0 1): For the rst few energy levels (the eigenvalues of the scaling operator D under the adjoint action), we list in Table2 of the Appendix the elements of BW(2^ 0) of types (1; 2) and (2; 2): It is illuminating to have the entries in this truncation condition written down in terms of the color-dual-charge-type parameters r(t) i : Suppose np;i = s; 1 s k: Then r(1) i?1 X q=1 minfnp;i; nq;i?1g = r(1) i?1 X q=1 min fs; nq;i?1g = s Xt=1 r(t) i?1: (5.9) Since the number of quasi-particles of charge s and color i is r(s) i ? r(s+1) i ; the total \shift quot; due to the interaction between quasi-particles of colors i and i ? 1 is k X s=1(r(s) i ? r(s+1) i ) s Xt=1 r(t) i?1 = (5.... ..."

### Table 1 Candidate Work Products for Formal Inspections Table 2 Scheduling Guidelines for Inspections Figure 1 Formal Inspections Process - Stages and People

1993

"... In PAGE 6: ... Inspections do not take the place of milestone reviews, status reviews, or testing. Table1 provides a list of candidate work products for formal inspections. The first category, Typical Work Products, indicates the most likely candidates for inspections.... In PAGE 6: ... The designations in parentheses are commonly used by Fagan and others and are included for reference. The second category in Table1 , Additional Candidate Work Products, shows that virtually any product that has requirements, constraints, and guidelines can be examined by using the formal inspection process. Inspections should be used to judge the quality of the software work product, not the quality of the people who create the product.... ..."

### Table 1 Candidate Work Products for Formal Inspections Table 2 Scheduling Guidelines for Inspections Figure 1 Formal Inspections Process - Stages and People

"... In PAGE 6: ... Inspections do not take the place of milestone reviews, status reviews, or testing. Table1 provides a list of candidate work products for formal inspections. The first category, Typical Work Products, indicates the most likely candidates for inspections.... In PAGE 6: ... The designations in parentheses are commonly used by Fagan and others and are included for reference. The second category in Table1 , Additional Candidate Work Products, shows that virtually any product that has requirements, constraints, and guidelines can be examined by using the formal inspection process. Inspections should be used to judge the quality of the software work product, not the quality of the people who create the product.... ..."

### Table 9: Algorithmic Version of LF

1993

"... In PAGE 35: ...context ?, respectively. The rules of derivation for these assertions appear in Table9 . These rules make use of a function NF(U) which yields the normal form of an expression U with respect to the leftmost-outermost reduction strategy.... In PAGE 35: ...ontext ?, respectively. The rules of derivation for these assertions appear in Table 9. These rules make use of a function NF(U) which yields the normal form of an expression U with respect to the leftmost-outermost reduction strategy. Several of the rules given in Table9 make use of NF in the conclusion of the rule. We temporarily adopt the convention that such a rule does not apply unless the required normal form exists, for it will be a direct consequence of the soundness theorem given below that the normal forms in question will always exist.... ..."

Cited by 571

### Table 7. Bash versions.

2001

"... In PAGE 7: ...04). Table7 describes these versions. For each version, column 2 lists the number of lines of code in that version, column 3 lists the number of functions in that version, and column 4 lists the total number of functions in common be- tween that version and the succeeding versions.... ..."

Cited by 7

### Table 7. Bash versions.

2001

"... In PAGE 7: ...04). Table7 describes these versions. For each version, column 2 lists the number of lines of code in that version, column 3 lists the number of functions in that version, and column 4 lists the total number of functions in common be- tween that version and the succeeding versions.... ..."

Cited by 7

### Table 1. NFS operations by version - at a glance Version 2 Version 3 Version 4

"... In PAGE 4: ...n NFS Version 2 implementation. NFS Version 4 did not have that requirement. The only RPC procedures in NFS Version 4, in the strict sense, are NULL and COMPOUND, and their callback analogues. Table1 . groups the operations (or in the case of NFS Version 2 and 3, RPC procedures) functionally for purposes of comparison.... ..."