### Table 1: Polymorphic Type Assignment

1994

"... In PAGE 3: ... Polymorphic type assignment is de ned by a set of rules for deriving judgements of the form ; ` e : , with the intended meaning that the expression e has type under the assumption that the locations in e have the monotypes ascribed by , and the free variables in e have the polytypes ascribed by . The rules of inference are given in Table1 . These rules make use of two auxiliary notions.... ..."

Cited by 59

### Table 1: Polymorphic Type Assignment

1994

"... In PAGE 2: ... Polymorphic type assignment is de ned by a set of rules for deriving judgements of the form ;; ` e : , with the intended meaning that the expression e has type under the assumption that the locations in e have the monotypes ascribed by , and the free variables in e have the polytypes ascribed by . The rules of inference are given in Table1 . These rules make use of two auxiliary notions.... ..."

Cited by 1

### TABLE III Effectiveness of the type-inference approaches.

2000

Cited by 30

### TABLE III Effectiveness of the type-inference approaches.

### Table 3: Statically inferred polymorphic tuples.

2006

"... In PAGE 9: ... We were able to prove that all monomorphic tuples in our code base are feasible (recall that for compar- ison purposes we consider tuples in methods reachable by RTA). Table3 shows the number of polymorphic tu- ples: the number for the CHA-based analysis, the number for the RTA-based analysis and the actual number obtained by manual inspection (i.e.... ..."

Cited by 1

### Table 3: Statically inferred polymorphic tuples.

2006

"... In PAGE 9: ... We were able to prove that all monomorphic tuples in our code base are feasible (recall that for compar- ison purposes we consider tuples in methods reachable by RTA). Table3 shows the number of polymorphic tu- ples: the number for the CHA-based analysis, the number for the RTA-based analysis and the actual number obtained by manual inspection (i.e.... ..."

Cited by 1

### Table 1: Polymorphic Type Assignment

1993

"... In PAGE 7: ... We shall work with a syntax-directed formulation of the Damas-Milner polymorphic type assignment system inspired by the static semantics of Standard ML [25]. The rules given in Table1 de ne a formal system for deriving judgements of the form ; ` e : , expressing that the expression e may be assigned the monotype in context ;. The rules are parametric in a signature , whichweleave implicit.... In PAGE 7: ... The rules are parametric in a signature , whichweleave implicit. We often write ; ` e : ,orjuste : when ; is empty, to mean that this typing judgement is derivable in accordance with the rules of Table1 . An expression e is said to be well-typed in a context ; i there exists a suchthat ; ` e : .... In PAGE 7: ... An expression e is said to be well-typed in a context ; i there exists a suchthat ; ` e : . Some of the rules given in Table1 make use of auxiliary notions that merit further explanation. Rule var makes use of the polymorphic instance relation whichisde nedtoholdi is a polytype of the form 8t 1 : .... In PAGE 7: ...We sometimes abbreviate Close ; ( ) to just Close( ) when ; is the empty context. The formal system of Table1 is clearly a subsystem of the system given by Damas and Milner [4] in the sense that if ; ` e : is derivable in the system of Table 1, then it is derivable in Damas and Milner apos;s system. Conversely,if;` e : is derivable in Damas and Milner apos;s system, then ; ` e : is derivable in the system of Table 1 whenever .... In PAGE 7: ...We sometimes abbreviate Close ; ( ) to just Close( ) when ; is the empty context. The formal system of Table 1 is clearly a subsystem of the system given by Damas and Milner [4] in the sense that if ; ` e : is derivable in the system of Table1 , then it is derivable in Damas and Milner apos;s system. Conversely,if;` e : is derivable in Damas and Milner apos;s system, then ; ` e : is derivable in the system of Table 1 whenever .... In PAGE 7: ... The formal system of Table 1 is clearly a subsystem of the system given by Damas and Milner [4] in the sense that if ; ` e : is derivable in the system of Table 1, then it is derivable in Damas and Milner apos;s system. Conversely,if;` e : is derivable in Damas and Milner apos;s system, then ; ` e : is derivable in the system of Table1 whenever .Thus all and only the monotypes derivable for a given term in Damas and Milner apos;s system are derivable in the system considered here.... ..."

### Table 2. The number of polymorphic sites within species at oskar

"... In PAGE 3: ... Results (i) Grouping the taxa and patterns of polymorphism Fig. 2 shows all the variable sites and Table2 lists the types of variation found in each taxon for oskar. The sequenced region is rich in variation, and reveals several synonymous and amino acid replacement variants as well as considerable indel variation and many base pair changes in the introns.... ..."

### TABLE 1 Effects of Reading Pseudowords versus Words on Connectivitya

2002

Cited by 1