Compiling Haskell by program transformation: A report from the trenches

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

Volumn 1058, Issue , 1996, Pages 18-44

  Jones, Simon L Peyton ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPILATION PROCESS; GLASGOW HASKELL COMPILERS; HASKELL; PRACTICAL EXPERIENCE; PROGRAM TRANSFORMATIONS; TRANSFORMATIONAL APPROACH;

PROGRAM COMPILERS;

EID: 84947942223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61055-3_27     Document Type: Conference Paper

References (47)

1. AV Aho, R Sethi & JD Ullman [1986], Compilers-principles, techniques and tools, Addison Wesley.
2. AW Appel [1992], Compiling with continuations, Cambridge University Press.
3. AW Appel & T Jim [1996], "Shrinking Lambda-Expressions in Linear Time", Department of Computer Science, Princeton University.
4. Z Ariola, M Felleisen, J Maraist, M Odersky & P Wadler [Jan 1995], "A call by need lambda calculus", in 22nd ACM Symposium on Principles of Programming Languages, San Francisco, ACM, 233-246.
5. L Augustsson [1987], "Compiling lazy functional languages, part II", PhD thesis, Dept Comp Sci, Chalmers University, Sweden.
6. DF Bacon, SL Graham & OJ Sharp [Dec 1994], "Compiler transformations for high-performance computing", ACM Computing Surveys 26, 345-420.
7. B Calder, D Grunwald & B Zorn [Dec 1994], "Quantifying behavioural differences between C and C++ programs", Journal of Programming Languages2, 313-351.
8. C Chambers, J Dean & D Grove [Apr 1995], "A framework for selective recompilation in the presence of complex intermodule dependencies", in Proc International Conference on Software Engineering, Seattle.
9. JW Davidson & AM Holler [1988], "A study of a C function inliner", Software-Practice and Experience 18, 775-790.
10. C Flanagan, A Sabry, B Duba & M Felleisen [June 1993], "The essence of compiling with continuations", SIGPLAN Notices 28, 237-247.
11. P Fradet & D Le Metayer [Jan 1991], "Compilation of functional languages by program transformation", ACM Transactions on Programming Languages and Systems 13, 21-51.
12. A Gill, J Launchbury & SL Peyton Jones [June 1993], "A short cut to deforestation", in Proc Functional Programming Languages and Computer Architecture, Copenhagen, ACM, 223-232.
13. AJ Gill [Jan 1996], "Cheap deforestation for non-strict functional languages", PhD thesis, Department of Computing Science, Glasgow University.
14. J Girard [1971], "Une extension de l'interpretation de Gödel a l'analyse, et son application a l'elimination de coupures dans l'analyse et la theorie des types", in 2nd Scandinavian Logic Symposium, JE Fenstad, ed., North Holland, 63-92.
15. R Harper & G Morrisett [Jan 1995], "Compiling polymorphism using intensional type analysis", in 22nd ACM Symposium on Principles of Programming Languages, San Francisco, ACM, 130-141.
16. P Hudak, SL Peyton Jones, PL Wadler, Arvind, B Boutel, J Fairbairn, J Fasel, M Guzman, K Hammond, J Hughes, T Johnsson, R Kieburtz, RS Nikhil, W Partain & J Peterson [May 1992], "Report on the functional programming language Haskell, Version 1. 2", SIGPLAN Notices 27.
17. RJM Hughes [July 1983], "The design and implementation of programming languages", PhD thesis, Programming Research Group, Oxford.
18. Thomas Johnsson [1985], "Lambda lifting: transforming programs to recursive equations", in Proc IFIP Conference on Functional Programming and Computer Architecture, Jouannaud, ed., LNCS 201, Springer Verlag, 190-205.
19. R Kelsey [May 1989], "Compilation by program transformation", YALEU/DCS/RR-702, PhD thesis, Department of Computer Science, Yale University.
20. R Kelsey & P Hudak [Jan 1989], "Realistic compilation by program transformation", in Proc ACM Conference on Principles of Programming Languages, ACM, 281-292.
21. DA Kranz [May 1988], "ORBIT-an optimising compiler for Scheme", PhD thesis, Department of Computer Science, Yale University.
22. DA Kranz, R Kelsey, J Rees, P Hudak, J Philbin & N Adams [1986], "ORBIT-an optimising compiler for Scheme", in Proc SIGPLAN Symposium on Compiler Construction, ACM.
23. J Launchbury [Jan 1993], "A natural semantics for lazy evaluation", in 20th ACM Symposium on Principles of Programming Languages, Charleston, ACM, 144-154.
24. J Launchbury & SL Peyton Jones [June 1994], "Lazy functional state threads", in SIGPLAN Symposium on Programming Language Design and Implementation (PLDI'94), Orlando, ACM, 24-35.
25. S Marlow [March 1996], "Deforestation for Higher Order Functional Programs", PhD thesis, Department of Computing Science, University of Glasgow.
26. R Morrison, A Dearle, RCH Connor & AL Brown [July 1991], "An ad hoc approach to the implementation of polymorphism", ACM Transactions on Programming Languages and Systems 13, 342-371.
27. A Ohori [Jan 1992], "A compilation method for ML-style polymorphic record calculi", in 19th ACM Symposium on Principles of Programming Languages, Albuquerque, ACM, 154-165.
28. WD Partain [1993], "The nofib Benchmark Suite of Haskell Programs", in Functional Programming, Glasgow 1992, J Launchbury & PM Sansom, eds., Workshops in Computing, Springer Verlag, 195-202.
29. SL Peyton Jones [1987], The Implementation of Functional Programming Languages, Prentice Hall.
30. SL Peyton Jones [Apr 1992], "Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine", Journal of Functional Programming 2, 127-202.
31. SL Peyton Jones, CV Hall, K Hammond, WD Partain & PL Wadler [March 1993], "The Glasgow Haskell compiler: a technical overview", inProceedings of Joint Framework for Information Technology Technical Conference, Keele, DTI/SERC, 249-257.
32. SL Peyton Jones & J Launchbury [Sept 1991], "Unboxed values as first class citizens", in Functional Programming Languages and Computer Architecture, Boston, Hughes, ed., LNCS 523, Springer Verlag, 636-666.
33. SL Peyton Jones & D Lester [May 1991], "A modular fully-lazy lambda lifter in Haskell", Software-Practice and Experience 21, 479-506.
34. SL Peyton Jones & WD Partain [1993], "Measuring the effectiveness of a simple strictness analyser", in Functional Programming, Glasgow 1993, K Hammond & JT O'Donnell, eds., Workshops in Computing, Springer Verlag, 201-220.
35. SL Peyton Jones, WD Partain & A Santos [May 1996], "Let-floating: moving bindings to give faster programs", in Proc International Conference on Functional Programming, Philadelphia, ACM.
36. SL Peyton Jones & A Santos [1994], "Compilation by transformation in the Glasgow Haskell Compiler", in Functional Programming, Glasgow 1994, K Hammond, DN Turner & PM Sansom, eds., Workshops in Computing, Springer Verlag, 184-204.
37. SL Peyton Jones & PL Wadler [Jan 1993], "Imperative functional programming", in 20th ACM Symposium on Principles of Programming Languages, Charleston, ACM, 71-84.
38. JC Reynolds [1974], "Towards a theory of type structure", in International Programming Symposium, Springer Verlag LNCS 19, 408-425.
39. PM Sansom [Sept 1994], "Execution profiling for non-strict functional languages", PhD thesis, Technical Report FP-1994-09, Department of Computer Science, University of Glasgow, (ftp://ftp. dcs. glasgow. ac. uk/pub/glasgow-fp/tech_reports/FP-94-09_execution-profiling. ps. Z).
40. PM Sansom & SL Peyton Jones [Jan 1995], "Time and space profiling for nonstrict, higher-order functional languages", in 22nd ACM Symposium on Principles of Programming Languages, San Francisco, ACM, 355-366.
41. A Santos [Sept 1995], "Compilation by transformation in non-strict functional languages", PhD thesis, Department of Computing Science, Glasgow University.
42. Z Shao & AW Appel [June 1995], "A type-based compiler for Standard ML", in SIGPLAN Symposium on Programming Language Design and Implementation (PLDI'95), La Jolla, ACM, 116-129.
43. GL Steele [1978], "Rabbit: a compiler for Scheme", AI-TR-474, MIT Lab for Computer Science.
44. A Tolmach [June 1994], "Tag-free garbage collection using explicit type parameters", in ACM Symposium on Lisp and Functional Programming, Orlando, ACM, 1-11.
45. PL Wadler [1990], "Deforestation: transforming programs to eliminate trees", Theoretical Computer Science 73, 231-248.
46. PL Wadler [Jan 1992], "The essence of functional programming", in 19th ACM Symposium on Principles of Programming Languages, Albuquerque, ACM, 1-14.
47. PL Wadler & DN Turner [June 1995], "Once upon a type", in Proc Functional Programming Languages and Computer Architecture, La Jolla, ACM, 1-11.