• Aucun résultat trouvé

Simple optimizing JIT compilation of higher-order dynamic programming languages

N/A
N/A
Protected

Academic year: 2021

Partager "Simple optimizing JIT compilation of higher-order dynamic programming languages"

Copied!
183
0
0

Texte intégral

Figure

Fig. 1.1. Typical Scheme code expansion including type dispatches for a compiler supporting fixnums and flonums.
Fig. 1.2. Typical control flow graph generated by a compiler for the function abs .
Fig. 1.4. Compilation state after the whole function is generated for a call with a negative fixnum.
Fig. 1.5. Compilation state after the whole function is generated for a call with a negative fixnum and a positive flonum.
+7

Références

Documents relatifs

How to build normal higher-order reduction orderings from higher-order reduc- tion orderings is our second contribution, that we illustrate with the case of the higher-order

In the figure we define ground values v (just data, no term variables), ground types τ (no free type variables), ground datatypes (no free type variables or parameters), and blocks

Using higher order adjoints to accelerate the solution of UQ problems with random fields.. Hale, Paul Hauseux,

space-time hierarchical radiosity method : first, we have modified the algorithm so that it uses higher order wavelets for the time dimension, to improve the temporal continu- ity

demande à la Commission et aux États membres de lutter contre la pauvreté des travailleurs qui touche les jeunes; demande à la Commission et aux États membres de prendre des

While the first tendency leads to a severe limitation of programmers’ possibilities and to a uniformization of “personal” softwares restricted to “macro-softwares”, the needs of

After two decades of development, electrospinning, as a powerful technique to produce nanofibers with a diameter in the range from tens of nanometer to micrometers, has gained a

There has been several proposals to address the problem of out-of-order execution of predicated instructions [11, 5], but they do not consider the interaction that exists between