Eager Haskell: Resource-bounded execution yields efficient iteration

Proceedings of the 2002 ACM SIGPLAN Haskell Workshop

Volumn , Issue , 2002, Pages 38-50

  Maessen, Jan Willem ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER SOFTWARE; ITERATIVE METHODS; PROGRAM COMPILERS; SEMANTICS;

RESOURCE BOUNDS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0036983397     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (41)

1. H. Abelson and G. J. Sussman. Structure and Interpretation of Computer Programs. MIT Press, Boston, 1986.
2. Shail Aditya, Arvind, Lennart Augustsson, Jan-Willem Maessen, and Rishiyur S. Nikhil. Semantics of pH: A Parallel Dialect of Haskell. In Proceedings of the Haskell Workshop, FPCA 95, La Jolla, CA, June 1995.
3. Shail Aditya, Arvind, and Joseph Stoy. Semantics of barriers in a non-strict, implicitly-parallel language. In Proceedings of the 7th ACM Conference on Functional Programming Languages and Computer Architecture, La Jolla, CA, June 1995. ACM.
4. Andrew W. Appel. Garbage Collection can be Faster than Stack Allocation. Information Processing Letters, 25(4), January 1987.
5. Z. M. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. The call-by-need lambda calculus. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 233-246. ACM, 1995. Full version in [7]; see also [20, 21].
6. Z. M. Ariola and J. W. Klop. Cyclic lambda graph rewriting. In IEEE Symposium on Logic in Computer Science, pages 416-425, Paris, France, 1994. IEEE.
7. Zena M. Ariola and M. Felleisen. The call-by-need lambda calculus. Journal of Functional Programming, 7(3):265-301, May 1997. Full version of [5].
8. Arvind, Alejandro Caro, Jan-Willem Maessen, and Shail Aditya. A multithreaded substrate and compilation model for the implicitly parallel language pH. In Proceedings of the Workshop on Languages and Compilers for Parallel Computing, August 1996.
9. S: An implicitly parallel λ-calculus with letrec, synchronization and side-effects. Technical Report 393-2, MIT Computation Structures Group Memo, October 1998. (Full version of [10] with proofs).
10. S: An implicitly parallel λ-calculus with letrec, synchronization and side-effects. Electronic Notes in Theoretical Computer Science, 16(3), September 1998.
11. Arvind, Rishiyur Sivaswami Nikhil, and Keshav Kumar Pingali. I-Structures: Data Structures for Parallel Computing. ACM Transactions on Programming Languages and Systems, 11(4):598-632, October 1989.
12. Lennart Augustsson and et al. The HBC Compiler. Chalmers University of Technology, 0.9999.4 edition.
13. Alejandro Caro. Generating Multithreaded Code from Parallel Haskell for Symmetric Multiprocessors. PhD thesis, MIT, January 1999.
14. Faxén, Karl-Filip. Cheap eagerness: speculative evaluation in a lazy functional language. In Proceedings of the fifth ACM SIGPLAN ACM SIGPLAN International Conference on Functional Programming, pages 150-161, Montreal, September 2000. ACM.
15. Thomas Johnsson. Compiling Lazy Functional Languages. PhD thesis, Chalmers University of Technology, Göteborg, 1987.
16. Mark P. Jones. Partial evaluation for dictionary-free overloading. Technical Report RR-959, Yale University Department of Computer Science, New Haven, CT, 1993.
17. Mark P. Jones, Alastair Reid, the Yale Haskell Group, and the OGI School of Science & Engineering. The Hugs 98 User Manual.
18. Jan-Willem Maessen. Eliminating intermediate lists in pH using local transformations. Master's thesis, MIT, May 1994.
19. Jan-Willem Maessen. Hybrid Eager and Lazy Evaluation for Efficient Compilation of Haskell. PhD thesis, MIT, Cambridge, MA, May 2002.
20. John Maraist, Martin Odersky, and Philip Wadler. The call-by-need lambda calculus. Technical report, Fakultat fur Informatik, Universitat Karlsruhe, and Department of Computing Science, University of Glasgow, October 1994. Superseded by [21].
21. John Maraist, Martin Odersky, and Philip Wadler. The call-by-need lambda calculus. Journal of Functional Programming, 8(3):275-317, 1998. Revision of [20]; see also [5].
22. James S. Miller and Guillermo J. Rozas. Garbage collection is fast, but a stack is faster. Technical Report AIM-1462, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 1994.
23. Rishiyur S. Nikhil and Arvind. Implicit Parallel Programming in pH. Morgan Kaufman, Inc., 2001.
24. Rishiyur S Nikhil, Arvind, and James Hicks, et al. pH language reference manual, version 1.0-preliminary. Technical Report 369, MIT Computation Structures Group Memo, January 1995. Working document describing pH extensions to Haskell.
25. Rishiyur Sivaswami Nikhil. Id (Version 90.1) Language Reference Manual. Technical Report CSG Memo 284-2, MIT Computation Structures Group Memo, 545 Technology Square, Cambridge MA 02139, USA, July 1991.
26. Rishiyur Sivaswami Nikhil. An Overview of the Parallel Language Id (a foundation for pH, a parallel dialect of Haskell). Technical Report Draft, Digital Equipment Corp., Cambridge Research Laboratory, September 1993.
27. Will Partain. The nofib benchmark suite of Haskell programs. In J Launchbury and PM Sansom, editors, Functional Programming, Glasgow 1992, pages 195-202. Springer-Verlag, 1992.
28. Simon L Peyton Jones. The Implementation of Functional Programming Languages. Prentice Hall, 1987.
29. Simon L. Peyton Jones. Implementing Lazy Functional Languages on Stock Hardware: the Spineless Tagless G-machine. Journal of Functional Programming, 2(2), April 1992.
30. Simon L. Peyton Jones, C. A. R. Hoare, and Andrew Tolmach. Playing by the rules: rewriting as a practical optimisation technique. In Proceedings of the Haskell Workshop, 2001.
31. Simon L Peyton Jones and John Hughes. Haskell 98, a non-strict, purely functional language. http://www.haskell.org/definition/, February 1999.
32. Simon L Peyton Jones and John Hughes. Standard libraries for Haskell 98. http://www.haskell.org/definition/, February 1999.
33. Simon L. Peyton Jones and Will Partain. Measuring the Effectiveness of a Simple Strictness Analyser. In K. Hammond and J.T. O'Donnell, editors, Proceedings of the Glasgow Workshop on Functional Programming, Workshops in Computing. Springer Verlag, 1993.
34. Simon L. Peyton Jones and André L. M. Santos. A transformation-based optimiser for Haskell. Science of Computer Programming, 32(1-3):3-4-7, 1998.
35. Niklas Röjemo. Garbage Collection and Memory Efficiency in Lazy Functional Languages. PhD thesis, Chalmers University of Technology, Göteborg, Sweden, 1995. Full version of [36] and other papers.
36. Niklas Röjemo. Highlights from nhc-a space-efficient Haskell compiler. In Proceedings of the 7th ACM Conference on Functional Programming Languages and Computer Architecture, La Jolla, CA, June 1995. ACM. Expanded in [35].
37. Amr Sabry. What is a purely functional language? Journal of Functional Programming, 8(1):1-22, January 1998.
38. Klaus E. Schauser and Seth C. Goldstein. How Much Non-strictness do Lenient Programs Require? In Functional Programming and Computer Architecture, San Diego, CA, June 1995.
39. Andrew Shaw. Compiling for Parallel Multithreaded Computation on Symmetric Multiproeessors. PhD thesis, MIT, October 1997.
40. Joseph E. Stoy. The Semantics of Id. In A Classical Mind: Essays in Honor of C.A.R. Hoare (A. W. Roscoe, ed.), pages 379-404. Prentice Hall, New York, 1994.
41. The GHC Team. The Glasgow Haskell Compiler User's Guide, Version 5.02.