Alberto Pettorossi, Maurizio Proietti  @ NUS Home/Search
Context Related
| iasi.rm.cnr.it/pub/proie...popl97.ps.gz sop.inria.fr/oasis...rossipopl97.ps.gz Cached: PS.gz PS PDF Image Update Help From: iasi.rm.cnr.it/~renault/Papers... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Program specialization is a collection of program transformation techniques for improving program efficiency by exploiting some information available at compiletime about the input data. We show that current techniques for program specialization based on partial evaluation do not perform well on nondeterministic logic programs. We then consider a set of transformation rules which extend the ones used for partial evaluation, and we propose a strategy to direct the application of these extended... (Update)
Context of citations to this paper: More
...based on program invariants. These methods, in fact, are presented in a very di erent framework. This paper is an improved version of [34]. 47 Appendix A. Proof of Theorem 6 For the reader s convenience, we rewrite the statement of Theorem 6. a transformation sequence...
...sense that an atom with non variable arguments may be uni able with the head of several clauses. We can apply the technique presented in [18] for deriving deterministic programs thereby reducing the number of heads which are uni able at each unfolding step. When the unfold...
Cited by: More
Combining Logic Programs and Monadic Second Order.. - Fioravanti.. (Correct)
Transformation Rules for Locally Stratified.. - Fioravanti.. (2004) (Correct)
Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (Correct)
Active bibliography (related documents): More All
0.4: Developing Correct and Efficient Logic Programs by.. - Pettorossi, Proietti (1996) (Correct)
0.3: Enhancing Partial Deduction via Unfold/Fold Rules - Pettorossi, Proietti, Renault (1996) (Correct)
0.3: Transformation of Logic Programs - Pettorossi, Proietti (1998) (Correct)
Similar documents based on text: More All
1.7: Derivation of Efficient Logic Programs by.. - Pettorossi, Proietti, .. (2002) (Correct)
0.8: A Specialization Technique for Deriving.. - Fioravanti.. (Correct)
0.7: Specialization with Clause Splitting for Deriving.. - Fioravanti.. (2002) (Correct)
Related documents from co-citation: More All
22: Foundations of Logic Programming (context) - Lloyd - 1987
16: A transformation system for developing recursive programs - Burstall, Darlington - 1977
15: fold transformations of logic programs (context) - Tamaki, Sato - 1984
BibTeX entry: (Update)
Pettorossi, A., Proietti, M., and Renault, S. 1997. Reducing nondeterminism while specializing logic programs. In Proceedings 24-th POPL, Paris, France (1997), pp. 414--427. ACM Press. http://citeseer.comp.nus.edu.sg/69818.html More
@inproceedings{ pettorossi97reducing,
author = "Alberto Pettorossi and Maurizio Proietti and Sophie Renault",
title = "Reducing Nondeterminism while Specializing Logic Programs",
booktitle = "Symposium on Principles of Programming Languages",
pages = "414--427",
year = "1997",
url = "citeseer.comp.nus.edu.sg/69818.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
224 Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
139 fold transformation of logic programs (context) - Tamaki, Sato - 1984
57 The concept of a supercompiler (context) - Turchin - 1986
51 Automatic mode inference for logic programs - Debray, Warren - 1988
48 A conceptual embedding of folding into partial deduction: To.. (context) - Leuschel, De Schreye et al. - 1996
46 Mixtus: An automatic partial evaluator for full Prolog (context) - Sahlin - 1993
37 Occam's razor in metacomputation: the notion of a perfect pr.. (context) - Gluck, Klimov - 1993
37 Global control for partial deduction through characteristic .. (context) - Leuschel, Martens - 1995
30 Unfolding-definition-folding (context) - Proietti, Pettorossi - 1995
26 Partial evaluation of pattern matching in constraint logic p.. (context) - Smith - 1991
22 Preserving universal termination through unfold/fold (context) - Bossi, Cocco - 1994
19 Functional computations in logic programs - Debray, Warren - 1989
15 Tutorial on specialization of logic programs (context) - Gallagher - 1993
12 fold transformations for definite clause programs (context) - Gergatsoulis, Katzouraki - 1994
10 Transformation of programs and use of tupling strategy (context) - Pettorossi - 1977
5 Enhancing partial deduction via unfold/fold rules - Pettorossi, Proietti et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.iasi.rm.cnr.it/~renault/Papers/):
Enhancing Partial Deduction via Unfold/Fold Rules - Pettorossi, Proietti, Renault (1996) (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.