This paper presents genericity in an historical fashion, by rst explaining how it is commonly presented intuitively, then by showing how this intuitive way, while convenient from a training point of view, is limited and can be extended signiicantly if completed using a more formal framework. The current implementation of param-eterized classes in the YAFL programming language 1] is then describ...

This paper proposes an integrated theory of tense, aspect and genericity building on the work of Moens (1987) for tense and aspect in English. I start by motivating the treatment of tense and genericity at the same level, by showing that (1) it is the same linguistic system that is at work in both cases; (2) there are some facts of language that only receive an adequate explanation if the two p...

Recently, generic programming becomes of a major interest in several programming paradigms. A recurrent idea to achieve genericity is to specify algorithms on their convenient data structure, and to allow these speciications to be instantiated onto a large number of neighboring data structures. Polytypic programming, shapely types and generic attribute grammars are generic programming methods r...

We show that, for any compact surface, there is a residual (dense Gδ) set of C 1 area preserving diffeomorphisms which either are Anosov or have zero Lyapunov exponents a.e. This result was announced by R. Mañé, but no proof was available. We also show that for any fixed ergodic dynamical system over a compact space, there is a residual set of continuous SL(2, R)-cocycles which either are unifo...

A number of proposals have been made as to how Java can be changed to support parameterized types. We present a new proposal that does not try to provide more powerful constructs or cleaner semantics, but instead minimizes the changes that need to be made to existing Java compilers. In particular, we found that changing only one method in Sun's Java compiler already results in a reasonable impl...

Avigad introduced the notion of UD-randomness based in Weyl’s 1916 definition of uniform distribution modulo one. We prove that there exists a weakly 1-random real that is neither UD-random nor weakly 1-generic. We also show that no 2-generic real can Turing compute a UD-random real. 2000 Mathematics Subject Classification 03D32 (primary); 03D80 (secondary)

We consider several notions of genericity appearing in algebraic geometry and commutative algebra. Special emphasis is put on various stability notions which are defined in a combinatorial manner and for which a number of equivalent algebraic characterisations are provided. It is shown that in characteristic zero the corresponding generic positions can be obtained with a simple deterministic al...

Let M be a smooth manifold and Dm, m > 2, be the set of rank m distributions on M endowed with the Whitney C∞ topology. We show the existence of an open set Om dense in Dm, so that, every nontrivial singular curve of a distribution D of Om is of minimal order and of corank one. In particular, for m > 3, every distribution of Om does not admit nontrivial rigid curves. As a consequence, for gener...

We prove the Green–Lazarsfeld Secant Conjecture [GL1, Conjecture (3.4)] for extremal line bundles on curves of arbitrary gonality, subject to explicit genericity assumptions.