### Table 1 Variation at polymorphic segments

2007

"... In PAGE 6: ... For instance, between the 105 var2CSA sequences and P. reichenowi, 70% of the polymorphic segments (4370/6216) exactly match one of the consensus types and an additional 22% differ by only one amino acid from consensus ( Table1 ). Fur- thermore, many of these basic types are present both across Fig.... ..."

### Table 6. Cost of the parameters selection Fur Lega Lega:Fur

"... In PAGE 6: ... From table 5, we see that the parameter selection qualityisnearlythesameforLegaandFuronaverage. Table6 shows the cost of the parameters selection procedure in seconds. From table 6, we see that the compilation cost of Lega can be much smaller than Fur, Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS apos;06) ... ..."

### Table 1: Oz and Prolog

"... In PAGE 11: ...Oz Constraints None, except in AKL Incremental solver with ask, tell Control Fine-grain concurrency Explicit dataflow threads, encapsu- lated search Higher-order Restricted First-class procedures with lexical scoping State Stream-based objects Objects, cells Table 2: Oz and concurrent logic programming 3.3 Oz and Prolog There is a strong sense in which Oz is a successor to Prolog (see Table1 ). The Oz system can be used for many of the tasks for which Prolog and constraint logic programming are used today [22, 30, 12, 34].... ..."

### Table 2. Heterozygosity for various polymorphisms.a Polymorphism

1464

### Table 1. Predominant allele frequency for various polymorphisms.a Polymorphism

1464

"... In PAGE 6: ...g., 4216 and 4030), one of the alleles was clearly predominant in all of the groups ( Table1 ). However, the relatively small number of samples in each group did not allow us to reach any statistically significant conclusions about allele distribution.... ..."

### 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 8: Results with polymorph algorithm

"... In PAGE 18: ... The use of Deltablue during the opening step is not restrictive: during this step it is not important to handle all the constraints, we can remove the constraints which induce redundant information (Carcone, 97). As shown in Table8 , the polymorph algorithm is not the best in time performances. This is due to the fact that the time to take into account an authoring action is composed in two parts: the time for building information for the solver, and the time to compute the new solution.... ..."

### 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 1: Polymorphic variable declaration

Cited by 2