Stream fusion: From lists to streams to nothing at all

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

Volumn , Issue , 2007, Pages 315-326

  Coutts, Duncan ^a   Leshchinskiy, Roman ^b   Stewart, Don ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Deforestation; Functional programming; Program fusion; Program optimisation; Program transformation

Indexed keywords

PROGRAM FUSION; PROGRAM OPTIMIZATION; PROGRAM TRANSFORMATION; PROGRAM TRANSFORMATIONS;

DATA FUSION; FUNCTIONAL PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROGRAM COMPILERS;

DEFORESTATION;

COMPUTER PROGRAMS; DEFORESTATION; OPTIMIZATION;

EID: 38849134072     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1291151.1291199     Document Type: Conference Paper

References (25)

1. Olaf Chitil. Type inference builds a short cut to deforestation. In ICFP '99: Proceedings of the fourth ACM SlGPLAN International Conference on Functional programming, pages 249-260, New York, NY, USA, 1999. ACM Press.
2. Olaf Chitil. Promoting non-strict programming. In Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006, pages 512-516, Budapest, Hungary, September 2006. Eotvos Lorand University.
3. Duncan Coutts, Don Stewart, and Roman Leshchinskiy. Rewriting Haskell strings. In Practical Aspects of Declarative Languages 8th International Symposium, PADL 2007, pages 50-64. Springer-Verlag, January 2007.
4. Nils Anders Danielsson and Patrik Jansson. Chasing bottoms, a case study in program verification in the presence of partial and infinite values. In Dexter Kozen, editor, Proceedings of the 7th International Conference on Mathematics of Program Construction, MPC 2004, volume 3125 of LNCS, pages 85-109. Springer-Verlag, July 2004.
5. Jeremy Gibbons. Streaming representation-changers. In D. Kozen, editor, Mathematics of Program Construction, pages 142-168. Springer-Verlag, 2004. LNCS 523.
6. Jeremy Gibbons and Geraint Jones. The under-appreciated unfold. In ICFP '98: Proceedings of the third ACM SIGPLAN International Conference on Functional programming, pages 273-279, New York, NY, USA, 1998. ACM Press.
7. Andrew Gill. Cheap Deforestation for Non-strict Functional Languages. PhD thesis, University of Glasgow, January 1996.
8. Andrew Gill, John Launchbury, and Simon Peyton Jones. A short cut to deforestation. In Conference on Functional Programming Languages and Computer Architecture, pages 223-232, June 1993.
9. Zhenjiang Hu, Hideya Iwasaki, and Masato Takeichi. Deriving structural hylomorphisms from recursive definitions. In Proceedings 1st ACM SlGPLAN International Conference on Functional Programming, volume 31(6), pages 73-82. ACM Press, New York, 1996.
10. Patricia Johann. Short cut fusion: Proved and improved. In SAIG 2001: Proceedings of the Second International Workshop on Semantics, Applications, and Implementation of Program Generation, pages 47-71, London, UK, 2001. Springer-Verlag.
11. Thomas Johnsson. Lambda lifting: transforming programs to recursive equations. In Functional programming languages and computer architecture. Proc. of a conference (Nancy, France, Sept. 1985), New York, NY, USA, 1985. Springer-Verlag Inc.
12. John Launchbury and Ross Paterson. Parametricity and unboxing with unpointed types. In European Symposium on Programming, pages 204-218, 1996.
13. John Launchbury and Tim Sheard. Warm fusion: deriving buildcatas from recursive definitions. In FPCA '95: Proceedings of the seventh international conference on Functional programming languages and computer architecture, pages 314-323, New York, NY, USA, 1995. ACM Press.
14. Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In J. Hughes, editor, Proceedings 5th ACM Conf. on Functional Programming Languages and Computer Architecture, FPCA'91, Cambridge, MA, USA, 26-30 Aug 1991, volume 523, pages 124-144. Springer-Verlag, Berlin, 1991.
15. Will Partain. The nofib benchmark suite of Haskell programs. In Functional Programming, pages 195-202, 1992.
16. Simon Peyton Jones. Constructor Specialisation for Haskell Programs, 2007. Submitted for publication.
17. Simon Peyton Jones and André L. M. Santos. A transformation-based optimiser for Haskell. Sci. Comput. Program., 32(1-3): 3-47, 1998. ISSN 0167-6423.
18. Simon Peyton Jones, Andrew Tolmach, and Tony Hoare. Playing by the rules: rewriting as a practical optimisation technique in GHC. In Ralf Hinze, editor, 2001 Haskell Workshop. ACM SIGPLAN, September 2001.
19. Simon Peyton Jones et al. The Haskell 98 language and libraries: The revised report. Journal of Functional Programming, 13(1): 0-255, Jan 2003.
20. Colin Runciman. SmallCheck 0.2: another lightweight testing library in Haskell. http://article.gmane.org/gmane.comp.lang.haskell.general/14461, 2006.
21. Josef Svenningsson. Shortcut fusion for accumulating parameters & zip-like functions. In ICFP '02: Proceedings of the seventh ACM SIGPLAN International Conference on Functional programming, pages 124-132, New York, NY, USA, 2002. ACM Press.
22. Akihiko Takano and Erik Meijer. Shortcut deforestation in calculational form. In Conf. Record 7th ACM SIGPLAN/SIGARCH Int. Conf. on Functional Programming Languages and Computer Architecture, FPCA'95, pages 306-313. ACM Press, New York, 1995.
23. The GHC Team. The Glasgow Haskell Compiler (GHC). http://haskell.org/ghc, 2007.
24. Philip Wadler. List comprehensions. In Simon Peyton Jones, editor, The implementation of functional programming languages. Prentice Hall, 1987. Chapter 15.
25. Philip Wadler. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, (Special issue of selected papers from 2nd European Symposium on Programming), 73(2): 231-248, 1990.