Spes: A system for logic program transformation
Spes is an interactive system for transforming logic programs. It is intended as a formal tool for transforming Horn clauses specifications into correct and more efficient programs. The main transformations used in the Spes system are Unfolding and Folding.
Key-wordsprogram transformation unfolding folding strategy
Unable to display preview. Download preview PDF.
- 1.F. Alexandre, K. Bsaïes, and A. Quéré. On Using Mode Input-output for Transforming Logic Programs. In Proc. of the LoPSTr 91 Workshop on Logic Program Synthesis and Transformation, University of Manchester, pages 129–147. Springer-Verlag, July 1991.Google Scholar
- 2.K. Bsaïes. Static Analysis for the Synthesis of Eureka Properties for Transforming Logic Programs. In to appear in the Proc. of The ALPUK 1992 conference. Springer-Verlag, march 29th to april 1st 1992. London, UK.Google Scholar
- 3.R.M Burstall and J.A Darlington. Transformation System for Developing Recursive Programs. Journal of the Association for Computing Machinery, 24(1):44–67, 1977.Google Scholar
- 4.M.S. Feather. A Survey and Classification of some Program Transformation Techniques. In Proc. TC2 IFIP Working Conference on Program Specification and Transformation, Bad-Töh, F.R.G, 1986.Google Scholar
- 5.M. Proietti and A. Pettorossi. The Synthesis of Eureka Predicates for Developing Logic Program. In N. Jones, editor, 3rd European Symposium on Programming, volume 432 of Lecture Notes in Computer Science, pages 306–325, Copenhaguen, 1990. Springer-Verlag.Google Scholar
- 6.H. Tamaki and T. Sato. Unfold/Fold Transformation of Logic Programs. In Proceedings of the 2nd International Logic Programming Conference, Uppsala, 1984.Google Scholar
- 7.P. Weis, M. V. Aponte, A. Laville, M. Mauny, and A. Suarez. The CAML Reference Manual, Version 2.6. INRIA-ENS, March 1989. Projet Formel.Google Scholar