Alberto Pettorossi, Maurizio Proietti  @ NUS Home/Search
Context Related
| iasi.rm.cnr.it/pub/...DagstuhlInv.ps.gz Cached: PS.gz PS PDF Image Update Help From: iasi.rm.cnr.it/~proiett...reports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We revisit the main techniques of program transformation which are used in partial evaluation, mixed computation, supercompilation, generalized partial computation, rule-based program derivation, program specialization, compiling control, and the like. We present a methodology which underlines these techniques as a `common pattern of reasoning' and explains the various correspondences which can be established among them. This methodology consists of three steps: i) symbolic computation, ii)... (Update)
Context of citations to this paper: More
.... approach is the achievement of the appropriate set of (eureka) definitions which make it possible the optimizations to be pursued [10, 22, 20]. In this paper, we propose a fully automatic tupling algorithm (based on folding unfolding) which uses an incremental eureka...
Cited by: More
A Unifying View of Functional and Logic Program.. - Alpuente, Falaschi, Vidal (1998) (Correct)
The Narrowing-Driven Approach to Functional Logic Program.. - Albert, Vidal (2002) (Correct)
Specialization of Functional Logic Programs Based on.. - Alpuente, Hanus.. (1999) (Correct)
Active bibliography (related documents): More All
1.8: Transformation of Logic Programs - Pettorossi, Proietti (1998) (Correct)
1.2: Automatic Derivation of Logic Programs by Transformation - Pettorossi, Proietti (2000) (Correct)
0.8: Rules and Strategies for Transforming Functional and Logic.. - Pettorossi, Proietti (1996) (Correct)
Similar documents based on text: More All
0.8: Program Derivation = Rules + Strategies - Pettorossi, Proietti (2001) (Correct)
0.7: Derivation of Efficient Logic Programs by.. - Pettorossi, Proietti, .. (2002) (Correct)
0.6: Transformation Rules For A Higher Order Logic Programming.. - Pettorossi, Proietti (2000) (Correct)
Related documents from co-citation: More All
13: A transformation system for developing recursive programs - Burstall, Darlington - 1977
11: Tutorial on specialisation of logic programs (context) - Gallagher - 1993
11: Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
BibTeX entry: (Update)
PETTOROSSI, A., AND PROIETTI, M. A comparative revisitation of some program transformation techniques. In Danvy et al. [7], pp. 355--385. http://citeseer.comp.nus.edu.sg/119445.html More
@misc{ pettorossi-comparative,
author = "A. PETTOROSSI and M. PROIETTI",
title = "A comparative revisitation of some program transformation techniques",
text = "PETTOROSSI, A., AND PROIETTI, M. A comparative revisitation of some program
transformation techniques. In Danvy et al. [7], pp. 355--385.",
url = "citeseer.comp.nus.edu.sg/119445.html" }
Citations (may not include all citations):815 Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
324 Deforestation: Transforming programs to eliminate trees - Wadler - 1988
224 Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
206 Tutorial notes on partial evaluation (context) - Consel, Danvy - 1993
139 fold transformation of logic programs (context) - Tamaki, Sato - 1984
129 Transformation of logic programs: Foundations and techniques (context) - Pettorossi, Proietti - 1994
98 Mix: A self-applicable partial evaluator for experiments in .. (context) - Jones, Sestoft et al. - 1989
81 The promotion and accumulation strategies in transformationa.. (context) - Bird - 1984
80 Fast and precise regular approximation of logic programs and.. - Gallagher, de Waal - 1994
64 Tabulation techniques for recursive programs (context) - Bird - 1980
64 Communications of the ACM (context) - Kowalski, Logic - 1979
57 The concept of a supercompiler (context) - Turchin - 1986
55 Safe fusion of functional expressions (context) - Chin - 1992
48 A general framework for semantics-based bottom-up abstract i.. - Barbuti, Giacobazzi et al. - 1993
44 The derivation of an algorithm for program specialisation (context) - Gallagher, Bruynooghe - 1991
43 Denotational abstract interpretation of logic programs (context) - Marriott, Sondergaard et al. - 1994
38 A general criterion for avoiding infinite unfolding during p.. (context) - Bruynooghe, De Schreye et al. - 1992
38 Partial deduction and driving are equivalent - Gluck, Sorensen - 1994
35 ACM Transactions on Programming Languages and Systems (context) - Paige, Koenig et al. - 1982
33 A survey and classification of some program transformation t.. (context) - Feather - 1987
30 An algorithm of generalization in positive supercompilation (context) - Sorensen, Gluck - 1995
28 Automatic binding time analysis for a typed - calculus (context) - Nielson, Nielson - 1988
27 Mixed computation: Potential applications and problems for s.. (context) - Ershov - 1982
26 Polyvariant mixed computation for analyzer programs (context) - Bulyonkov - 1984
25 Program improvement by internal specialization (context) - Scherlis - 1981
24 The loop absorption and the generalization strategies for th.. (context) - Proietti, Pettorossi - 1993
23 Essence of generalized partial computation (context) - Futamura, Nogi et al. - 1991
21 Ecological partial deduction: Preserving characteristic tree.. - Leuschel - 1996
20 Symbolic finite differencing - Part (context) - Paige - 1990
20 Lecture Notes in Computer Science (context) - Naish, Control
19 Synthesis of eureka predicates for developing logic programs (context) - Proietti, Pettorossi - 1990
19 Program transformation with metasystem transitions (context) - Turchin - 1993
18 Towards unifying partial evaluation (context) - Sorensen, Gluck et al. - 1994
17 Journal of Logic Programming (context) - Bruynooghe, De Schreye et al. - 1989
16 Some techniques for recursion removal from recursive functio.. (context) - Arsac, Kodratoff - 1982
15 Tutorial on specialization of logic programs (context) - Gallagher - 1993
14 A powerful strategy for deriving efficient programs by trans.. (context) - Pettorossi - 1984
12 The use of metasystem transition in theorem proving and prog.. (context) - Turchin - 1980
12 the partial computation principle (context) - Ershov - 1977
12 Synthesis of programs from unfold/fold proofs (context) - Proietti, Pettorossi
11 Rules and strategies for program transformation (context) - Pettorossi, Proietti - 1993
10 the mechanics of metasystem hierarchies in program transform.. (context) - Gluck - 1996
8 An experimental program transformation system (context) - Darlington - 1981
6 The lambda abstraction strategy for program derivation (context) - Pettorossi, Skowron - 1989
5 The McCarthy's induction principle: `oldy' but `goody (context) - Kott - 1982
4 How powerful are folding / unfolding transformations (context) - Zhu - 1994
4 Deriving very efficient algorithms for evaluating linear rec.. (context) - Pettorossi, Burstall - 1982
3 Transforming programs by specializing interpreters (context) - Gallagher - 1986
3 Abstract interpretation (context) - Bruynooghe, Boulanger - 1994
2 Special Issue of New Generation Computing: Workshop on Parti.. (context) - Ershov, Bjorner et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.iasi.rm.cnr.it/~proietti/reports.html): More
Program Specialization via Algorithmic Unfold/Fold.. - Pettorossi, Proietti (1998) (Correct)
Developing Correct and Efficient Logic Programs by.. - Pettorossi, Proietti (1996) (Correct)
Future Directions in Program Transformation - Pettorossi, Proietti (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.