Performance, genericity and flexibility are three valuable qualities for scientific environments that tend to be antagonistic. C++ provides excellent support for both performances and genericity thanks to its support for (class and function) templates. However, a C++ templated library can hardly be qualified as flexible: data of unexpected types cannot enter the system, which hinders user inter...

In earlier papers it was shown that the generic tropical variety of an ideal can contain information on algebraic invariants as for example the depth in a direct way. The existence of generic tropical varieties has so far been proved in the constant coefficient case for the usual notion of genericity. In this paper we generalize this existence result to include the case of non-constant coeffici...

We establish fixed point, stability and genericity theorems for strict contractions on complete metric spaces with graphs.

Such genericity is a feature of entire sentences (or at least of entire clauses), and is not attributable to any subpart of the sentence, such as to the subject noun phrase or to the verb phrase. It is instead somehow an interaction between the two. This sets it apart from another type of genericity, which is attributed to the noun phrase’s referring to an abstract genus (or kind) and not as ma...

Framework-based Object-Oriented applications are not as eecient as they could be. This results from the high-genericity of frameworks. However, once the framework is instantiated, part of this genericity can be removed. This is for instance the case when gener-icity is obtained through the use of reeection. This paper takes the Java Serialization framework as a typical example and shows how par...

Abst rac t . The Genericity Lemma is one of the most important motivations to take in the untyped lambda calculus the notion of solvability as a formal representation of the informal notion of undefinedness. We generalise solvability towards typed lambda calculi, and we call this generalisation: usability. We then prove the Genericity Lemma for un-usable terms. The technique of the proof is bas...

Manin and Schechtman introduced a family of arrangements hyperplanes generalizing classical braid arrangements, which they called the discriminantal arrangements. Athanasiadis proved conjecture by Bayer Brandt providing full description combinatorics in case very generic Libgober Settepanella described sufficient geometric condition for given to be non-very terms notion dependency certain arran...

In a connected group of finite Morley rank in which the generic element belongs to a connected nilpotent subgroup, proper normalizing cosets of definable subgroups are not generous. We explain why this is true and what consequences this has on an abstract theory of Weyl groups in groups of finite Morley rank. The only known infinite simple groups of finite Morley rank are the simple algebraic g...

1. Introduction Why is forcing the only known method for constructing outer models of set theory? If V is a standard transitive model of ZFC, then a standard transitive model W of ZFC is an outer model of V if V ⊆ W and V ∩ OR = W ∩ OR. Is every outer model of a given model a generic extension? At one point Solovay conjectured that if 0 # exists, then every real that does not construct 0 # lies...

0 # can be invisibly class generic. 1. Introduction Roughly, the main theorem of this paper is that some instances of any type of non-constructible object are class generic over L, in one sense. Since small large cardinal properties are inherited in L, let us begin by considering the sense in which 0 # can be generic. It is well known that 0 # is not set generic over L, or, indeed, over any inn...