Semantics preserving transformation rules for Prolog

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Semantics preserving transformation rules for Prolog

Full text

Pdf (1.05 MB)

Source

ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation archive
Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation table of contents

New Haven, Connecticut, United States

Pages: 274 - 284

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Authors

Maurizio Proietti	IASI-CNR, Viale Manzoni 30, 00185 Roma, Italy
Alberto Pettorossi	Electronics Department, University of Rome II, 00173 Roma, Italy

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 29, Citation Count: 7

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/115865.115895 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.

	Baudinet 89	M. Baudinet, Logic programming semantics: techniques and applications, Stanford University, Stanford, CA, 1989
	Bossi-Cocco 90	Bossi, A. and Cocco, N.: Basic Transformation Operations for Logic Programs which Preserve Computed Answer Substitutions. Tech. Rep. University of Padova, Italy, 1990.
	Burstall-Darlington 77	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]
	Debray-Mishra 88	Saumya K. Debray , Prateek Mishra, Denotational and operational semantics for Prolog, Journal of Logic Programming, v.5 n.1, p.61-91, March 1988 [doi>10.1016/0743-1066(88)90007-6]
	Gardner-Shepherdson 89	Gardner, P.A. and Shepherdson J.C.: Unfold/Fold Transformations of Logic Programs, Tech. Rep., Dept. of Computer Science, University of Edinburgh, 1989.
	Jones-Mycroft 84	Jones, N. and Mycroft, A.: Stepwise Development of Operational and Denotational Semantics for Prolog. In Proc. 1984 Int. Syrup. on Logic Programming, Atlantic City, New Jersey, 1984, pp. 289-298.
	Jones-Søndergaard 87	Jones, N. and S~~ndergaard, H.: A Semantics-Based Framework for the Abstract Interpretation of Prolog. In Abramsky, S. and Hankin, C.: Abstract interpretation of Declarative Languages. Ellis Horwood, 1987, pp. 123-142.
	Kawamura-Kanamori 88	Kawamura, T. and Kanamori, T.: Preservation of Stronger Equivalence in Unfold/Fold Logic Program Transformation. In Proc. Int. Conf. on Fifth Generation Computer Systems, Tokyo, Japan, 1988, pp. 413-422.
	Komorowski 82	H. Jan Komorowski, Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of prolog, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.255-267, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582181]
	Kott 78	Kott, L.: About a Transformation System: A Theoretical Study. in Proc. Third int. Syrup. on Programming, Paris, 1978, pp. 232-247.
	Lloyd 87	J. W. Lloyd, Foundations of logic programming; (2nd extended ed.), Springer-Verlag New York, Inc., New York, NY, 1987
	Proietti-Pettorossi 90	M. Proietti , A. Pettorossi, Synthesis of eureka predicates for developing logic programs, Proceedings of the third European symposium on programming on ESOP '90, p.306-325, May 1990, Copenhagen, Denmark
	Søndergaard 90	S0ndergaard, H.: Semantics- Based Analysis and Transformation of Logic Programs. Ph.D. Thesis, University of Copenhagen, 1990
	Tamaki-Sato 84	Tamaki, H. and Sato, T.: Unfold/FoM Transformation of Logic Programs. In Proc. 2nd int. Conf. on Logic Programming, Uppsala, Sweden, 1984, pp. 127-138.
	Vuillemin 73	Jean Etienne Vuillemin, Proof-techniques for recursive programs., 1974

CITED BY 7

	Michael Leuschel , Bern Martens , Danny De Schreye, Controlling generalization and polyvariance in partial deduction of normal logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.1, p.208-258, Jan. 1998
	Alberto Pettorossi , Maurizio Proietti, Rules and strategies for transforming functional and logic programs, ACM Computing Surveys (CSUR), v.28 n.2, p.360-414, June 1996
	David Sands, Total correctness by local improvement in the transformation of functional programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.2, p.175-234, March 1996
	Tom Mens , Tom Tourwé, A Survey of Software Refactoring, IEEE Transactions on Software Engineering, v.30 n.2, p.126-139, February 2004
	David Sands, Total correctness by local improvement in program transformation, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.221-232, January 23-25, 1995, San Francisco, California, United States
	Michael Leuschel , Maurice Bruynooghe, Logic program specialisation through partial deduction: Control issues, Theory and Practice of Logic Programming, v.2 n.4-5, p.461-515, July 2002
	Bjórn Lisper_c, Infinite Unfolding and Transformations of Nondeterministic Programs, Fundamenta Informaticae, v.66 n.4, p.415-439, December 2005