Monadic augment and generalised short cut fusion

ACM SIGPLAN Notices

Volumn 40, Issue 9, 2005, Pages 294-305

  Ghani, Neil ^a   Johann, Patricia ^b   Uustalu, Tarmo ^c   Vene, Varmo ^d  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b RUTGERS UNIVERSITY   (United States)

^c TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

^d UNIVERSITY OF TARTU   (Estonia)

Author keywords

Augment; Bind; Build; Monads; Short cut fusion

Indexed keywords

COMBINATORIAL MATHEMATICS; DATA STRUCTURES; OPTIMIZATION;

AUGMENT; BIND; BUILD; MONADS; SHORT CUT FUSION;

COMPUTER PROGRAMMING;

EID: 33745211455     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1090189.1086403     Document Type: Article

References (24)

1. O. Chitil. Type inference builds a short cut to deforestation. In International Conference on Functional Programming, Proceedings, pages 249-260, 1999.
2. L. Fegaras and T. Sheard. Revisiting catamorphisms over datatypes with embedded functions. In Principles of Programming Languages, Proceedings, pages 284-194, 1996.
3. N. Ghani, T. Uustalu, and V. Vene. Build, augment and destroy. Universally. In Asian Symposium on Programming Languages, Proceedings, pages 327-347. 2004.
4. N. Ghani, T. Uustalu, and V. Vene. Generalizing the AUGMENT combinator. In Trends in Functional Programming 5, 2005. To appear.
5. A. Gill. Cheap Deforestation for Non-strict Functional Languages. PhD thesis, Univ. of Glasgow, 1996.
6. A. Gill, J. Launchbury, and S. L. Peyton Jones. A short cut to deforestation. In Functional Programming Languages and Computer Architecture, Proceedings, pages 223-232, 1993.
7. Z. Hu, H. Iwasaki, and M. Takeichi. Deriving structural hylomorphisms from recursive definitions. In International Conference on Functional Programming, Proceedings, pages 73-82. 1996.
8. P. Johann. A generalization of short-cut fusion and its correctness proof. Higher-Order and Symbolic Computation, 15:273-300, 2002.
9. C. Juergensen. Using monads to fuse recursive programs (extended abstract), citeseer.ist.psu.edu/543861.html.
10. J. Launchbury, S. Krstic, and T. Sauerwein. Zip fusion with hyper-functions, citeseer.ist.psu.edu/launchbury00zip.html.
11. E. Meijer and G. Hutton. Bananas in space: Extending folds and unfolds to exponential types. In Functional Programming and Computer Architecture, Proceedings, pages 324-333, 1995.
12. E. Meijer and J. Jeuring. Merging monads and folds for functional programming. In Advanced Functional Programming, Proceedings, pages 228-266, 1995.
13. E. Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
14. A. Pardo. Fusion of recursive programs with computational effects. Theoretical Computer Science, 260(1-2):165-207, 2001.
15. S. Peyton Jones, A. Tolmach, and T. Hoare. Playing by the rules: Rewriting as an optimization technique in GHC. In Haskell Workshop, Proceedings, pages 203-233, 2001.
16. S. L. Peyton Jones, editor. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003.
17. A. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10:1-397, 2000.
18. G. Plotkin and J. Power. Notions of computation determine monads. In Foundations of Software Science and Computation Structure, Proceedings, pages 342-356, 2002.
19. T. Sheard and L. Fegaras. A fold for all seasons. In Functional Programming Languages and Computer Architecture, Proceedings, pages 233-242. 1993.
20. J. Svenningsson. Shortcut fusion for accumulating parameters and zip-like functions. In International Conference on Functional Programming, Proceedings, pages 124-132, 2002.
21. A. Takano and E. Meijer. Shortcut deforestation in calculational form. In Functional Programming Languages and Computer Architecture, Proceedings, pages 306-313, 1995.
22. T. Uustalu. Generalizing substitution. Theoretical Informatics and Applications, 37(4):315-336, 2003.
23. J. Voigtländer. Concatenate, reverse and map vanish for free. In International Conference on Functional Programming, Proceedings, pages 14-25, 2002.
24. P. Wadler. The essence of functional programming. In Principles of Programming Languages, Proceedings, pages 1-14, 1992.