Synthesis and transformation of logic programs using unfold/fold proofs

Journal of Logic Programming

Volumn 41, Issue 2-3, 1999, Pages 197-230

  Pettorossi, Alberto ^a   Proietti, Maurizio ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; COMPUTER SOFTWARE SELECTION AND EVALUATION; EQUIVALENCE CLASSES; SYSTEMS ANALYSIS; THEOREM PROVING;

IMPLICIT DEFINITION; PROGRAM SYNTHESIS; PROGRAM TRANSFORMATION; UNFOLD FOLD PROOF METHODS;

LOGIC PROGRAMMING;

EID: 0033224250     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00029-1     Document Type: Article

References (31)

1. J.L. Bates, R.L. Constable, Proofs as programs, ACM Toplas 7 (1) (1985) 113-136.
2. A. Bossi, N. Cocco, Preserving universal termination through unfold/fold, in: Proceedings of ALP'94, Lecture Notes in Computer Science 850, Springer, Berlin, 1994, pp. 269-286.
3. A. Bossi, N. Cocco, S. Dulli, A method for specializing logic programs, ACM Transactions on Programming Languages and Systems 12 (2) (1990) 253-302.
4. D. Boulanger, M. Bruynooghe, Deriving unfold/fold transformations of logic programs using extended OLDT-based abstract interpretation, Journal of Symbolic Computation 15 (1993) 495-521.
5. D.R. Brough, C.J. Hogger, Grammar-related transformations of logic programs, New Generation Computing 9 (1) (1991) 115-134.
6. M. Bruynooghe, D. DeSchreye, B. Krekels, Compiling control, Journal of Logic Programming 6 (1989) 135-162.
7. A. Bundy, A. Smaill, G. Wiggins, The synthesis of logic programs from inductive proofs, in: J.W. Lloyd (Ed.), Computational Logic Symposium Proceedings, Brussels, Springer, Berlin, November 1990, pp. 135-149.
8. R.M. Burstall, J. Darlington, A transformation system for developing recursive programs, Journal of the ACM 24 (1) (1977) 44-67.
9. K.L. Clark, S.-Å. Tärnlund, A first order theory of data and programs, in: Proceedings of Information Processing'77, North-Holland, Amsterdam, 1977, pp. 939-944.
10. S.K. Debray, D.S. Warren, Automatic mode inference for logic programs, Journal of Logic Programming 5 (1988) 207-229.
11. Y. Deville, K.-K. Lau, Logic program synthesis, Journal of Logic Programming 19 (20) (1994) 321-350.
12. L. Fribourg, Extracting logic programs from proofs that use extended Prolog execution and induction, in: D.H.D. Warren, P. Szeredi (Eds.), Proceedings of The Seventh International Conference on Logic Programming, Jerusalem, Israel, MIT Press, Cambridge, MA, 18-20 June 1990, pp. 685-699.
13. J.P. Gallagher, D.A. deWaal, Deletion of redundant unary type predicates from logic programs, in: Proceedings of LoPSTr'92, Manchester, UK, Springer, Berlin, 1993, pp. 151-167.
14. M. Gergatsoulis, M. Katzouraki, Unfold/fold transformations for definite clause programs, in: M. Hermenegildo, J. Penjam (Eds.), Proceedings of The Sixth International Symposium on Programming Language Implementation and Logic Programming (PLILP'94), Lecture Notes in Computer Science 844, Springer, Berlin, 1994, pp. 340-354.
15. Å. Hansson, S.-Å. Tärnlund, Program transformation by data structure mapping, in: K.L. Clark, S.-Å. Tärnlund (Eds.), Logic Programming, Academic Press, New York, 1982, pp. 117-122.
16. C.J. Hogger, Derivation of logic programs, Journal of the ACM 28 (2) (1981) 372-392.
17. A.C. Kakas, R.A. Kowalski, F. Toni, Abductive logic programming, Journal of Logic and Computation 2 (1992) 719-770.
18. T. Kanamori, M. Maeji, Derivation of logic programs from implicit definition, Technical Report TR-178, ICOT, Tokyo, Japan, 1986.
19. L. Kott, The McCarthy's induction principle: 'oldy' but 'goody', Calcolo 19 (1) (1982) 59-69.
20. J.W. Lloyd, Foundations of Logic Programming, 2nd ed., Springer, Berlin, 1987.
21. J.W. Lloyd, J.C. Shepherdson, Partial evaluation in logic programming, Journal of Logic Programming 11 (1991) 217-242.
22. M.J. Maher, Correctness of a logic program transformation system, IBM Research Report RC 13496, T.J. Watson Research Center, 1987.
23. Z. Manna, R. Waldinger, A deductive approach to program synthesis, ACM Toplas 2 (1980) 90-121.
24. A. Pettorossi, M. Proietti, Transformation of logic programs, foundations and techniques, Journal of Logic Programming 19 (20) (1994) 261-320.
25. A. Pettorossi, M. Proietti, S. Renault. Reducing nondeterminism while specializing logic programs, in: Proceedings of 24th ACM Symposium on Principles of Programming Languages, Paris, France, ACM Press, New York, 1997, pp. 414-427.
26. M. Proietti, A. Pettorossi, Synthesis of programs from unfold/fold proofs, in: Y. Deville (Ed.), Logic Program Synthesis and Transformation, Proceedings of LoPSTr'93, Louvain-la-Neuve, Belgium, Workshops in Computing, Springer, Berlin, 1994, pp. 141-158.
27. L.S. Sterling, E. Shapiro, The Art of Prolog, 2nd ed., MIT Press, Cambridge, MA, 1994.
28. H. Tamaki, T. Sato, Unfold/fold transformation of logic programs, in: S.-Å. Tärnlund (Ed.), Proceedings of The Second International Conference on Logic Programming, Uppsala University, Uppsala, Sweden, 1984, pp. 127-138.
29. H. Tamaki, T. Sato, A generalized correctness proof of the unfold/fold logic program transformation, Technical Report 86-4, Ibaraki University, Japan, 1986.
30. V.F. Turchin, The concept of a supercompiler, ACM Toplas 8 (3) (1986) 292-325.
31. J. Zhang, An automatic d-list transformation algorithm for Prolog programs, Technical Report, Department of Computer Science, University College of Swansea, UK, 1987.