Skip to main content
SpringerLink
Log in

An extended transformation system for CLP programs

  • Conference paper
  • First Online:
Logic Program Synthesis and Transformation — Meta-Programming in Logic (META 1994, LOPSTR 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 883))

  • 161 Accesses

Abstract

We extend the Tamaki-Sato transformation system for logic programs into a transformation system for constraint logic programs including fold, unfold, replacement, thinning and fattening, and constraint simplifications; we give a direct proof of its correctness.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.Bossi; N.Cocco. Basic transformation operations which preserve answer substitutions of logic programs, Journal of logic programming, Vol. 16, 1993, 47–87.

    Google Scholar 

  2. A.Bossi; N.Cocco. Preserving universal termination through unfold/fold, Proceedings ALP'94, to appear.

    Google Scholar 

  3. A.Bossi; S.Etalle. Transforming Acyclic Programs, ACM Transactions on Programming Languages and Systems, to appear 1994.

    Google Scholar 

  4. A. Bossi; N. Cocco; S. Dulli. A method for specializing logic programs, ACM Trans. on programming langages and systems, Vol. 12, 2, April 1990, 253–302.

    Google Scholar 

  5. N. Bensaou; I. Guessarian. Transforming constraint logic programs, 11th Symp. on Theoretical Aspects of Computer Science, LNCS 775, 1994, 33–46.

    Google Scholar 

  6. R.M. Burstall; J. Darlington. A transformation system for deriving recursive programs, J. ACM, Vol. 24, 1, 1977, 44–67.

    Article  Google Scholar 

  7. S. Etalle; M. Gabrielli. Modular transformations of CLP programs. Proc. GULPPRODE 1994, to appear.

    Google Scholar 

  8. F. Denis; J.P. Delahaye. Unfolding, procedural and fixpoint semantics of logic programs, Proc. STACS'1991, LNCS 480, 1991, 511–522.

    Google Scholar 

  9. S.V. Denneheuvel; K.L. Kwast. Weak equivalence for constraint sets, IJCAI, 1991, 851–856.

    Google Scholar 

  10. M. Falaschi; G. Levi; M. Martelli; C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages, Theoretical Computer Science 69, 1989, 289–318.

    Article  Google Scholar 

  11. M Gabbrielli; G. Levi. Modeling answer constraints in Constraint Logic Programs, Proc. eight int. conf. on Logic Programming, eds. Koichi & Furukawa, 1991, 238–252.

    Google Scholar 

  12. P.A. Gardner; J.C. Sheperdson. Unfold/fold transformations of logic programs, Computational logic, essays in honor of Alan Robinson, MIT Press, London, 1991, 565–583.

    Google Scholar 

  13. R. Giacobazzi; S.K. Debray; G. Levi. A generalized semantics for constraint logic programs, Proc. Int. Conf. on Fifth Gen. Computer Systems, Tokyo, 1992, 581–591.

    Google Scholar 

  14. T.J. Hickey; D.A. Smith. Toward the partial evaluation of CLP languages, Proc. PEPM'91, ACM-SIGPLAN Notices Vol. 26, 9, 1991, 43–51.

    Google Scholar 

  15. J. Jaffar; M.J. Maher. Constraint logic programming: a survey, to appear in J. Logic Programming.

    Google Scholar 

  16. T.Kawamura; T.Kanamori. Presrvation of stronger equivalence in unfold/fold logic program transformation, Proc. Intern. Conf. on FGCS, Tokyo (1988), 413–421.

    Google Scholar 

  17. P. Kanellakis; G. Kuper; P. Revesz. Constraint Query Languages, Tech. report, Department of Computer Science, Brown university, November 1990.

    Google Scholar 

  18. G. Levi. Models, unfolding rules and fixpoint semantics, Proc. of the fifth international conf. on Logic programming, 1988, 1649–1665.

    Google Scholar 

  19. M.J. Maher. Correctness of a logic program transformation system, IBM Research Report RC 13496, T.J. Watson Research center, 1987.

    Google Scholar 

  20. M.J. Maher. A transformation system for deductive database modules with perfect model semantics, Theoretical Computer Science 110, 1993, 377–403.

    Google Scholar 

  21. A. Parrain; P. Devienne; P. Lebegue. Techniques de transformations de programmes généraux et validation de meta-interpréteurs, BIGRE 1991.

    Google Scholar 

  22. M. Proietti; A. Pettorossi. An abstract strategy for transforming logic programs, Fundamenta Informaticae, Vol. 18, 1993, 267–286.

    Google Scholar 

  23. M. Proietti; A. Pettorossi. Semantics preserving transformation rules for Prolog, Proc. PEPM'91, ACM-SIGPLAN Notices Vol. 26, 9, 1991, 274–284.

    Google Scholar 

  24. H. Tamaki; T. Sato. Unfold/Fold transformation of logic programs, Proc. 2nd logic programming conference, Uppsala, Sweden, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP-Université Paris 6, France

    N. Bensaou & I. Guessarian

Authors
  1. N. Bensaou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Guessarian
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Fribourg Franco Turini

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bensaou, N., Guessarian, I. (1994). An extended transformation system for CLP programs. In: Fribourg, L., Turini, F. (eds) Logic Program Synthesis and Transformation — Meta-Programming in Logic. META LOPSTR 1994 1994. Lecture Notes in Computer Science, vol 883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58792-6_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-58792-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58792-7

  • Online ISBN: 978-3-540-49104-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation