Reducing nondeterminism while specializing logic programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Reducing nondeterminism while specializing logic programs

Full text

Pdf (1.36 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Paris, France

Pages: 414 - 427

Year of Publication: 1997

ISBN:0-89791-853-3

Authors

Alberto Pettorossi	Department of Informatics, Systems and Management, University of Roma Tor Vergata, 00133 Roma, Italy
Maurizio Proietti	IASI-CNR, Viale Manzoni 30, 00185 Roma, Italy
Sophie Renault	Department of Informatics, Systems and Management, University of Roma Tor Vergata, 00133 Roma, Italy

Sponsors

L'Ecole des Mines de Paris : L'Ecole des Mines de Paris
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Ctr Natl de la Recherche Sci :
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 15, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/263699.263759 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Annalisa Bossi , Nicoletta Cocco, Preserving Universal Termination through Unfold/Fold, Proceedings of the 4th International Conference on Algebraic and Logic Programming, p.269-286, September 14-16, 1994
	2	R. M. Burstall , John Darlington, A Transformation System for Developing Recursive Programs, Journal of the ACM (JACM), v.24 n.1, p.44-67, Jan. 1977 [doi>10.1145/321992.321996]
	3	Saumya K. Debray , David S. Warren, Automatic mode inference for logic programs, Journal of Logic Programming, v.5 n.3, p.207-229, Sept. 1988 [doi>10.1016/0743-1066(88)90010-6]
	4	Saumya K. Debray , David S. Warren, Functional computations in logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.3, p.451-481, July 1989 [doi>10.1145/65979.65984]
	5	J. P. Gallagher, Tutorial on specialisation of logic programs, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.88-98, June 14-16, 1993, Copenhagen, Denmark [doi>10.1145/154630.154640]
	6	Manolis Gergatsoulis , Maria Katzouraki, Unfold/Fold Transformations For Definite Clause Programs, Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming, p.340-354, September 14-16, 1994
	7	Robert Glück , Andrei V. Klimov, Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree, Proceedings of the Third International Workshop on Static Analysis, p.112-123, September 22-24, 1993
	8	Neil D. Jones , Carsten K. Gomard , Peter Sestoft, Partial evaluation and automatic program generation, Prentice-Hall, Inc., Upper Saddle River, NJ, 1993
	9	M. Leuschel, D. De Sehreye, A. de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. Proc. JICSLP '96, Bonn, Germany, pp. 319-332. MIT Press, 1996.
	10	M. Leuschel, B. Martens. Global control for partial deduction through characteristic atoms and global trees. Report CW 220, K.U. Leuven, Belgium, 1995.
	11	J. W. Lloyd, Foundations of logic programming; (2nd extended ed.), Springer-Verlag New York, Inc., New York, NY, 1987
	12	J. W. Lloyd , J. C. Shepherdson, Partial evaluation in logic programming, Journal of Logic Programming, v.11 n.3-4, p.217-242, Oct./Nov. 1991 [doi>10.1016/0743-1066(91)90027-M]
	13	A. Pettorossi. Transformation of programs and use of tupling strategy. Proc. lnlormatica '77, Bled, Yugoslavia, pp. 1-6, 1977.
	14	Alberto Pettorossi , Maurizio Proietti , Sophie Renault, Enhancing Partial Deduction via Unfold/Fold Rules, Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation, p.146-168, August 28-30, 1996
	15	Maurizio Proietti , Alberto Pettorossi, Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs, Theoretical Computer Science, v.142 n.1, p.89-124, May 1, 1995
	16	Dan Sahlin, Mixtus: an automatic partial evaluator for full Prolog, New Generation Computing, v.12 n.1, p.7-51, 1993 [doi>10.1007/BF03038271]
	17	Donald A. Smith, Partial evaluation of pattern matching in constraint logic programming languages, ACM SIGPLAN Notices, v.26 n.9, p.62-71, Sept. 1991
	18	H. Tamaki, T. Sato. Unfold/fold transformation of logic programs. Proe. ICLP '84, Uppsala, Sweden, pp. 127-138. 1984.
	19	Valentin F. Turchin, The concept of a supercompiler, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.3, p.292-325, July 1986 [doi>10.1145/5956.5957]

CITED BY 6

	Alberto Pettorossi , Maurizio Proietti, Program specialization via algorithmic unfold/fold transformations, ACM Computing Surveys (CSUR), v.30 n.3es, Sept. 1998
	Abhik Roychoudhury , K. Narayan Kumar , C. R. Ramakrishnan , I. V. Ramakrishnan, An unfold/fold transformation framework for definite logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.26 n.3, p.464-509, May 2004
	Michael Leuschel, A framework for the integration of partial evaluation and abstract interpretation of logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.26 n.3, p.413-463, May 2004
	Alberto Pettorossi , Maurizio Proietti , Sophie Renault, Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism, Higher-Order and Symbolic Computation, v.18 n.1-2, p.121-210, June 2005
	Robert Glück , Masahiko Kawabe, A Method for Automatic Program Inversion Based on LR(0) Parsing, Fundamenta Informaticae, v.66 n.4, p.367-395, December 2005
	Abhik Roychoudhury , I. V. Ramakrishnan, Inductively Verifying Invariant Properties of Parameterized Systems, Automated Software Engineering, v.11 n.2, p.101-139, April 2004