1998 symposium on partial evaluation

The problem with this one-liner is that unless the compiler displays some intelligence, the analysis of the control string “%s is not %s” happens at run time. We can very precisely quantify the intelligence that is required here: the compiler should specialize the library function fprintf with respect to the control string, in effect transforming the one-liner above into the original three lines. Such a specialization is what partial evaluation is all about. Literals offer a rich source of opportunities for program specialization, one that can be fueled, for example, with runtime case analyses over compile-time constants—a favorite programming technique among partial-evaluation practitioners. Many other opportunities, of course, exist, such as relatively short-lived runtime invariants, which enable specialization through runtime code generation, and successive (and possibly related) invariants, which link partial evaluation with incremental computation. The goal of partial evaluation is thus to specialize programs with respect to any kind of invariant, at any stage of their development. Several articles in this symposium illustrate this goal. The partial-evaluation community is developing various specialization techniques across programming-language paradigms: imperative, object-oriented, functional, logical, etc. We are further-

[1]  Semantics-Based Program Manipulation.  Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation : PEPM'95, La Jolla, California, June 21-23, 1995 , 1995 .

[2]  Alberto Pettorossi,et al.  Program specialization via algorithmic unfold/fold transformations , 1998, CSUR.

[3]  R. Kent Dybvig,et al.  Visualizing partial evaluation , 1998, CSUR.

[4]  Evelina Lamma,et al.  Optimizing modular logic languages , 1998, CSUR.

[5]  Scott Draves.  Partial evaluation for media processing , 1998, CSUR.

[6]  도경구,et al.  Partial Evaluation , 1998, Lecture Notes in Computer Science.

[7]  Dines Bjørner,et al.  Partial Evaluation and Mixed Computation , 1987 .

[8]  Charles Consel,et al.  Partial evaluation for software engineering , 1998, CSUR.

[9]  Andrei V. Klimov.  Program specialization vs. program composition , 1998, CSUR.

[10]  Akihiko Takano,et al.  Program transformation in calculational form , 1998, CSUR.

[11]  Charles Consel,et al.  Tempo: specializing systems applications and beyond , 1998, CSUR.

[12]  Danny De Schreye,et al.  Some achievements and prospects in partial deduction , 1998, CSUR.

[13]  Torben Æ. Mogensen,et al.  Partial Evaluation. Practice and Theory: DIKU 1998 International Summer School, Copenhagen, Denmark, June 29 - July 10, 1998 , 1998 .

[14]  John P. Gallagher,et al.  Extending the power of automatic constraint-based partial evaluators , 1998, CSUR.

[15]  Matthew B. Dwyer,et al.  Using partial evaluation to enable verification of concurrent software , 1998, CSUR.

[16]  Sandrine Blazy,et al.  Partial evaluation for program comprehension , 1998, CSUR.

[17]  John Hatcliff.  Foundations for partial evaluation of functional programs with computational effects , 1998, CSUR.

[18]  Dines Bjørner,et al.  Partial Evaluation and Mixed Computation: Proceedings of the IFIP TC2 Workshop, Gammel Avernaes, Denmark, 18-24 Oct., 1987 , 1988 .

[19]  T. B. Dinesh,et al.  Equations as a uniform framework for partial evaluation and abstract interpretation , 1998, CSUR.

[20]  John P. Gallagher,et al.  Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation , 1991 .

[21]  Michael Leuschel,et al.  Extending partial deduction to tabled execution: some results and open issues , 1998, CSUR.

[22]  Olivier Danvy,et al.  Tutorial notes on partial evaluation , 1993, POPL '93.

[23]  John P. Gallagher,et al.  Tutorial on specialisation of logic programs , 1993, PEPM '93.

[24]  Peter Lee,et al.  Dynamic specialization in the Fabius system , 1998, CSUR.

[25]  Sandro Etalle,et al.  Partial evaluation of concurrent constraint languages , 1998, CSUR.

[26]  Semantics-Based Program Manipulation.  Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '97), Amsterdam, The Netherlands, June 12-13, 1997 , 1997, PEPM.

[27]  共立出版株式会社.  コンピュータ・サイエンス : ACM computing surveys , 1978 .

[28]  David A. Basin,et al.  Logical framework based program development , 1998, CSUR.

[29]  María Alpuente,et al.  A unifying view of functional and logic program specialization , 1998, CSUR.

[30]  Roland N. Bol,et al.  Loop checking in partial deduction , 1993, J. Log. Program..

[31]  Peter Lee,et al.  Modal types as staging specifications for run-time code generation , 1998, CSUR.

[32]  Peter Sestoft,et al.  Partial evaluation and automatic program generation , 1993, Prentice Hall international series in computer science.

[33]  Semantics-Based Program Manipulation,et al.  Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'93, Copenhagen, Denmark, June 14-16, 1993 , 1993, PEPM.

[34]  Torben Æ. Mogensen.  Inherited limits , 1998, CSUR.