Rhéologie et déformation de la lithosphère continentale : apports de mesures GPS en Asie et de modèles numériques

In this work, we study the current kinematic of Mongolia, in the northern part of Asia and the dynamics of the deformation in Mongolia and Asia. First, we present the 1994-2002 Mongolia-Baikal GPS velocity fields (-50 sites) with respect to Eurasia. Velocities show that 15% of th IN/EU convergence is accommodated north of the Tien Shan by NS shortening and dextral shear in the Altay mountains and by E-SE displacement of central and eastern Mongolia at 3-6mm/yr. Our results suggest that the Eward motion in Asia could be controlled by other processes then the IN/EU convergence such as the dynamic of the oceanic subduction zone of the gravitational potential energy gradient. Then starting with the large Mongolian EQ of the last century and the GPS velocities, we model the postseismic deformation (current viscoelastic relaxation < 2 mm/an) and estimate he lithosphere rheology under Mongolia (weak upper mantle and lower crust). Next, with a study on viscoelastic and static stress transfer, we suggest that significant stress transfer is possible among continental faults separated by 100s of km and on time scales of decades. Finally, we validate dynamic deformation models of Asia With a GPS velocity field covering most of Asia. We estimate the average lithosphere rheology and quantify the different mechanisms of deformation. We show that the IN/EU collision is the major contribution to the Asian deformation. However, the deformation in north and East Asia is also controlled by the body forces and the dynamic of the oceanic subduction zone. In the first part, we define a new programming language with a functional core and generalized recursion, by using Boudol’s type system with degrees to rule out unsafe recursions. The language is extended first with recursive records, then with mixins, allowing the programmer to fully mix functional and object-oriented paradigms. We also present an implementation, MlObj, and an abstract machine for execution. In a second part, we design a new inference algorithm for intersection type systems, on an extension of the lambda-calculus. After proving its correctness, we study its generalisation to references and recursion, we compare it with existing inference algorithms, mainly System l, and we show that its finite rank version becomes decidable. Our results suggest that the current deformation is mostly continuous but this last point should be confirmed by further measurements.