Short cut fusion is correct

Journal of Functional Programming

Volumn 13, Issue 4, 2003, Pages 797-814

  Johann, Patricia ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SHORT CUT FUSION;

COMPUTER PROGRAMMING; DATA PROCESSING; LIST PROCESSING LANGUAGES; RECURSIVE FUNCTIONS; SET THEORY;

DATA STRUCTURES;

EID: 0038720294     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796802004409     Document Type: Article

References (16)

1. Abadi, M. (2000) TT-closed relations and admissibility. Mathematical Structures in Comput. Sci., 10: 313-320.
2. Bainbridge, E. S., Freyd, P. J., Scedrov, A. and Scott, P. J. (1990) Functorial polymorphism. Theor. Comput. Sci., 70(1): 35-64. (Corrigendium in 71(3): 431, 1990.)
3. Chitil, O. (1999) Type inference builds a short cut to deforestation. Proceedings International Conference on Functional Programming, pp. 249-260.
4. Gill, A. (1996) Cheap Deforestation for Non-strict Functional Languages. PhD thesis, Glasgow University.
5. Gill, A., Launchbury, J. and Peyton Jones, S. L. (1993) A short cut to deforestation. Proceedings Conference on Functional Languages and Computer Architecture, pp. 223-232.
6. Johann, P. (1997) An implementation of warm fusion. (Available at ftp://ftp.cse.ogi.edu/pub/pacsoft/wf/.)
7. Johann, P. (2001) Short cut fusion: Proved and improved. Proceedings Workshop on Semantics, Applications and Implementation of Program Generation: Lecture Notes in Computer Science 2196, pp. 47-71. Springer-Verlag.
8. Johann, P. and Visser, E. (2000) Warm fusion in Stratego: a case study in generation of program transformation systems. Annals of Mathematics & Artif. Intell., 29(1-4): 1-34.
9. Németh, L. (2000) Catamorphism Based Program Transformations for Non-strict Functional Languages. PhD thesis, Glasgow University.
10. Pitts, A. (1998) Existential types: Logical relations and operational equivalence. Proceedings International Colloquium on Automata, Languages and Programming: Lecture Notes in Computer Science 1443, pp. 309-326.
11. Pitts, A. (1998) Parametric polymorphism, recursive types, and operational equivalence. Unpublished Manuscript.
12. Pitts, A. (2000) Parametric polymorphism and operational equivalence. Mathematical Structures in Comput. Sci., 10: 1-39.
13. Takano, A. and Meijer, E. (1995) Shortcut deforestation in calculational form. Proceedings Conference on Functional Programming and Computer Architecture, pp. 324-333.
14. Reynolds, J. C. (1983) Types, abstraction, and parametric polymorphism. Infor. Process., 83: 513-523.
15. Sheard, T. and Fegaras, L. (1993) A fold for all seasons. Proceedings Conference on Functional Programming and Computer Architecture, pp. 233-242.
16. Wadler, P. (1989) Theorems for free! Proceedings Conference on Functional Programming and Computer Architecture, pp. 347-359.