Alberto Pettorossi, Maurizio Proietti  @ NUS Home/Search
Context Related
| iasi.rm.cnr.it/pub/proie...mainhb.ps.gz iasi.rm.cnr.it/~proietti...mainhb.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: Program transformation is a methodology for deriving correct and efficient programs from specifications. In this chapter, we will look at the so called 'rules + strategies' approach, and we will report on the main techniques which have been introduced in the literature for that approach, in the case of logic programs. We will also present some examples of program transformation, and we hope that through those examples the reader may acquire some familiarity with the techniques we will describe. (Update)
Context of citations to this paper: More
...have been proposed in the literature for the di erent classes of programs which have been considered. The interested reader may refer to [PeP98] for a survey. We will focus our attention on logic program transformation. This choice is motivated by the fact that in...
...have been proposed in the literature for the di erent classes of programs which have been considered. The interested reader may refer to [PeP98] for a survey. We will focus our attention on logic program transformation. This choice is motivated by the fact that in Correspondence...
Cited by: More
Reasoning About Logic Programs Using Definitions And Induction - Wajs (2002) (Correct)
A Class of Rewriting Rules and Reverse Transformation.. - Akama.. (2001) (Correct)
Correction of Functional Logic Programs - Alpuente, Ballis, Correa, Falaschi (2003) (Correct)
Similar documents (at the sentence level):
9.6%: Automatic Derivation of Logic Programs by Transformation - Pettorossi, Proietti (2000) (Correct)
Active bibliography (related documents): More All
3.4: Rules and Strategies for Transforming Functional and Logic.. - Pettorossi, Proietti (1996) (Correct)
2.0: Developing Correct and Efficient Logic Programs by.. - Pettorossi, Proietti (1996) (Correct)
1.8: A Comparative Revisitation of Some Program Transformation.. - Pettorossi, Proietti (1996) (Correct)
Similar documents based on text: More All
0.5: Program Specialization via Algorithmic Unfold/Fold.. - Pettorossi, Proietti (1998) (Correct)
0.5: Synthesis And Transformation Of Logic Programs Using.. - Pettorossi, Proietti (1999) (Correct)
0.5: The List Introduction Strategy for the Derivation of Logic.. - Pettorossi, Proietti (Correct)
Related documents from co-citation: More All
5: Foundations of Logic Programming (context) - Lloyd - 1987
4: The promotion and accumulation strategies in transformational programming (context) - Bird - 1984
4: A transformation system for developing recursive programs - Burstall, Darlington - 1977
BibTeX entry: (Update)
A. Pettorossi and M. Proietti, Transformation of logic programs. Journal of Logic Programming 19/20:261--320 (1994) http://citeseer.comp.nus.edu.sg/166605.html More
@misc{ pettorossi94transformation,
author = "A. Pettorossi and M. Proietti",
title = "Transformation of logic programs",
text = "A. Pettorossi and M. Proietti, Transformation of logic programs. Journal
of Logic Programming 19/20:261--320 (1994)",
year = "1994",
url = "citeseer.comp.nus.edu.sg/166605.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
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
395 An abstract Prolog instruction set (context) - Warren - 1983
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
343 Introduction to Metamathematics (context) - Kleene - 1971
324 Deforestation: Transforming programs to eliminate trees - Wadler - 1990
248 The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
229 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967
224 Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
174 A Kripke-Kleene semantics for logic programs (context) - Fitting - 1985
146 Introduction to logic programming (context) - Apt - 1990
139 fold transformation of logic programs (context) - Tamaki, Sato - 1984
129 Transformation of logic programs: Foundations and techniques (context) - Pettorossi, Proietti - 1994
121 Proving and applying program transformations expressed with .. (context) - Huet, Lang - 1978
118 Unfounded sets and well-founded semantics for general logic .. (context) - Van Gelder, Ross et al. - 1989
112 Partial evaluation of computation process -- an approach to .. - Futamura - 1971
99 A classification theory of semantics of normal logic program.. - Dix - 1995
82 Signed data dependencies in logic programs (context) - Kunen - 1989
81 The promotion and accumulation strategies in transformationa.. (context) - Bird - 1984
79 Logic Programming: Systematic Program Development (context) - Deville - 1990
74 Memo functions and machine learning (context) - Michie - 1968
64 Communications of the ACM (context) - Kowalski, Logic - 1979
58 Memoing for logic programs (context) - Warren - 1992
58 Inductive assertion method for logic programs - Drabent, Ma - 1988
57 The concept of a supercompiler (context) - Turchin - 1986
54 the declarative semantics of stratified deductive databases .. (context) - Przymusinsky - 1987
54 Rules and strategies for transforming functional and logic p.. - Pettorossi, Proietti - 1996
51 Automatic mode inference for logic programs - Debray, Warren - 1988
50 Derivation of logic programs (context) - Hogger - 1981
49 Denotational and operational semantics for Prolog - Debray, Mishra - 1988
48 Stepwise development of operational and denotational semanti.. (context) - Jones, Mycroft - 1984
47 Continuation-based program transformation strategies (context) - Wand - 1980
47 An Automatic Partial Evaluator for Full Prolog - Sahlin - 1991
46 Mixtus: An automatic partial evaluator for full Prolog (context) - Sahlin - 1993
46 Query evaluation in recursive data bases: Bottom-up and top-.. (context) - Bry - 1989
44 The derivation of an algorithm for program specialisation (context) - Gallagher, Bruynooghe - 1991
43 Data Structures = Programs (context) - Wirth - 1976
42 Verifying correctness of logic programs (context) - Bossi, Cocco - 1989
39 Partial evaluation as a means for inferencing data structure.. (context) - Komorowski - 1982
38 Applying techniques to skeletons - Sterling, Kirschenbaum - 1993
38 A general criterion for avoiding infinite unfolding during p.. (context) - Bruynooghe, De Schreye et al. - 1992
38 Loop checking in partial deduction (context) - Bol - 1993
36 Schemabased transformations of logic programs - Fuchs, Fromherz - 1992
35 Specification and Transformation of Programs (context) - Partsch - 1990
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
32 ACM Transactions on Programming Languages and Systems (context) - Bossi, Cocco et al. - 1990
32 Deduction revision by intelligent backtracking (context) - Bruynooghe, Pereira - 1984
32 ACM Transactions on Programming Languages and Systems (context) - Bossi, Etalle et al. - 1994
32 A transformation system for deductive database modules with .. (context) - Maher - 1993
30 Unfoldingdefinition -folding (context) - Proietti, Pettorossi - 1995
28 A Self-Applicable Partial Evaluator for the Logic Programmin.. (context) - Gurr - 1993
28 fold transformation of stratified programs (context) - Seki - 1991
28 A first order theory of data and programs (context) - Clark, Tarnlund - 1977
28 Logic program synthesis - Deville, Lau - 1994
28 Logimix: A self-applicable partial evaluator for Prolog (context) - Mogensen, Bondorf - 1993
27 A synthesis of several sorting algorithms (context) - Darlington - 1978
26 Logic program synthesis from incomplete specifications - Flener, Deville - 1993
26 A partial evaluation procedure for logic programs (context) - Benkerimi, Lloyd - 1990
26 Correctness of a logic program transformation system (context) - Maher - 1987
25 Program improvement by internal specialization (context) - Scherlis - 1981
25 Basic transformation operations which preserve computed answ.. (context) - Bossi, Cocco - 1993
24 Preservation of stronger equivalence in unfold/fold logic pr.. (context) - Kawamura, Kanamori - 1990
24 fold transformations of logic programs (context) - Gardner, Shepherdson - 1991
24 The loop absorption and the generalization strategies for th.. (context) - Proietti, Pettorossi - 1993
23 Sound and complete partial deduction with unfolding based on.. (context) - Martens, De Schreye et al. - 1992
23 Transforming constraint logic programs (context) - Bensaou, Guessarian - 1994
23 Semantics preserving transformation rules for Prolog (context) - Proietti, Pettorossi - 1991
22 Preserving universal termination through unfold/fold (context) - Bossi, Cocco - 1994
21 fold transformation of general logic programs for well-found.. (context) - Seki - 1993
21 Comparative schematology (context) - Paterson, Hewitt - 1970
21 Elementary logic programs (context) - Tarau, Boyer - 1990
20 Meta interpreters for real (context) - Safra, Shapiro - 1986
20 fold transformation of normal and extended logic programs (context) - Aravindan, Dung et al. - 1995
20 Lecture Notes in Computer Science (context) - Naish, Control - 1985
20 An equivalence preserving first order unfold/fold transforma.. (context) - Sato - 1992
19 Composing Prolog meta-interpreters (context) - Sterling, Lakhotia - 1988
19 Functional computations in logic programs - Debray, Warren - 1989
19 Supporting transformations for the partial evaluation of log.. (context) - Benkerimi, Hill - 1993
19 Proving theorems about Lisp functions - Boyer, Moore - 1975
19 Online partial deduction of large programs (context) - Prestwich - 1993
19 Proving termination properties of Prolog programs: A semanti.. (context) - Baudinet - 1992
18 solvable cases of determinacy and their application to Prolo.. (context) - Sawamura, Takeshima et al. - 1985
18 Comparison of abstract interpretations (context) - Cortesi, Fil'e et al. - 1992
17 fold transformations and loop optimization of logic programs (context) - Debray - 1988
17 Journal of Logic Programming (context) - Bruynooghe, De Schreye et al. - 1989
16 Transforming normal programs by replacement (context) - Bossi, Cocco et al. - 1992
16 The memory management of Prolog implementations (context) - Bruynooghe - 1982
16 Some techniques for recursion removal from recursive functio.. (context) - Arsac, Kodratoff - 1982
15 A system for assisting program transformation (context) - Feather - 1982
15 Tutorial on specialization of logic programs (context) - Gallagher - 1993
15 Transformation rules for GHC programs - Ueda, Furukawa - 1988
14 Predicate logic: A calculus for deriving programs (context) - Clark, Sickel - 1977
14 A generalized correctness proof of the unfold/fold logic pro.. (context) - Tamaki, Sato - 1986
14 Skeletons and techniques for Prolog programming (context) - Kirschenbaum, Lakhotia et al. - 1989
13 Program transformation by data structure mapping (context) - Hansson, Tarnlund - 1982
13 About transformation system: A theoretical study (context) - Kott - 1978
12 the partial computation principle (context) - Ershov - 1977
12 Synthesis of programs from unfold/fold proofs (context) - Proietti, Pettorossi - 1994
12 Compiling associativity into logic programs (context) - Brough, Hogger - 1987
12 Grammarrelated transformations of logic programs (context) - Brough, Hogger - 1991
12 fold transformations of logic programs using extended OLDT-b.. (context) - Boulanger, Bruynooghe - 1993
12 An unfold rule for full Prolog (context) - Prestwich - 1993
11 An algorithm for partial evaluation with constraints (context) - Fujita - 1987
11 Notes on transformation techniques for generate and test log.. (context) - Seki, Furukawa - 1987
11 Optimizing almost-tail-recursive Prolog programs (context) - Debray - 1985
11 A self-applicable partial evaluator and its use in increment.. (context) - Fujita, Furukawa - 1988
11 A Semantic Approach to Automatic Program Improvement (context) - Darlington - 1972
10 Towards the partial evaluation of CLP languages (context) - Hickey, Smith - 1991
10 A technique for doing lazy evaluation in logic (context) - Narain - 1986
10 A transformation system for definite programs based on termi.. - Cook, Gallagher - 1994
10 Transformation of programs and use of tupling strategy (context) - Pettorossi - 1977
10 A comparative study of the well-founded and the stable model.. (context) - Seki - 1990
9 Construction of logic programs based on generalized unfold/f.. (context) - Kanamori, Horiuchi - 1987
9 Some transformations for developing recursive programs (context) - Burstall, Darlington - 1975
9 fold transformation of logic programs with counters (context) - Kanamori, Fujita - 1986
8 An experimental program transformation system (context) - Darlington - 1981
8 Generalization and program schemata (context) - Deville, Burnay - 1989
8 Affinity between meta-interpreters and partial evaluation (context) - Takeuchi - 1986
7 fold transformations preserving termination properties (context) - Amtoft - 1992
7 the transformation of a Prolog program to a more efficient b.. (context) - Demoen - 1993
7 Characterization of flowchartable recursions (context) - Walker, Strong - 1972
7 On safe folding (context) - Bossi, Cocco et al. - 1992
7 Source-to-source transformations of logic programs (context) - Bloch - 1984
6 An automatic difference -list transformation algorithm for P.. (context) - Zhang, Grant - 1988
6 Modular transformations of CLP programs (context) - Etalle, Gabbrielli - 1996
6 Spes: A system for logic program transformation (context) - Alexandre, Bsaies et al. - 1992
5 Issues in the partial evaluation of meta-interpreters (context) - Owen - 1989
5 The McCarthy's induction principle: `oldy' but `goody (context) - Kott - 1982
5 Partial evaluation of the real thing - Leuschel - 1994
4 Proof methods of declarative properties of logic programs (context) - Deransart - 1989
4 Negation and control in automatically generated logic progra.. (context) - Wiggins - 1992
4 Difference -list transformation for Prolog (context) - Marriot, Sondergaard - 1993
4 Specialization of Prolog Programs with Partially Static Goal.. (context) - Neumerkel - 1993
4 Decidability results and characterization of strategies for .. (context) - Pettorossi, Proietti - 1989
3 Transforming programs by specializing interpreters (context) - Gallagher - 1986
3 Reasoning about stable models (context) - Maher - 1990
3 Schema -based tod-down design of logic programs using abstra.. (context) - Marakakis, Gallagher - 1994
3 A system for specializing logic programs (context) - Gallagher - 1991
3 Partial evaluation of queries in deductive databases (context) - Sakama, Itoh - 1988
3 Specialization of Prolog and FCP programs using abstract int.. (context) - Gallagher, Codish et al. - 1988
3 Special Issue of the Journal of Logic Programming on Abstrac.. (context) - Debray - 1992
2 Using annotations to make recursive equations behave (context) - Schwarz - 1982
2 Deterministic transformation and deterministic synthesis (context) - Sato, Tamaki - 1988
2 Mixed computation of Prolog programs (context) - Fuller, Abramsky - 1988
2 Special Issue of New Generation Computing: Workshop on Parti.. (context) - Ershov, Bjorner et al. - 1988
2 Compiling bottom-up and mixed derivations into top- Transfor.. (context) - De Schreye, Martens et al. - 1991
2 Specialization of a unification algorithm (context) - de Waal, Gallagher - 1992
1 Partial Transformation of Logic Programs 91 evaluation of Pr.. (context) - Takeuchi, Furukawa - 1986
1 Partial evaluation of the real thing and its application to .. (context) - Leuschel
1 eme pour la transformation automatique de programmes Prolog .. (context) - Azibi, Un - 1987
1 Static analysis for the synthesis of eureka properties for t.. (context) - Bsaies - 1992
1 Synthesis of Transformation of Logic Programs 89 eureka pred.. (context) - Proietti, Pettorossi - 1990
1 the transformation of logic programs with instantiation base.. (context) - De Schreye, Bruynooghe - 1989
1 Mathematical Structures in Computer Science (context) - Shepherdson, fold et al. - 1992
1 Meta-programming for reordering literals in deductive databa.. (context) - Traff, Prestwich - 1992
1 A Prolog meta-interpretation for partial evaluation and its .. (context) - Venken - 1984
1 Transformation of Logic Programs (context) - Kunen, logic et al. - 1987
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.