Transforming constraint logic programs

Theoretical Computer Science

Volumn 206, Issue 1-2, 1998, Pages 81-125

  Bensaou, N ^a   Guessarian, I ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Constraint logic programs; Correctness; Least fixpoint semantics; Program transformations

Indexed keywords

EID: 0037555520     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00077-7     Document Type: Article

References (32)

1. N. Bensaou, Transformation de programmes logiques avec contraintes, Ph.D. Thesis, Paris 6 University, 1996.
2. N. Bensaou, I. Guessarian, An extended transformation system for CLP programs, Proc. 4th Internat. Workshop LOPSTR'94, Lecture Notes in Computer Science, vol. 883, 1994, pp. 17-35.
3. N. Bensaou, I. Guessarian, Transforming constraint logic programs, 11th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 775, 1994, pp. 33-46.
4. A. Bossi, N. Cocco, Basic transformation operations which preserve answer substitutions of logic programs, J. Logic Programming 16 (1993) 47-87.
5. A. Bossi, N. Cocco, S. Dulli, A method for specializing logic programs, ACM Trans. Programming Languages and Systems 12 (2) (1990) 253-302.
6. A. Bossi, S. Etalle, Transforming acyclic programs, ACM ToPLAS 16 (4) (1994) 1081-1096.
7. R.M. Burstall, J. Darlington, A transformation system for deriving recursive programs, J. ACM 24 (1) (1977) 44-67.
8. F. Denis, J.P. Delahaye, Unfolding, procedural and fixpoint semantics of logic programs, Proc. STACS'1991, Lecture Notes in Computer Science, vol. 480, 1991, pp. 511-522.
9. S.V. Denneheuvel, K.L. Kwast, Weak equivalence for constraint sets, IJCAI (1991) 851-856.
10. S. Etalle, M. Gabrielli, Transformations of CLP modules, Theoret. Comput. Sci. 166 (1996) 101-146.
11. S. Etalle, M. Gabrielli, On the correctness of the replacement operation for CLP modules, J. Funct. Logic Programming 1, 1 (1996) 1-52.
12. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative modeling of the operational behavior of logic languages, Theoret. Comput. Sci. 69 (1989) 289-318.
13. M Gabbrielli , G. Levi, Modeling answer constraints, in: Koichi, Furukawa (Eds.), Constraint Logic Programs, Proc. 8th Internat. Conf. on Logic Programming, 1991, pp. 238-252.
14. P.A. Gardner, J.C. Sheperdson, Unfofd/fold transformations of logic programs, in: Computational Logic, Essays in Honor of Alan Robinson, MIT Press, London, 1991, pp. 565-583.
15. R. Giacobazzi, S.K. Debray, G. Levi, A generalized semantics for constraint logic programs, Proc. Internat. Conf. on 5th Generation Computer Systems, Tokyo, 1992, pp. 581-591.
16. T.J. Hickey, D.A. Smith, Toward the partial evaluation of CLP languages, Proc. PEPM'91, ACM-SIGPLAN Notices 26 (9) (1991) 43-51.
17. J. Jaffar, J.L. Lassez, Constraint logic programming, Tech. Report, Department of Computer Science, Monash University, June 1986.
18. J. Jaffar, J.L. Lassez, Constraint logic programming, Proc. 14th ACM symp. Principles of Programming Languages, 1987, pp. 111-119.
19. J. Jaffar, M.J. Maher, Constraint logic programming: a survey, J. Logic Programming 19 (20) (1994) 503-581.
20. P. Kanellakis, G. Kuper, P. Revesz, Constraint query languages, Tech. Report, Department of Computer Science, Brown University, November 1990.
21. T. Kawamura, T. Kanamori, Perservation of stronger equivalence in unfold/fold logic program transformations, Proc. Internat. Conf. FGCS, 1988, pp. 413-421.
22. G. Levi, Models, unfolding rules and fixpoint semantics, Proc. of the 5th Internat. Conf. Logic Programming, 1988, pp. 1649-1665.
23. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1987.
24. M.J. Maher, Correctness of a logic program transformation system, IBM Research Report RC 13496, T.J. Watson Research Center, 1987.
25. M.J. Maher, Equivalences of logic programs, in: J. Minker (Ed.), Fondations of Deductive Databases and Logic Programming, Morgan-Kaufmann, Los Altos, 1988, pp. 627-658.
26. M.J. Maher, A transformation system for deductive database modules with perfect model semantics, Theoret. Comput. Sci. 110 (1993) 377-403.
27. A. Parrain, P. Devienne, P. Lebegue, Techniques de transformations de programmes généraux et validation de meta-interpréteurs, BIGRE 1991.
28. A. Pettorossi, M. Proietti, Semantics preserving transformation rules for Prolog, Proc. PEPM'91, ACM-SIGPLAN Notices, vol. 26, No. 9, 1991, pp. 274-284.
29. A. Pettorossi, M. Proietti, An abstract strategy for transforming logic programs, Fund. Inform. 18 (1993) 267-286.
30. A. Pettorossi, M. Proietti, Transformation of logic programs: foundations and techniques, J. Logic Programming 20 (1994) 261-320.
31. H. Seki, Unfold/fold transformation of stratified programs, Proc. 6th Internat. Conf. on Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 554-568.
32. H. Tamaki, T. Sato, Unfold/fold transformation of logic programs, Proc. 2nd Logic Programming Conf., Uppsala, Sweden, 1984.