Proving the correctness of recursion-based automatic program transformations

Theoretical Computer Science

Volumn 167, Issue 1-2, 1996, Pages 193-233

  Sands, David ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; MATHEMATICAL TECHNIQUES; OPTIMIZATION; RECURSIVE FUNCTIONS;

AUTOMATIC PROGRAM TRANSFORMATIONS; DEFORESTATION;

COMPUTER SCIENCE;

EID: 0030260662     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00074-6     Document Type: Article

References (40)

1. S. Abramsky, The lazy lambda calculus, in: D. Turner, ed., Research Topics in Functional Programming (Addison Wesley, Reading, MA, 1990) 65-116.
2. R. Burstall and J. Darlington, A transformation system for developing recursive programs, JACM 24 (1977) 44-67.
3. W.N. Chin, Automatic methods for program transformation, Ph.D. Thesis, Imperial College, University of London, 1990.
4. W.N. Chin, Safe fusion of functional expressions II: further improvements, J. Functional Programming 4 (1994) 515-555.
5. B. Courcelle, Infinite trees in normal form and recursive equations having a unique solution, Math. Systems Theory 13 (1979) 131-180.
6. M. Felleisen, D. Friedman and E. Kohlbecker, A syntactic theory of sequential control, Theoret. Comput. Sci. 52 (1987) 205-237.
7. A. Ferguson and P. Wadler, When will deforestation stop, in: Proc. 1988 Glasgow Workshop on Functional Programming, Glasgow Computer Science Department Research Report 89/R4, 1988.
8. A. Gill, J. Launchbury and S. Peyton Jones, A short cut to deforestation, in: FPCA '93, Conf. on Functional Programming Languages and Computer Architecture (ACM Press, New York, 1993).
9. R. Glück and A.V. Klimov, Occam's razor in metacomputation: the notion of a perfect process tree, in: G. Filè P. Cousot, M. Falaschi and A. Rauzy, eds., Static Analysis. Proceedings, Lecture Notes in Computer Science, Vol. 724 (Springer, Berlin, 1993) 112-123.
10. R. Glück and M.H. Sørensen, Partial deduction and driving are equivalent, in: M. Hermenegildo and J. Penjam, eds., Programming Language Implementation and Logic Programming, Lecture Notes in Computer Science, Vol. 844 (Springer, Berlin, 1994) 165-181.
11. C. Gomard, A self-applicable partial evaluator for the lambda calculus: correctness and pragmatics, ACM TOPLAS 14 (1992) 147-172.
12. G.W. Hamilton, Deforestation for Higher Order Functional Programs, Unpublished (Keele University, UK, April 1995).
13. G.W. Hamilton and S.B. Jones, Extending deforestation for first order functional programs, in: Proc. Fourth Glasgow Workshop on Functional Programming, Workshops in Computing Series, Skye, August 1991 (Springer, Berlin, 1991) 134-145.
14. D.J. Howe, Equality in lazy computation systems, in: Proc. 4th Ann. Symp. on Logic In Computer Science (IEEE, New York, 1989) 198-203.
15. N.D. Jones, C. Gomard and P. Sestoft, Partial Evaluation and Automatic Program Generation (Prentice-Hall, Englewood Cliffs, NJ, 1993).
16. J. Komorowski, An introduction to partial deduction, in: Proc. 3rd Internat. Workshop on MetaProgramming in Logic, Lecture Notes in Computer Science, Vol. 649 (Springer, Berlin, 1992) 49-69.
17. L. Kott, About transformation system: a theoretical study, in: B. Robinet, ed., Program Transformations, (Dunod, Paris, 1978) 232-247.
18. J.W. Lloyd and J. Shepherdson, Partial evaluation in logic programming, J. Logic Programming 3-4 (1991).
19. S.D. Marlow, Deforestation for higher-order functional programs, Ph.D. Thesis, Dept. of Computing Science, University of Glasgow, 1995.
20. S. Marlow and P. Wadler, Deforestation for higher-order functions, in: Functional Programming, Glasgow 1992, Springer Workshops in Computer Science (Springer, Berlin, 1992) 154-165.
21. K. Nielsen and M.H. Sørensen, Call-by-name CPS-translation as a binding-time improvement, in: Static Analysis Symposium (SAS '95), Lecture Notes in Computer Science, Vol. 983 (Springer, Berlin, 1995) 296-313.
22. J. Palsberg, Correctness of binding time analysis, J. Functional Programming 3 (1993).
23. P. Partsch and R. Steinbruggen, Program transformation systems, Comput. Surveys 15 (1983) 199-236.
24. A. Pettorossi and M. Proietti, Rules and strategies for transforming functional and logic programs, ACM Comput. Surveys (1995).
25. S.L. Peyton Jones, The Implementation of Functional Programming Languages. Prentice-Hall International Series in Computer Science (Prentice-Hall International (UK) Ltd, London, 1987).
26. G.D. Plotkin, Call-by-name, call-by-value and the λ-calculus, Theoret. Comput. Sci. 1 (1975) 125-159.
27. D. Sands, Operational theories of improvement in functional languages (extended abstract), in: Proc. 4th Glasgow Workshop on Functional Programming, Skye, August 1991, Springer Workshop Series (Springer, Berlin, 1991) 298-311.
28. D. Sands, Correctness of recursion-based automatic program transformations, in Internat. Joint Conf. on Theory and Practice of Software Development (TAPSOFTIFASE '95), Lecture Notes in Computer Science, Vol. 915 (Springer, Berlin, 1995).
29. D. Sands, Total correctness by local improvement in program transformation, in: Proc. 22nd Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL) (ACM Press, New York, January 1995).
30. D. Sands, Total correctness by local improvement in the transformation of functional programs, ACM TOPLAS 18 (1996) 175-234.
31. M.H. Sørensen, Turchin's supercompiler revisited: an operational theory of positive information propagation, Master's Thesis, Department of Computer Science, University of Copenhagen, 1994.
32. M.H. Sørensen and R Glück, An algorithm for generalization in positive supercompilation, in: Internat. Logic Programming Symp. (ILPS'95), Portland, Oregon, 1995 (MIT Press, Cambridge, 1995).
33. M.H. Sørensen, R. Glück and N.D. Jones, Towards unifying partial evaluation, deforestation, supercompilation, and GPC, in: ESOP'94. LNCS 788 (Springer, Berlin, 1994).
34. P. Steckler, Correct higher-order program transformations, Ph.D. Thesis, College of Computer Science, Northeastern University, Boston, 1994. Tech Report NU-CCS-94-15.
35. V.F. Turchin, The concept of a supercompiler, ACM TOPLAS, 8 (1986) 292-325.
36. V.F. Turchin, The algorithm of generalization, in: D. Bjømer, Ershov, and N.D. Jones, eds., Partial Evaluation and Mixed Computation, Proc. IFIP TC2 Workshop, Gammel Avernæs, Denmark, October 1987 (North-Holland, Amsterdam, 1988) 531-549.
37. P. Wadler, The concatenate vanishes, University of Glasgow, Unpublished (preliminary version circulated on the FP mailing list, 1987), November 1989.
38. P. Wadler, Deforestation: transforming programs to eliminate trees, Theoret. Comput. Sci. 73 (1990) 231-248. Preliminary version in ESOP 88, Lecture Notes in Computer Science, Vol. 300 (Springer, Berlin, 1988).
39. P. Wadler, Deforestation: transforming programs to eliminate trees, Theoret. Comput. Sci. 73 (1990) 231-248. Preliminary version in ESOP 88, Lecture Notes in Computer Science, Vol. 300 (Springer, Berlin, 1988).
40. M. Wand, Specifying the correctness of binding time analysis, J. Functional Programming 3 (1993).