This paper is based on the presentation done at seminar Laurent Schwartz in January 2020. It describes and summarizes results given Rational normal forms stability of small solutions to nonlinear Schrödinger equations, see [BFG20a], written with Joackim Bernier Benoît Grébert, published Annals PDE 6, article number: 14 (2020) 65p. We describe here main arguments proof as well general strategy u...

Recent proposals for adding parameterised types to Java have left a number of important practical issues undiscussed. In this paper we present the language Genja which is a new generic extension of Java oriented towards practical support for generic collection types. We discuss design alternatives related to extending the power of unconstrained genericity, solving the weaknesses of constrained ...

Abstract We establish a sufficient condition for continuous map, acting on compact metric space, to have Baire residual set of points exhibiting historic behavior (also known as irregular points). This criterion applies, instance, minimal and non-uniquely ergodic map; maps preserving two distinct probability measures with full support; non-trivial homoclinic classes; some non-uniformly expandin...

This paper illustrates how the diagram programming language DIAPLAN can be used to program visual systems. DIAPLAN is a visual rulebased language that is founded on the computational model of graph transformation. The language supports object-oriented programming since its graphs are hierarchically structured. Typing allows the shape of these graphs to be specified recursively in order to incre...

McAfee and Reny (1992) have given a necessary and sufficient condition for full surplus extraction in naive type spaces with a continuum of payoff types. We generalize their characterization to arbitrary abstract type spaces and to the universal type space and show that in each setting, full surplus extraction is generically possible. We interpret the McAfee-Reny condition as a much stronger ve...

This paper illustrates how the diagram programming language DIAPLAN can be used to program visual systems. DIAPLAN is a visual rulebased language that is founded on the computational model of graph transformation. The language supports object-oriented programming since its graphs are hierarchically structured. Typing allows the shape of these graphs to be specified recursively in order to incre...

Designers are increasingly using VHDL for high-level modeling. However, their task is hindered by the lack of object-oriented and genericity features in the language. Experience in programming languages shows that these features significantly aid management of complexity in large designs and promote re-use of modules. SUAVE extends VHDL by adapting several object-oriented and genericity feature...

We propose a new diagrammatic modeling language, DML. The paradigm used is that of the category theory and in particular of the pushout tool. We show that most of the object-oriented structures can be described with this tool and have many examples in C++, ranging from virtual inheritance and polymorphism to template genericity. With this powerful tool, we propose a quite simple description of ...