Gluck, Robert, & Jrgensen, Jesper. (1995). E#cient multi-level generating extensions for program specialization. Pages 259--278 of: Hermenegildo, Manuel, & Swierstra, S. Doaitse (eds), Programming languages: Implementations, logics and programs. Springer-Verlag LNCS 982.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... (map f xs) For higher order partially static types consider: stage map3 = map at ( a b ) a list b list fun map3 f [ map3 f (x: xs) f x) map f xs) For staging programs at more than two stages consider an inner product function staged to run in three stages[8, 14]. In the first stage, knowing the size of the two vectors o#ers an opportunity to specialize the inner product function on that size, removing a looping overhead from the body of the function. In the second stage, knowing the first vector o#ers an opportunity for specialization based on the values ....

....to first order functions. Many BTAs are based upon abstract analysis. BTAs for partially static data have been presented by Launchbury[13] and Mogensen[17] and polyvariant BTAs have been presented by Consel [6, 1] Dussart et al. 7] Rytz Gengler [19] amongst others. Glueck and Joregensen [8, 9] pioneered the use of BTA for multi level languages. Their work generalizes a standard abstract interpretation technique to multiple levels. We show that search based techniques can also generalize to multiple levels. The techniques described here incorporate all these features in a simple ....

R. Gluck and J. Jrgensen. E#cient multi-level generating extensions for program specialization. In S. D. Swierstra and M. Hermenegildo, editors, Programming Languages: Implementations, Logics and Programs (PLILP'95), volume 982 of Lecture Notes in Computer Science, pages 259--278. Springer-Verlag, 1995.

....previous treatments in the literature. 1 Introduction The concept of two level languages is at least a decade old [7, 4] and the concept of multi level languages at least four years old [11] In particular two level languages have been used extensively in the development of partial evaluation [1, 3] and abstract interpretation [5, 8] but also in areas such as code generation [9] and processor placement [12] Our goal is to cast further light on the two level # calculi that may be found in the literature. We will show that there is a high degree of commonality in the approach taken: there are ....

....notions independent of the # calculus and on defining parameterised classes of multi level # calculi. Remark about the choice of levels. Perhaps the most obvious generalisation of a notion of two levels is a (possibly finite) interval in Z # #,# (with the elements corresponding to the levels [11, 1]) A somewhat more abstract possibility is to use a general partially ordered set (with the elements corresponding to the levels as is briefly discussed in [11] although a Kripke structure [6] with the worlds corresponding to the levels) would fit just as well. This might suggest that the ....

[Article contains additional citation context not shown here]

R. Gluck and J. Jrgensen: E#cient Multi-level Generating Extensions for Program Specialization. PLILP'95, Springer Lecture Notes in Computer Science, vol. 982: pp. 259--278, 1995.

.... shades of static input. This means that a given program can be optimized with respect to some inputs at an earlier stage, and others at later stages. This modification requires several non obvious extensions of standard partial evaluation techniques, such as multi level generating extensions [8], a generalization of Ershov s (two level) generating extension [6] The main payo# of this novel approach becomes apparent in multiple self application: experimental results show an impressive reduction of generation time and code size compared to previous attempts of multiple self application. ....

....(e.g. compile time vs. run time) flow of function values, and partial type inference are, among others, important for an e#cient implementation and transformation of functional languages. Our work builds on previous work on constraint based analysis [4] and multi level specialization [8]. This paper. After reviewing the concept of multi level generating extensions (Sect. 2) we present the typing rules for multi level programs of a higher order, functional language (Sect. 3) and we introduce three e#cient program analyses based on constraint systems that run almost linear in the ....

[Article contains additional citation context not shown here]

R. Gluck, J. Jrgensen. E#cient multi-level generating extensions for program specialization. In M. Hermenegildo, S. D. Swierstra (eds.) Programming Languages, Implementations, Logics and Programs, LNCS 982, 259--278, Springer-Verlag, 1995.

....so as to be applicable to a much wider class of programming languages. 1 Introduction Two level languages are at least a decade old [9, 6] and multi level languages at least four years old [13] In particular two level languages have been used extensively in the development of partial evaluation [2, 4] and abstract interpretation [7, 10] but also in areas such as code generation [11] and processor placement [14] A main goal of this paper is to cast further light on the two level # calculi that may be found in the literature. We will show that there is a high degree of commonality in the ....

....as is the case in most of the literature. We then consider five systems in detail and formally show that they can be formulated in our present framework. These systems are: a system for code generation [13] a system for partial evaluation [4] a system for multi level partial evaluation [2], a system for abstract interpretation [7] and a system based on modal logic [1] An overview of parts of this development was previously reported in [15] Finally, we pave the way for a much more general theory of multi level languages by presenting definitions that are applicable for ....

[Article contains additional citation context not shown here]

R. Gluck and J. Jørgensen: E#cient Multi-level Generating Extensions for Program Specialization. PLILP'95, Springer Lecture Notes in Computer Science, vol. 982: pp. 259--278, 1995.

No context found.

Gluck, Robert, & Jrgensen, Jesper. (1995). E#cient multi-level generating extensions for program specialization. Pages 259--278 of: Hermenegildo, Manuel, & Swierstra, S. Doaitse (eds), Programming languages: Implementations, logics and programs. Springer-Verlag LNCS 982.

No context found.

R. Gluck and J. Jrgensen. E#cient multi-level generating extensions for program specialization. In Programming Languages: Implementations, Logics and programs (PLILP'95), volume 982 of LNCS, pages 259--278. Springer, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC