A generalization of short-cut fusion and its correctness proof

Higher-Order and Symbolic Computation

Volumn 15, Issue 4, 2002, Pages 273-300

  Johann, Patricia ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Correctness proofs; Functional programming; Operational semantics; Parametricity; Polymorphism; Program transformation; Short cut fusion; Theorems for free

Indexed keywords

ALGEBRA; LIST PROCESSING LANGUAGES; SEMANTICS; THEOREM PROVING;

FUNCTIONAL PROGRAMMING; PROGRAM TRANSFORMATION; SHORT-CUT FUSION;

DATA STRUCTURES;

EID: 0037667700     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022982420888     Document Type: Article

References (25)

1. Abadi, M. TT-closed relations and admissibility. Mathematical Structures in Computer Science, 10 (2000) 313-320.
2. Bainbridge, E.S., Freyd, P.J., Scedrov, A., and Scott, P.J. Functional polymorphism. Theoretical Computer Science, 70(1) (1990) 35-64. Corrigendum in 71(3) (1990) 431.
3. Bierman, G.M., Pitts, A.M., and Russo C.V. Operational semantics of Lily, a polymorphic linear lambda calculus with recursion. Electronic Notes in Theoretical Computer Science, 41(3) (2000).
4. Chitil, O. Type inference builds a short cut to deforestation. In Proceedings, International Conference on Functional Programming, 1999, pp. 249-260.
5. Fiore, M. and Plotkin, G. An axiomatization of computationally adequate domain theoretic models of FPC. In Proceedings, 9th Annual Symposium on Logic in Computer Science, 1994, pp. 92-102.
6. Gill, A. Cheap Deforestation for Non-strict Functional Languages. PhD Thesis, Glasgow University, 1996.
7. Gill, A., Launchbury, J., and Peyton Jones, S.L. A short cut to deforestation. In Proceedings, Conference on Functional Languages and Computer Architecture, 1993, pp. 223-232.
8. Hu, Z., Iwasaki, H., and Takeichi, M. Deriving structural hylomorphisms from recursive definitions. In Proceedings, International Conference on Functional Programming, 1996, pp. 73-82.
9. Johann, P. An implementation of warm fusion. Available at ftp://ftp.cse.ogi.edu/pub/pacsoft/wf/. 1997.
10. Johann, P. Short cut fusion is correct. Journal of Functional Programming. To appear.
11. Johann, P. and Visser, E. Warm fusion in Stratego: A case study in generation of program transformation systems. Annals of Mathematics and Artificial Intelligence, 29(1-4) (2000) 1-34.
12. Lassen, S.B. Relational Reasoning about Functions and Nondetermination. PhD Thesis, University of Aarhus, 1998.
13. Lunchbury, J. and Sheard, T. Warm fusion: Deriving build-catas from recursive definitions. In Proceedings, Conference on Functional Programming and Computer Architecture, 1995, pp. 314-323.
14. Mason, I.A., Smith, S.F., and Talcott, C.L. From operational semantics to domain theory. Information and Computation, 128(1) (1996) 26-47.
15. Németh, L. Catamorphism Based Program Transformations for Non-Strict Functional Languages. PhD Thesis, Glasgow University, 2000.
16. Onoue, Y., Hu, Z., Iwasaki, H., and Takeichi, M. A calculational system HYLO. In Proceedings, IFIP TC 2 Working Conference on Algorithmic Languages and Calculi, 1997, pp. 76-106.
17. Pitts, A. Existential types: Logical relations and operational equivalence. In Proceedings, International Colloquium on Automata, Languages, and Programming, LNCS, Vol. 1443, 1998, pp. 309-326.
18. Pitts, A. Parametric polymorphism, recursive types, and operational equivalence. Unpublished Manuscript (1998).
19. Pitts, A. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10 (2000) 1-39.
20. Reynolds, J.C. Toward a theory of type structure. Paris Colloquium on Programming, LNCS, Vol. 19, 1974, pp. 408-425.
21. Reynolds, J.C. Types, abstraction, and parametric polymorphism. Information Processing, 83 (1983) 513-523.
22. Sheard, T. and Fegaras, L. A fold for all seasons. In Proceedings, Conference on Functional Programming and Computer Architecture, 1993, pp. 233-242.
23. Takano, A. and Meijer, E. Shortcut deforestation in calculational form. In Proceedings, Conference on Functional Programming and Computer Architecture, 1995, pp. 324-333.
24. Tarski, A. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5 (1955) 285-309.
25. Wadler, P. Theorems for free! In Proceedings, Conference on Functional Programming and Computer Architecture, 1989, pp. 347-359.