Fusion in practice

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2670, Issue , 2003, Pages 51-67

  Van Arkel, Diederik ^a   Van Groningen, John ^a   Smetsers, Sjaak ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DEFORESTATION;

FUNCTIONAL PROGRAMS; FUSION ALGORITHMS; HIGHER ORDER FUNCTIONS; TRANSFORMATION RULES;

ALGORITHMS;

EID: 33645400219     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44854-3_4     Document Type: Article

References (22)

1. P. Achten, A. Alimarine, R. Plasmeijer. When Generic Functions Use Dynamic Values. Post-workshop submission: 14th International Workshop on the Implementation of Functional Languages, IFL 2002, Madrid, Spain, September 2002.
2. A. Alimarine and R. Plasmeijer. A Generic Programming Extension for Clean. In: Arts, Th., Mohnen M., eds. Proceedings of the 13th International Workshop on the Implementation of Functional Languages, IFL 2001, Selected Papers, Älvsjö, Sweden, September 24-26, 2001, Springer-Verlag, LNCS 2312, pages 168-185.
3. W.-N. Chin. Safe fusion of functional expressions II: Further improvements Journal of Functional Programming, Volume 6, Part 4, pp 515-557, 1994.
4. ∼clean/contents/contents.html
5. ∼clean/contents/contents.html
6. L. Fegaras, T. Sheard, and T. Zhou. Improving Programs which Recurse over Multiple Inductive Structures. In Proc. of ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, Orlando, FL, USA, June 1994
7. A. Ferguson and P. Wadler. When will Deforestation Stop. In Proc. of 1988 Glasgow Workshop on Functional Programming, pp 39-56, Rothasay, Isle of Bute, August 1988.
8. J. Fokker. Functional Specification of the JPEG algorithm, and an Implementation for Free, In Programming Paradigms in Graphics, Proceedings of the Eurographics workshop in Maastricht, the Netherlands, september 1995, Wien, Springer 1995, pp102-120.
9. A. Gill. Cheap Deforestation for Non-strict Functional Languages,PhD Thesis, Department of Computing Science, Glasgow University, 1996.
10. A. Gill, S. Peyton Jones, J. Launchbury. A Short Cut to Deforestation, Proc. Functional Programming Languages and Computer Architecture (FPCA'93), Copenhagen, June 1993, pp223-232.
11. P. Hartel, K. Langendoen. Benchmarking Implementations of Lazy Functional Languages, In Proc. of Functional Programming Languages and Computer Architecture, 1993, pp341-349.
12. P. Hartel, et al. Pseudoknot: A Float-Intensive Benchmark for Functional Compilers, 6th Implementation of Functional Languages, School of Information Systems, University of East Anglia, Norwich, UK, 1994, pp13.1-13.34.
13. P. Hudak, S. Peyton Jones, P. Wadler, B. Boutel, J. Fairbairn, J. Fasel, K. Hammond, J. Hughes, Th. Johnsson, D. Kieburtz, R. Nikhil, W. Partain, J. Peterson. Report on the programming language Haskell, In ACM SigPlan Notices, 27 (5): 1-164. May 1992.
14. R. Hinze and S. Peyton Jones. Derivable Type Classes. In Graham Hutton, editor, Proceedings of the Fourth Haskell Workshop, Canada, 2000.
15. S. Manow. Deforestation for Higher-Order Functional Programs PhD Thesis, Department of Computer Science, University of Glasgow, 1995.
16. S. Peyton Jones, S. Marlow. Secrets of the Glasgow Haskell Compiler inliner Workshop on Implementing Declarative Languages, 1999.
17. C. Okasaki. Purely Functional Data Structures Cambridge University Press, ISBN 0-521-63124-6, 1998.
18. H. Seidl, M.H. Sørensen. Constraints to Stop Higher-Order Deforestation In 24th ACM Symp. on Principles of Programming Languages, pages 400-413, 1997.
19. A. Takano, E. Meijer. Shortcut to Deforestation in Calculational form, Proc. Functional Programming Languages and Computer Architecture (FPCA'95), La Jolla, June 1995, pp 306-313.
20. S. Taylor.Optimization of Mercury programs Honours report, Department of Computer Science, University of Melbourne, Australia , November 1998.
21. P. Wadler. Deforestation: Transforming Programs to Eliminate Trees Proceedings of the 2nd European Symposium on Programming, Nancy, France, March 1988. Lecture Notes in Computer Science 300.
22. P. Wadler, S. Blott. How to make ad-hoc polymorphism less ad hoc In Proceedings 16th ACM Symposium on Principles of Programming Languages, pages 60-76, 1989.