Transformations of CLP modules

Theoretical Computer Science

Volumn 166, Issue 1-2, 1996, Pages 101-146

  Etalle, Sandro ^a   Gabbrielli, Maurizio ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY; LOGIC PROGRAMMING; OPTIMIZATION; SOFTWARE ENGINEERING; TREES (MATHEMATICS);

COMPOSITIONALITY; CONSTRAINT LOGIC PROGRAMMING; LEAST MODEL SEMANTICS; NONMODULAR SYSTEM; PROGRAM TRANSFORMATIONS; SEMANTICS;

COMPUTER SOFTWARE;

EID: 0030257457     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00148-4     Document Type: Article

References (37)

1. K.R. Apt., Introduction to logic programming, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics (Elsevier, Amsterdam and The MIT Press, Cambridge, 1990) 495-574.
2. C. Aravidan and P.M. Dung, On the correctness of Unfold/Fold transformation of normal and extended logic programs, Tech. report, Division of Computer Science, Asian Institute of Technology, Bangkok, Thailand, April 1993.
3. N. Bensaou and I. Guessarian, Transforming constraint logic programs, in: F. Turini, ed., Proc. 4th Workshop on Logic Program Synthesis and Transformation (1994).
4. A. Bossi, M. Bugliesi, M. Gabbrielli, G. Levi and M.C. Meo, Differential logic programming, in: Proc. 20th Ann. ACM Symp. on Principles of Programming Languages (ACM, New York, 1993) 359-370.
5. A. Bossi and N. Cocco, Basic transformation operations which preserve computed answer substitutions of logic programs, J. Logic Programming 16 (1 and 2) (1993) 47-87.
6. A. Bossi, M. Gabbrielli, G. Levi and M.C. Meo, A compositional semantics for logic programs, Theoret. Comput. Sci. 122 (1-2) (1994) 3-47.
7. M. Bugliesi, E. Lamma and P. Mello, Partial deduction for structured logic programs, J. Logic Programming 16 (1-2) (1993) 89-122.
8. M. Bugliesi, E. Lamma and P. Mello, Modularity in logic programming, J. Logic Programming 19-20 (1994) 443-502.
9. R.M. Burstall and J. Darlington, A transformation system for developing recursive programs, J. Assoc. Comput. Math. 24(1) (1977) 44-67.
10. K.L. Clark and S. Sickel, Predicate logic: a calculus for deriving programs, in: Proc. IJCAI'77, (1977) 419-420.
11. S. Etalle and M. Gabbrielli, A transformation system for modular CLP programs, in: Proc. 20th Internat. Conf. on Logic Programming, ICLP 95 (MIT Press, Cambridge, MA, 1995).
12. S. Etalle and M. Gabbrielli, The replacement operation for CLP modules, in: Proc. ACM SIGPLAN Symp. Partial Evaluation and Semantics-Based Program Manipulation, PEPM '95 (ACM Press, 1995) 168-177.
13. M. Gabbrielli, G.M. Dore and G. Levi, Observable semantics for constraint logic programs, J. Logic Comput. 5(2) (1995) 133-171.
14. M. Gabbrielli and G. Levi, Modeling answer constraints in constraint logic programs, in: K. Furukawa, ed., Proc. 8th Internat. Conf. on Logic Programming (MIT Press, Cambridge, MA, 1991) 238-252.
15. H. Gaifman and E. Shapiro, Fully abstract compositional semantics for logic programs, in: Proc. 16th Ann. ACM Symp. on Principles of Programming Languages (ACM, New York, 1989) 134-142.
16. P.A. Gardner and J.C. Shepherdson, Unfold/fold transformations of logic programs, in: J-L. Lassez and G. Plotkin, eds., Computational Logic: Essays in Honor of Alan Robinson (MIT Press, Cambridge, MA, 1991).
17. C.J. Hogger, Derivation of logic programs, J. Assoc. Comput. Mach. 28(2) (1981) 372-392.
18. J. Jaffar and J.-L. Lassez, Constraint logic programming, Tech. Report, Department of Computer Science, Monash University, June 1986.
19. J. Jaffar and J.-L. Lassez, Constraint logic programming, in: Proc. 14th Ann. ACM Symp. on Principles of Programming Languages (ACM, New York, 1987) 111-119.
20. J. Jaffar and M.J. Maher, Constraint logic programming: A survey, J. Logic Programming 19/20 (1994) 503-581.
21. J. Jaffar, S. Michaylov, P.J. Stuckey and R.H.C. Yap, An abstract machine for CLP(ℛ), in: Proc. ACM SIGPLAN Symp. on Programming Language Design and Implementation (PLDI), (ACM, New York, 1992) 128-139.
22. J. Jaffar, S. Michayov, P.J. Stuckey and R.H.C. Yap, The CLP(ℛ) language and system, ACM Trans. on Programming Languages and Systems 14(3) (1992) 339-395.
23. N. Jørgensen, K. Marriott and S. Michaylov, Some global compile-time optimizations for CLP(ℛ), in: V. Saraswat and K. Ueda, eds., ILPS'91: Proc. the Internat. Logic Programming Symposium, (San Diego, October 1991) (MIT Press, Cambridge, MA, 1991) 420-434.
24. T. Kawamura and T. Kanamori, Preservation of stronger equivalence in unfold/fold logic programming transformation, in: Proc. Internat. Conf. on 5th Generation Computer Systems (Institute for New Generation Computer Technology, Tokyo, 1988) 413-422.
25. H.J. Komorowski, Partial evaluation as a means for inferencing data structures in an applicative language: A theory and implementation in the case of Prolog, in: 9th ACM Symp. on Principles of Programming Languages (Albuquerque, NM 1982) 255-267.
26. A. Lakhotia and L. Sterling, Composing recursive logic programs with clausal join, New Generation Computing 6 (2,3) (1988) 211-225.
27. J.-L. Lassez, M.J. Maher and K. Marriott, Unification revisited, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, CA., 1988) 587-625.
28. J.W. Lloyd, Foundations of Logic Programming (Springer, Verlag, Berlin, 2nd ed., 1987).
29. M.J. Maher, A transformation system for deductive databases with perfect model semantics, Theoret. Comput. Sci. 110 (1993) 377-403.
30. K. Marriott and P.J. Stuckey, The 3 r's of optimizing constraint logic programs: Refinement, removal and reordering, in: POPL'93: Proc. ACM SIGPLAN Symp. on Principles of Programming Languages, (Charleston, January 1993).
31. R.A. O'Keefe, Towards an algebra for constructing logic programs, in: Proc. IEEE Symp. on Logic Programming (1985) 152-160.
32. A. Pettorossi and M. Proietti, Transformation of logic programs: Foundations and techniques, J. Logic Programming 19(20) (1994) 261-320.
33. T. Sato, Equivalence-preserving first-order unfold/fold transformation system, Theoret. Comput. Sci. 105(1) (1992) 57-84.
34. H. Seki, Unfold/fold transformation of stratified programs, Theoret. Comput. Sci. 86(1) (1991) 107-139.
35. H. Seki, Unfold/fold transformation of general logic programs for the well-founded semantics, J. Logic Programming 16 (1 and 2) (1993) 5-23.
36. H. Tamaki and T. Sato, A transformation system for logic programs which preserves equivalence, Tech. Report ICOT TR-018, ICOT, Tokyo, Japan, August 1983.
37. H. Tamaki and T. Sato, Unfold/fold transformations of logic programs, in: Sten-Åke Tärnlund, ed., Proc. 2nd Internat. Conf. on Logic Programming (1984) 127-139.