O. Danvy, R. Gl#ck, and P. Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....requiring no human interaction. In the following we use the term automatic mostly with the meaning of point 6. This paper s goal is automatically to perform the annotations that will ensure termination of program specialization. 2 Partial evaluation and program generation Partial evaluation [15, 20, 41, 35, 51] is an example of automatic program transformation. While speedups are more limited than sometimes realizable by hand transformations based on deep problem or algorithmic knowledge, the technology is well automated. It has already proven its utility in several di erent contexts: Scienti c ....

Olivier Danvy, Robert Gluck, and Peter Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

.... which would be inconcievable, or at least unimplementable, without the language and techniques developed by the theory community: Partial evaluation: Partial evaluation is the process of automatically specializing general purpose programs to take advantage of partial knowledge of their inputs [27, 12]. This is a powerful technique which has been successfully applied to produce compilers from interpreters and to speed up applications ranging from aircraft crew planning to ray tracing and pattern matching. The basic idea comes from classical recursion theory Kleene s s m n theorem and ....

O. Danvy, R. Gluck, and P. Thiemann. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

....19. aux (X; X;Ys ; Ys) 20. aux (Q; X; XjYs ] Ys) Q 6=X 2 3.3 Program Specialization The goal of program specialization [88] is the automatic adaptation of a generic program to a speci c context of use. We will present here two techniques for program specialization: 1) partial evaluation [88, 44] and (2) an enhancement of partial evaluation for reducing nondeterminism while specializing logic programs [120] The structure of the two techniques is similar, but the second one uses more powerful transformation rules and strategies. 3.3.1 Partial Evaluation Partial evaluation is a well ....

O. Danvy, R. Glck, and P. Thiemann, editors. Partial Evaluation. International Seminar, Dagstuhl Castle, Germany, February 1996, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

....applying a program transformer to another program transformer not just to an ordinary program has 2 level 0 : p0 : level 1 : p1 : level n Gamma 1 : pn Gamma1 : level n : pn : Fig. 1. MST Scheme of a metasystem hierarchy been put to good use in the area of program specialization [16, 7] (a notable example are the Futamura projections) Common to these approaches is the construction and manipulation of two or more program levels. A metasystem hierarchy is any situation where a program p 0 is manipulating (e.g. interpreting, transforming) another program p 1 . Program p 1 may be ....

O. Danvy, R. Gluck, and P. Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

....program specialization, program composition, and the transformation of programs at run time. Program Specialization provides means to tailor generic and highly parameterized components to specific needs and applications. One of the best developed specialization techniques is partial evaluation [1, 8, 20]. An extensive theory and literature on specialization and code generation was developed in this field. An important discovery was that the concept of generating extensions [12] unifies a wide class of apparently different program generators. Examples include parsing, translation, theorem ....

O. Danvy, R. Gluck, and P. Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

....Self applicable partial evaluation for pi calculus Marc Gengler Matthieu Martel y February 1996 1 Introduction Partial evaluation is an optimization technique which consists of specializing programs with respect to the known part of their inputs. Considerable work has been done in this area [1], however, most of the research has focused on sequential functional or imperative languages. In this paper we are interested in partial evaluation for calculus [6] a language which models concurrent as well as object oriented languages. Even though one can expect great improvements from partial ....

....Equation (3) it is obvious that the choice is only made between static messages. This leads to the following encoding function b:c in which reserved channels r; s; t; u; v; w are used instead of a : e: b0; 0 c = rstuvw) 0 [rstuvw] r: bP 1 kP 2 ; 0 c = rstuvw) 0 [rstuvw] s: 1 2 ) 0 [ 1 2 ]: bP 1 ; 1 ckbP 2 ; 2 c) b P; 0 c = rstuvw) 0 [rstuvw] t: fl) 0 [ bP; c) b(x)P; 0 c = rstuvw) 0 [rstuvw] u: x) 0 [x] bP; c As indicated, two cases have to be distinguished when encoding communications: b P n i=1 i :P i ; 0 c = rstuvw) 0 [rstuvw] v: 1 : n ) 0 [ 1 : n ff ....

[Article contains additional citation context not shown here]

Olivier Danvy, Robert Gluck, and Peter Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

No context found.

O. Danvy, R. Gl#ck, and P. Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

No context found.

O. Danvy, R. Gl#ck, and P. Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

....software reuse. ffl Larger Perspectives: We also wanted to critically assess state of the art techniques, summarize new approaches and insights, and survey challenging problems. The Proceedings All participants were invited to submit a full paper of their contribution for a proceedings volume [7]. The submitted papers have been reviewed with outside assistance and each paper read by at least three referees. Technical quality, significance, and originality were the primary criteria for selection. The selected papers cover a wide and representative spectrum of topics and document ....

O. Danvy, R. Gluck, and P. Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science, Dagstuhl, Germany, Feb. 1996. Springer Verlag, Heidelberg.

No context found.

O. Danvy, R. Gluck, and P. Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science, Dagstuhl, Germany, Feb. 1996. Springer Verlag, Heidelberg.

No context found.

O. Danvy, R. Gluck, and Peter Thiemann. Partial Evaluation. Dagstuhl castle, Germany, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

No context found.

O. Danvy, R. Gluck, and P. Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

No context found.

O. Danvy, R. Gluck, and P. Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

No context found.

O. Danvy, R. Gluck, and P. Thiemann, editors. Partial Evaluation, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

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