Total Correctness by Local Improvement in the Transformation of Functional Programs

ACM Transactions on Programming Languages and Systems

Volumn 18, Issue 2, 1996, Pages 175-234

  Sands, David ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

D.1.1 Programming Techniques : Applicative (Functional) Programming; D.2.4 Software Engineering : Program Verification correctness proofs; F.3.1 Logics and Meanings of Programs : Specifying and Verifying and Reasoning about Programs; Languages

Indexed keywords

DATA STRUCTURES; EQUIVALENCE CLASSES; PROGRAM TRANSLATORS; SOFTWARE ENGINEERING; THEOREM PROVING;

HIGHER ORDER FUNCTIONAL LANGUAGE; PROGRAM TRANSFORMATION; UNFOLD FOLD METHODS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0030102464     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/227699.227716     Document Type: Article

References (64)

1. ABRAMSKY, S. 1990. The lazy lambda calculus. In Research Topics in Functional Programming, D. Turner, Ed. Addison-Wesley, Reading, Mass., 65-116.
2. AMTOFT, T. 1992. Unfold/fold transformations preserving termination properties. In PLILP '92. Lecture Notes in Computer Science, vol. 631. Springer-Verlag, Berlin, 187-201.
3. AMTOFT, T. 1993. Sharing of computations. Ph.D. thesis, DAIMI, Aarhus Univ., Aarhus, Denmark.
4. ARIOLA, Z., FELLEISEN, M., MARAIST, J., ODERSKY, M., AND WADLER, P. 1995. The call-by-need lambda calculus. In The 22nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '95). ACM Press, New York.
5. BACKUS, J. 1978. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Commun. ACM 21, 8 (Aug.), 613-641.
6. BIRD, R. 1984. Using circular programs to eliminate multiple traversals of data. Acta Informatica 21, 1, 239-250.
7. BLOOM, B. 1988. Can LCF be topped? Flat lattice models of typed lambda calculus. In The 3rd Annual Symposium on Logic in Computer Science. IEEE, New York.
8. BOSSI, A., COCCO, N., AND ETALLE, S. 1992a. On safe folding. In PLILP '92. Lecture Notes in Computer Science, vol. 631. Springer-Verlag, Berlin, 172-186.
9. BOSSI, A., COCCO, N., AND ETALLE, S. 1992b. Transforming normal programs by replacement. In The 3rd Workshop on Meta-Programming in Logic, META 92. Lecture Notes in Computer Science, vol. 649. Springer-Verlag, Berlin, 265-279.
10. BOUDOL, G. AND KOTT, L. 1983. Recursion induction principle revisited. Theor. Comput. Sci. 22, 1, 135-173.
11. BURSTALL, R. AND DARLINGTON, J. 1977. A transformation system for developing recursive programs. J. ACM 24, 1 (Jan.), 44-67.
12. CONSEL, C. AND KHOO, S. 1993. On-line and off-line partial evaluation: Semantic specification and correctness proofs. Tech. Rep., Yale Univ., New Haven, Conn. Apr.
13. COURCELLE, B. 1979. Infinite trees in normal form and recursive equations having a unique solution. Math. Syst. Theor. 13, 1, 131-180.
14. COURCELLE, B. 1986. Equivalences and transformations of regular systems - applications to recursive program schemes and grammars. Theor. Comput. Sci. 42, 1, 1-122.
15. FEATHER, M. 1979. A system for assisting program transformations. Ph.D. thesis, Univ. of Edinburgh, Edinburgh.
16. FELLEISEN, M., FRIEDMAN, D., AND KOHLBECKER, E. 1987. A syntactic theory of sequential control. Theor. Comput. Sci. 52, 1, 205-237.
17. GARDNER, P. AND SHEPHERDSON, J. 1991. Unfold/fold transformations of logic programs. In Computational Logic: Essays in Honor of Alan Robinson, J.-L. Lassez and G. Plotkin, Eds. MIT Press, Cambridge, Mass.
18. GOMARD, C. 1992. A self-applicable partial evaluator for the lambda calculus: Correctness and pragmatics. ACM Trans. Program. Lang. Syst. 14, 2, 147-172.
19. GORDON, A. D. 1995. Bisimilarity as a theory of functional programming. In Proceedings of the 11th Conference on Mathematical Foundations of Programming Semantics, MFPS'95. Electronic Notes in Computer Science, vol. 1. Elsevier Science, Amsterdam.
20. HOWE, D. J. 1989. Equality in lazy computation systems. In The 4th Annual Symposium on Logic in Computer Science. IEEE, New York, 198-203.
21. HUET, G. AND LANG, B. 1978. Proving and applying program transformations expressed with second order patterns. Acta Inf. 11, 1 (Jan.), 31-55.
22. HUGHES, R. 1982. Super-combinators: A new implementation method for applicative languages. In Proceedings of the 1982 ACM Symposium on Lisp and Functional Languages. ACM, New York, 1-10.
23. JONES, N. D., GOMARD, C., AND SESTOFT, P. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, N.J.
24. KANAMORI, T. AND FUJITA, H. 1986. Unfold/fold transformation of logic programs with counters. Tech. Rep. ICOT TR-179, ICOT Research Center, Tokyo.
25. KAWAMURA, T. AND KANAMORI, T. 1990. Preservation of stronger equivalence in unfold/fold logic program transformation. Theor. Comput. Sci. 1, 73, 139-154.
26. KOTT, L. 1978. About transformation system: A theoretical study. In Program Transformations, B. Robinet, Ed. Dunod, Paris, 232-247.
27. KOTT, L. 1980. A system for proving equivalences of recursive programs. In The 5th Conference on Automated Deduction, W. Bibel and R. Kowalski, Eds. Lecture Notes in Computer Science, vol. 87. Springer-Verlag, Berlin, 63-69.
28. KOTT, L. 1985. Unfold/fold transformations. In Algebraic Methods in Semantics, M. Nivat and J. Reynolds, Eds. Cambridge University Press, Cambridge, Chapter 12, 412-433.
29. MAHER, M. 1987. Correctness of a logic program transformation system. Tech. Rep., IBM T. J. Watson Research Center, Yorktown Heights, N.Y. Revised 1989.
30. MANNA, Z. AND WALDINGER, R. 1979. Synthesis: Dreams ⇒ programs. ACM Trans. Program. Lang. Syst. 5, 4.
31. MCCARTHY, J. 1967. A Basis for a Mathematical Theory of Computation. North-Holland, Amsterdam.
32. MILNER, R. 1977. Fully abstract models of the typed λ-calculus. Theor. Comput. Sci. 4, 1.
33. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall, Englewwood Cliffs, N.J.
34. MILNER, R. AND TOFTE, M. 1991. Co-induction in relational semantics. Theor. Comput. Sci. 87, 1, 209-220.
35. PALSBERG, J. 1993. Correctness of binding time analysis. J. Funct. Program. 3, 3, 347-364.
36. PARTSCH, P. AND STEINBRUGGEN, R. 1983. Program transformation systems. ACM Comput. Surv. 15, 1, 199-236.
37. PETTOROSSI, A. AND PROIETTI, M. 1993. Transformation of logic programs: Foundations and techniques. Tech. Rep. R 369, CNR Istituto di Analisi dei Sistemi ed Informatica, Rome.
38. PEYTON JONES, S. L. 1987. The Implementation of Functional Programming Languages. Prentice-Hall International Ltd., London.
39. PLOTKIN, G. D. 1975. Call-by-name, call-by-value and the λ-calculus. Theor. Comput. Sci. 1, 1, 125-159.
40. PROIETTI, M. AND PETTOROSSI, A. 1991. Semantics preserving transformation rules for Prolog. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM '91. SIGPLAN Not. 26, 9 (Sept.).
41. PROIETTI, M. AND PETTOROSSI, A. 1994. Total correctness of a goal replacement rule based on the unfold-fold proof method. CNR Istituto di Analisi dei Sistemi ed Informatica, Rome.
42. REDDY, U. 1989. Rewriting techniques for program synthesis. In Rewriting Techniques and Applications. Lecture Notes in Computer Science, vol. 355. Springer-Verlag, Berlin, 388-403.
43. RUNCIMAN, C., FIRTH, M., AND JAGGER, N. 1989. Transformation in a non-strict language: An approach to instantiation. In Functional Programming, Glasgow 1989: Proceedings of the 1st Glasgow Workshop on Functional Programming. Springer-Verlag, Berlin.
44. SANDS, D. 1990. Calculi for time analysis of functional programs. Ph.D. thesis, Dept. of Computing, Imperial College, Univ. of London, London.
45. SANDS, D. 1991. Operational theories of improvement in functional languages (extended abstract). In Proceedings of the 4th Glasgow Workshop on Functional Programming (Skye, Scotland). Springer-Verlag, Berlin, 298-311.
46. SANDS, D. 1993. A naïve time analysis and its theory of cost equivalence. TOPPS Rep. D-173, DIKU. Also in Logic and Comput. 5, 4, 495-541.
47. SANDS, D. 1993. A naïve time analysis and its theory of cost equivalence. TOPPS Rep. D-173, DIKU. Also in Logic and Comput. 5, 4, 495-541.
48. SANDS, D. 1995a. Higher-order expression procedures. In Proceeding of the ACM SIGPLAN Syposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'95. ACM, New York, 190-201.
49. SANDS, D. 1995b. Proving the correctness of recursion-based automatic program transformations. In The International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE '95). Lecture Notes in Computer Science, vol. 915. Springer-Verlag, Berlin. Extended version to appear in Theor. Comput. Sci.
50. SANDS, D. 1995b. Proving the correctness of recursion-based automatic program transformations. In The International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE '95). Lecture Notes in Computer Science, vol. 915. Springer-Verlag, Berlin. Extended version to appear in Theor. Comput. Sci.
51. SATO, T. 1990. An equivalence preserving first order unfold/fold transformation system. In The 2nd International Conference on Algebraic and Logic Programming. Lecture Notes in Computer Science, vol. 462. Springer-Verlag, Berlin, 175-188.
52. SCHERLIS, W. 1980. Expression procedures and program derivation. Ph.D. thesis, Stanford Rep. STAN-CS-80-818, Dept. of Computer Science, Stanford Univ., Stanford, Calif.
53. SCHERLIS, W. L. 1981. Program improvement by internal specialisation. In The 8th Symposium on Principals of Programming Languages. ACM, New York.
54. SEKI, H. 1991. Unfold/fold transformation of stratified programs. Theor. Comput. Sci. 86, 1, 107-139.
55. SEKI, H. 1993. Unfold/fold transformation of general logic programs for the well-founded semantics. J. Logic Program. 16, 1, 5-23.
56. TAMAKI, H. AND SATO, T. 1984. Unfold/fold transformation of logic programs. In The 2nd International Logic Programming Conference, S. Tarnlund, Ed. MIT Press, Cambridge, Mass., 127-138.
57. TURCHIN, V. F. 1986. The concept of a supercompiler. ACM Trans. Program. Lang. Syst. 8, 3 (July), 292-325.
58. WADLER, P. 1989a. The concatenate vanishes. Univ. of Glasgow, Glasgow, Scotland. Preliminary version circulated on the fp mailing list, 1987.
59. WADLER, P. 1989b. Theorems for free! In Functional Programming Languages and Computer Architecture, FPCA '89 Conference Proceedings. ACM, New York, 347-359.
60. WADLER, P. 1990. Deforestation: Transforming programs to eliminate trees. Theor. Comput. Sci. 73, 1, 231-248. Preliminary version in ESOP 88, Lecture Notes in Computer Science, vol. 300.
61. WADLER, P. 1990. Deforestation: Transforming programs to eliminate trees. Theor. Comput. Sci. 73, 1, 231-248. Preliminary version in ESOP 88, Lecture Notes in Computer Science, vol. 300.
62. WAND, M. 1993. Specifying the correctness of binding time analysis. J. Funct. Program. 3, 3, 365-387.
63. YONQUIANG, S., RUZHAN, L., AND XIAORONG, H. 1987. Termination preserving problem in the transformation of applicative programs. J. Comput. Sci. Tech. 2, 3, 191-201.
64. ZHU, H. 1994. How powerful are folding/unfolding transformations? J. Funct. Program. 4, 1 (Jan.), 89-112.