Future Directions in Program Transformation

ACM Computing Surveys

Volumn 28, Issue 4, 1996, Pages 1-4

  Pettorossi, Alberto ^a   Proietti, Maurizio ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18244393961     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/242224.242445     Document Type: Article

References (18)

1. D. Archieri and E. Moggi. A denotational model for complexity. In 2nd Italian Workshop on Functional Programming. Department of Informatics, Pisa, Italy, 1996.
2. J. L. Bates and R. L. Constable. Proofs as programs. ACM Toplas, 7(1):113-136, 1985.
3. R. S. Boyer and J. S. Moore. A Computational Logic. Academic Press, New York, 1979.
4. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44-67, January 1977.
5. D. C. Cooper. The equivalence of certain computations. Computer Journal, 9:45-52, 1966.
6. M. S. Feather. A survey and classification of some program transformation techniques. In L. G. L. T. Meertens, editor, Proceedings IFIP TC2 Working Conference on Program Specification and Transformation, Bad Tölz, Germany, pages 165-195. North-Holland, 1987.
7. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
8. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
9. Z. Manna and R. Waldinger. Fundamentals of deductive program synthesis. In F. L. Bauer, editor, Logic, Algebra, and Computation, pages 41-107. Springer-Verlag, 1991.
10. E. Moggi. Notes on metalanguages and applications. Technical report, DISI, Genova University, Genova (Italy), 1994.
11. R. Paige. Symbolic finite differencing - Part I. In N. D. Jones, editor, Third European Symposium on Programming, ESOP ’90, Lecture Notes in Computer Science 432, pages 36-56. Springer-Verlag, 1990.
12. H. A. Partsch. Specification and Transformation of Programs. Springer-Verlag, 1990.
13. A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming, 19, 20: 261-320, 1994.
14. V. N. Redko. On defining relations for the algebra of regular events. Ukrain. Mat. Zh., 16:120-126, 1964. (in Russian).
15. D. Sands. Total correctness by local improvement in the transformation of functional programs. ACM Toplas, 18(2):175-234, 1996.
16. H. Tamaki and T. Sato. Unfold/fold transformation of logic programs. In S.-Å. Tärnlund, editor, Proceedings of the Second International Conference on Logic Programming, Uppsala, Sweden, pages 127-138. Uppsala University, 1984.
17. J. S. Vitter and P. Flajolet. Average-case analysis of algorithms and data structures. In J. van Leuveen, editor, Handbook of Theoretical Computer Science, volume A, pages 431-524. Elsevier, 1990.
18. S. A. Walker and H. R. Strong. Characterization of flowchartable recursions. In Proceedings 4th Annual ACM Symposium on Theory of Computing, Denver, Co., USA, 1972.