Shortcut fusion for accumulating parameters and zip-like functions

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2002, Pages 124-132

  Svenningsson, Josef ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Deforestation; Functional programming; Intermediate data structures; Optimisation; Program transformation

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; OPTIMIZATION; PROGRAM COMPILERS;

ACCUMULATING PARAMETERS; PROGRAM TRANSFORMATIONS; SHORTCUT FUSION;

LOGIC PROGRAMMING;

EID: 0036953802     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/583852.581491     Document Type: Conference Paper

References (29)

1. Loic Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. How to deforest in accumulative parameters? Technical Report 3608, INRIA, January 1999.
2. W. Chin. Safe Fusion for Function Expressions. In Proceedings of the ACM Symposium on Lisp and Functional Programming, pages 11-20, San Francisco, California, June 1992
3. Olaf Chitil. Type inference builds a short cut to deforestation. In Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming, volume 34 of ACM Sigplan Notices, pages 249-260, 1999.
4. L. Fegaras. Using the parametricity theorem for program fusion. Technical Report 96-001, Oregon Graduate Institute, 1996.
5. L. Fegaras, T. Sheard, and T. Zhou. Improving programs which recurse over multiple inductive structures. In ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, Orlando, Florida, June 1994.
6. A. Gill. Cheap Deforestation for Non-strict Functional Languages. PhD thesis, University of Glasgow, 1996.
7. Jeremy Gibbons and Geraint Jones. The under-appreciated unfold. In Proceedings 3rd ACM SIGPLAN Int. Conf. on Functional Programming, ICFP'98, Baltimore, MD, USA, 26-29 Sept 1998, pages 273-279. ACM Press, New York, 1998.
8. A. Gill, J. Launchbury, and S. Peyton Jones. A Short Cut to Deforestation. In Functional Programming and Computer Architecture, pages 223-232, Copenhagen, Denmark, June 1993
9. Jörgen Gustavsson and David Sands. Possibilities and limitations of call-by-need space improvement. In Proceeding of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP'01), pages 265-276. ACM Press, September 2001.
10. G.W. Hamilton. Extending higher order deforestation: Transforming programs to eliminate even more trees. In Proceedings of the Third Scottish Functional Programming Workshop, Stirling, Scotland, August 2001.
11. Zhenjiang Hu, Hideya Iwasaki, and Masato Takeichi. An Extension of the Acid Rain Theorem. In 2nd Fuji International Workshop on Functional and Logic Programming, 91-105, Shonan Village, Japan, November 1996. World Scientific.
12. S. Peyton Jones and J. Hughes. Haskell 98 library report, February 1999.
13. S. Peyton Jones and J. Hughes. Haskell 98 report, February 1999.
14. Patricia Johann. Short cut fusion: Proved and improved. In W. Taha, editor, Proceedings of the Second International Workshop on Semantics, Applications, and Implementation of Program Generation, volume LNCS 2196 of Lecture Notes in Computer Science, Florence, Italy, September 6 2001. Springer.
15. J. Launchbury, S. Krstic', and T. E. Sauerwein. Zip Fusion with Hyperfunctions. Oregon Graduate Institute, 2000.
16. Simon Marlow. Deforestation for Higher-Order Functional Programs. PhD thesis, University of Glasgow, 1996.
17. Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. In John Hughes, editor, Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA), volume 523 of LNCS. Springer-Verlag, 1991.
18. S. Peyton Jones and A. Santos. A transformation-based optimiser for Haskell. Science of Computer Programming, 32(1-3):3-47, 1998.
19. S. Peyton Jones, A. Tolmach, and T. Hoare. Playing by the rules: rewriting as a practical optimisation technique in GHC. In Haskell Workshop, 2001.
20. D. Sands. Improvement theory and its applications. In A. D. Gordon and A. M. Pitts, editors, Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, pages 275-306. Cambridge University Press, 1998.
21. T. Sheard and L. Fegaras. A Fold for All Seasons. In Sixth Conference on Functional Programming Languages and Computer Architecture, pages 233-242, Copenhagen, June 1993.
22. A. Takano and E. Meijer. Shortcut deforestation in calculational form. In Simon L Peyton Jones, editor, Functional Programming and Computer Architecture, San Diego, 1995. ACM
23. J. Voigtländer and A. Kühnemann. Composition of functions with accumulating parameters. Technical Report TUD-FI01-08, Dresden University of Technology, 2001.
24. J. Voigtländer. Concatenate, reverse and map vanish for free. In Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP'02). ACM Press, 2002.
25. J. Voigtländer. Using Circular Programs to Deforest in Accumulating Parameters. In Proceeding of the Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation (ASIA-PEPM'02). ACM Press, 2002.
26. P. Wadler. Listlessness is Better than Laziness: Lazy Evaluation and Garbage Collection at Compile-time. In Proceedings of the ACM Symposium on Lisp and Functional Programming, Austin, Texas, 1984.
27. Philip Wadler. Views: a way for pattern matching to cohabit with data abstraction. In 14'th ACM Symposium on Principles of Programming Languages, Munich, Germany, January 1987.
28. Philip Wadler. Theorems for free! In 4'th International Conference on Functional Programming and Computer Architecture, London, September 1989.
29. Philip Wadler. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, 73:231-248, 1990.