Proving the correctness of recursion-based automatic program transformations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 915, Issue , 1995, Pages 681-695

  Sands, David ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

DEFORESTATION; PROGRAM COMPILERS; SEMANTICS;

AUTOMATIC PROGRAMS; AUTOMATIC TECHNIQUE; FUNCTIONAL PROGRAMS; GENERALISATION; HIGHER-ORDER; PROGRAM TRANSFORMATIONS; RECURSIONS; TRANSFORMATION RULES;

SOFTWARE DESIGN;

EID: 84957672152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59293-8_228     Document Type: Conference Paper

References (33)

1. [Abr90] S. Abramsky. The lazy lambda calculus. In Research Topics in Functional Programming. Addison Wesley, 1990.
2. [BD77] R. Burstall and J. Darlington. A transformation system for developing recursive programs. JACM, 24: 44-67, January 1977.
3. [Chi90] W. N. Chin. Automatic Methods for Program Transformation. PhD thesis, Imperial College, 1990.
4. [CK93] C. Consel and S. Khoo. On-line and off-line partial evaluation: Semantic specification and correctness proofs. Tech. Report, Yale, April 1993.
5. [Cou79] B. Courcelle. Infinite trees in normal form and recursive equations having a unique solution. Math, Systems Theory, 13: 131-180, 1979.
6. [FFK87] M. Felleisen, D. Friedman, and E. Kohlbecker. A syntactic theory of sequential control. TCS, 52: 205-237, 1987.
7. [FW88] A. Ferguson and P. Wadler. When will deforestation stop. In 1988 Glasgow Workshop on Functional Programming, Research Rep. 89/R4, 1988.
8. [GK93] R. Glück and A. V. Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In Static Analysis Syposium, LNCS 724, 1993.
9. [GLJ93] A. Gill, J. Launchbury, and S. Peyton Jones. A short cut to deforestation. In FPCA '93. ACM Press, 1993.
10. [Gom92] C. Gomard. A self-applicable partial evaluator for the lambda calculus: correctness and pragmatics. ACM TOPLAS, 14(2): 147-172, 1992.
11. [How89] D. J. Howe. Equality in lazy computation systems. In 4th LICS. IEEE, 1989.
12. [JGS93] N. D. Jones, C. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
13. [Kom92] J. Komorowski. An introduction to partial deduction. In Third Int. Workshop on Meta-Programming in Logic, LNCS 649, 1992.
14. [Kot78] L. Kott. About transformation system: A theoretical study. In B. Robinet, editor, Program Transformations. Dunod, 1978.
15. [LS91] J. W. Lloyd and J. Shepherdson. Partial evaluation in logic programming. J. Logic Programming, 3-4(11), 1991.
16. [MW92] S. Marlow and P. Wadler. Deforestation for higher-order functions. In Functional Programming, Glasgow 1992, Springer Workshop Series, 1992.
17. [NH94] K. Nielsen and M. Heine Sørensen Deforestation, partial exaluation and evaluation orders. Unpublished, DIKU, Copenhagen, 1994.
18. [Pal93] J. Palsberg. Correctness of binding time analysis. J. Functional Programming, 3(3), 1993.
19. [Plo75] G. D. Plotkin. Call-by-name, Call-by-value and the λ-calculus. TCS, 1(1): 125-159, 1975.
20. [PS83] P. Partsch and R. Steinbruggen. Program transformation systems. Computing Surveys, 15: 199-236, 1983.
21. [San9l] D. Sands. Operational theories of improvement in functional languages (extended abstract). In Fourth Glasgow Workshop on Functional Programming, Springer Workshop Series, 1991.
22. [Sa95a] D. Sands. Total correctness by local improvement in program transformation. In 22nd POPL. ACM Press, 1995.
23. [Sa95b] D. Sands. Total correctness by local improvement in the transformation of functional programs. DIKU, University of Copenhagen, 48pages, January 1995.
24. [SF93] T. Sheard and L. Fegaras. A fold for all seasons. In FPCA '93. ACM Press, 1993.
25. [SGJ94] 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 Verlag, 1994.
26. [Sø94a] M H Sørensen. A grammar-based data-flow analysis to stop deforestation. In CAAP'94, LNCS 787, 1994.
27. [Sø94b] M H Sørensen. Turchin's supercompiler revisited: An operational theory of positive information propagation. Master's thesis, DIKU, University of Copenhagen, (RR 94/9) 1994.
28. [Ste94] P. Steckler. Correct Higher-Order Program Transformations. PhD thesis, Northeastern University, Boston, 1994.
29. [TS84] H. Tamaki and T. Sato. Unfold/fold transformation of logic programs. In 2nd Int. Logic Programming Conf., 1984.
30. [Tur86] V. F. Turchin. The concept of a supercompiler. ToPLaS, 8: 292-325, July 1986.
31. [Wad89] P. Wadler. The concatenate vanishes. University of Glasgow. Unpublished (preliminary version circulated on the fp mailing list, 1987), November 1989.
32. [Wad90] P. Wadler. Deforestation: transforming programs to eliminate trees. TCS, 73: 231-248, 1990. (Preliminary version in ESOP 88, LNCS 300).
33. [Wan93] M. Wand. Specifying the correctness of binding time analysis. J. Functional Programming, 3(3), 1993.