Transformation of left terminating programs: The reordering problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1048, Issue , 1996, Pages 33-45

  Bossi, Annalisa ^a   Cocco, Nicoletta ^b   Etalle, Sandro ^c  

^a UNIVERSITY OF CALABRIA   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^c UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; COMPUTER CIRCUITS; FORMAL LOGIC; LOGIC PROGRAMMING;

LOGIC PROGRAMS; PROLOG PROGRAMS; SELECTION RULES; SOURCE-REWRITING; TERMINATION PROPERTY; TRANSFORMATION SYSTEMS;

PROLOG (PROGRAMMING LANGUAGE);

EID: 79956073742     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60939-3_3     Document Type: Conference Paper

References (26)

1. K. R. Apt and M. Bezem. Acyclic programs. In D. H. D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming, pages 617-633. The MIT Press, 1990.
2. K.R. Apt and E. Marchiori. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 1994. In print. Also Technical report CS-R9358, CWI, Amsterdam, The Netherlands. Available via anonymous ftp at ftp.cwi.nl, or via xmosaic at http://www.cwi.nl/cwi/publications/index.html.
3. K. R. Apt and D. Pedreschi. Studies in Pure Prolog: termination. In J. W. Lloyd, editor, Symposium on Computational Logic, pages 150-176. Springer-Verlag, 1990
4. K. R. Apt and D. Pedreschi. Reasoning about termination of pure Prolog programs. Information and Computation, 106(1):109-157, 1993.
5. K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495-574. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.
6. M. Baudinet. Logic Programming Semantics: Techniques and Applications. PhD thesis, Stanford University, Stanford, California, 1989.
7. A. Bossi and N. Cocco. Preserving universal termination through unfold/fold. In G. Levi and M. Rodriguez-Artalejo, editors, Proc. Fourth Int’l Conf, on Algebraic and Logic Programming, volume 850 of Lecture Notes in Computer Science, pages 269-286. Springer-Verlag, Berlin, 1994.
8. A. Bossi, N. Cocco, and S. Etalle. Transformation of Left Terminating Programs: The Reordering Problem. Technical Report CS96-1, Dip. Matematica Applicata e Informatica, Università Ca’ Foscari di Venezia, Italy”, 1996.
9. A. Bossi, N. Cocco, and M. Fabris. Norms on Terms and their use in Proving Universal Termination of a Logic Program. Theoretical Computer Science, 124:297-328, 1994.
10. R.M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(l):44-67, January 1977.
11. A. Bossi and S. Etalle. Transforming Acyclic Programs. ACM Transactions on Programming Languages and Systems, 16(4):1081-1096, July 1994.
12. J. Cook and J.P. Gallagher. A transformation system for definite programs based on termination analysis. In F. Turini, editor, Proc. Fourth Workshop on Logic Program Synthesis and Transformation. Springer-Verlag, 1994.
13. K.L. Clark and S. Sickel. Predicate logic: a calculus for deriving programs. In Proceedings of IJCAI’77, pages 419-120, 1977.
14. S. Decorte, D. De Schreye, and M. Fabris. Automatic Inference of Norms: a Missing Link in Automatic Termination Analysis. In D. Miller, editor, Proc. 1993 Int’l Symposium on Logic Programming. The MIT Press, 1993.
15. S. Etalle and M. Gabbrielli. Transformations of CLP Modules. Technical Report CS-R9515, CWI, Amsterdam, 1994.
16. C.J. Hogger. Derivation of logic programs. Journal of the ACM, 28(2):372-392, April 1981.
17. T. Kawamura and T. Kanamori. Preservation of Stronger Equivalence in Unfold/Fold Logic Programming Transformation. In Proc. Int’l Conf. on Fifth Generation Computer Systems, pages 413-422. Institute for New Generation Computer Technology, Tokyo, 1988.
18. T. Kawamura and T. Kanamori. Preservation of Stronger Equivalence in Unfold/Fold Logic Programming Transformation. Theoretical Computer Science, 75(1&2):139-156, 1990.
19. H. Komorowski. Partial evaluation as a means for inferencing data structures in an applicative language: A theory and implementation in the case of Prolog. In Ninth ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, pages 255-267. ACM, 1982.
20. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987. Second edition.
21. Mycroft A. N. Jones. Stepwise development of operational and denotational semantics for Prolog. In International Symposium on Logic Programming, Atlantic City, NJ, (U.S.A.), pages 289-298, 1984.
22. L. Pliimer. Termination Proofs for Logic Programs. Lecture Notes in Artificial Intelligence 446. Springer-Verlag, 1990.
23. M. Proietti and A. Pettorossi. Semantics preserving transformation rules for prolog. In ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM ‘91). ACM press, 1991.
24. H. Seki. Unfold/fold transformation of stratified programs. Theoretical Computer Science, 86(1):107-139, 1991.
25. H. Seki. Unfold/fold transformation of general logic programs for the Well-Founded semantics. Journal of Logic Programming, 16(1&2):5-23, 1993.
26. H. Tamaki and T. Sato. Unfold/Fold Transformations of Logic Programs. In Sten-Ake Tirnlund, editor, Proc. Second Int’l Conf, on Logic Programming, pages 127-139, 1984.