Program specialization via algorithmic unfold/fold transformations

Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.

[1]  John W. Lloyd,et al.  Partial Evaluation in Logic Programming , 1991, J. Log. Program..

[2]  Wei-Ngan Chin.  Towards an automated tupling strategy , 1993, PEPM '93.

[3]  Alberto Pettorossi,et al.  Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs , 1995, Theor. Comput. Sci..

[4]  Philip Wadler,et al.  Deforestation: Transforming Programs to Eliminate Trees , 1988, Theoretical Computer Science.

[5]  Robert Glück.  On the Mechanics of Metasystem Hierarchies in Program Transformation , 1995, LOPSTR.

[6]  Robert Glück,et al.  A positive supercompiler , 1996, Journal of Functional Programming.

[7]  Alberto Pettorossi,et al.  A Theory of Logic Program Specialization and Generalization for Dealing with Input Data Properties , 1996, Dagstuhl Seminar on Partial Evaluation.

[8]  Michael Maher.  A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration , 1996 .

[9]  Andrei P. Ershov,et al.  Mixed Computation: Potential Applications and Problems for Study , 1982, Theor. Comput. Sci..

[10]  Alberto Pettorossi,et al.  Transformation of Logic Programs: Foundations and Techniques , 1994, J. Log. Program..

[11]  Hisao Tamaki,et al.  Unfold/Fold Transformation of Logic Programs , 1984, ICLP.

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

[13]  Charles Consel,et al.  Program adaptation based on program transformation , 1997, SIGP.

[14]  Akihiko Takano.  Generalized partial computation for a lazy functional language , 1991 .

[15]  Siau-Cheng Khoo,et al.  Parameterized partial evaluation , 1991, PLDI '91.

[16]  Philippe Flajolet,et al.  Average-Case Analysis of Algorithms and Data Structures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[17]  Valentin F. Turchin,et al.  The Use of Metasystem Transition in Theorem Proving and Program Optimization , 1980, ICALP.

[18]  Alberto Pettorossi,et al.  Reducing nondeterminism while specializing logic programs , 1997, POPL '97.

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

[20]  Robert Paige,et al.  Finite Differencing of Computable Expressions , 1982, TOPL.

[21]  Annalisa Bossi,et al.  A method for specializing logic programs , 1990, TOPL.

[22]  Helmuth Partsch,et al.  Specification and Transformation of Programs - A Formal Approach to Software Development , 1990, Texts and Monographs in Computer Science.

[23]  Mitchell Wand,et al.  Continuation-Based Program Transformation Strategies , 1980, JACM.

[24]  Jan Komorowski,et al.  Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of prolog , 1982, POPL '82.

[25]  Valentin F. Turchin,et al.  The concept of a supercompiler , 1986, TOPL.

[26]  John Darlington,et al.  A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[27]  Helmut A. Partsch,et al.  Specification and transformation of programs , 1990 .

[28]  Akihiko Takano,et al.  Generalized partial computation for a lazy functional language , 1991, PEPM '91.