A transformation-based optimiser for Haskell

Science of Computer Programming

Volumn 32, Issue 1-3, 1998, Pages 3-47

  Peyton Jones, Simon L ^a   Santos, André L M ^a  

^a NONE

Author keywords

Compilers; Functional languages; Let floating; Linear type system; Optimisation; Second order lambda calculus; Strictness analysis; Transformation

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION;

GLASGOW HASKELL COMPILER (GHC); SECOND-ORDER LAMBDA CALCULUS;

PROGRAM COMPILERS;

EID: 0032164989     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6423(97)00029-4     Document Type: Article

References (53)

1. A.V. Aho, R. Sethi, J.D. Ullman, Compilers - Principles, Techniques and Tools, Addison-Wesley, Reading, MA, 1986.
2. A.W. Appel, Compiling with Continuations, Cambridge University Press, Cambridge, 1992.
3. A.W. Appel, T. Jim, Shrinking lambda-expressions in linear time, J. of Functional Programming 7 (1997).
4. Z. Ariola, M. Felleisen, J. Maraist, M. Odersky, P. Wadler, A call by need lambda calculus, in: 22nd ACM Symp. Principles of Programming Languages, ACM, San Francisco, 1995.
5. L. Augustsson, Compiling lazy functional languages, Part II, Ph.D. Thesis, Department of Computer Science, Chalmers University, Sweden, 1987.
6. D.F. Bacon, S.L. Graham, O.J. Sharp, Compiler transformations for high-performance computing, ACM Comput. Surveys 26 (1994).
7. B. Calder, D. Grunwald, B. Zorn, Quantifying behavioural differences between C and C++ programs, J. Programming Languages 2 (1994).
8. C. Chambers, J. Dean, D. Grove, A framework for selective recompilation in the presence of complex intermodule dependencies, in: Proc Internat. Conf. on Software Engineering, Seattle, 1995.
9. C.D. Clack, S.L. Peyton Jones, Generating parallelism from strictness analysis, Internal Note 1679, Department of Computer Science, University College London, 1985.
10. J.W. Davidson, A.M. Holler, A study of a C function inliner, Software - Practice and Experience 18 (1988).
11. C. Flanagan, A. Sabry, B. Duba, M. Felleisen, The essence of compiling with continuations, SIGPLAN Notices 28 (1993).
12. P.J. Fleming, J.J. Wallace, How not to lie with statistics - the correct way to summarise benchmark results, CACM 29 (1986).
13. P. Fradet, D. Le Metayer, Compilation of functional languages by program transformation, ACM Trans. Programming Languages Systems 13 (1991).
14. A.J. Gill, Cheap deforestation for non-strict functional languages. Ph.D. Thesis, Department of Computing Science, Glasgow University, 1996.
15. A. Gill, J. Launchbury, S.L. Peyton Jones, A short cut to deforestation, in: Proc. Functional Programming Languages and Computer Architecture, ACM, Copenhagen, 1993.
16. J. Girard, 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: J.E. Fenstad (Ed.), 2nd Scandinavian Logic Symp., North-Holland, Amsterdam, 1971.
17. R. Harper, G. Morrisett, Compiling polymorphism using intensional type analysis, in: 22nd ACM Symp. Principles of Programming Languages, ACM, San Francisco, 1995.
18. P. Hudak, S.L. Peyton Jones, P.L. Wadler, Arvind, B. Boutel, J. Fairbairn, J. Fasel, M. Guzman, K. Hammond, J. Hughes, T. Johnsson, R. Kieburtz, R.S. Nikhil, W. Partain, J. Peterson, Report on the functional programming language Haskell, Version 1.2, SIGPLAN Notices 27 (1992).
19. R.J.M. Hughes, The design and implementation of programming languages, Ph.D. Thesis, Programming Research Group, Oxford, 1983.
20. T. Johnsson, Lambda lifting: transforming programs to recursive equations, in: Jouannaud (Ed.), Proc. IFIP Conf. on Functional Programming and Computer Architecture, Lecture Notes in Computer Science, Vol. 201, Springer, Berlin, 1985.
21. M.P. Jones, Dictionary-free overloading by partial evaluation, in: ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM), ACM, Orlando, Florida, 1994.
22. R. Kelsey, Compilation by program transformation, YALEU/DCS/RR-702, Ph.D. Thesis, Department of Computer Science, Yale University, 1989.
23. R. Kelsey, P. Hudak, Realistic compilation by program transformation, in: Proc. ACM Conf. on Principles of Programming Languages, ACM, New York, 1989.
24. D.A. Kranz, ORBIT - an optimising compiler for Scheme, Ph.D. Thesis, Department of Computer Science, Yale University, 1988.
25. D.A. Kranz, R. Kelsey, J. Rees, P. Hudak, J. Philbin, N. Adams, ORBIT - an optimising compiler for Scheme, in: Proc. SIGPLAN Symp. on Compiler Construction, ACM, New York, 1986.
26. J. Launchbury, A natural semantics for lazy evaluation, in: 20th ACM Symp. on Principles of Programming Languages, ACM, Charleston, 1993.
27. J. Launchbury, S.L. Peyton Jones, Lazy functional state threads, in: SIGPLAN Symp. on Programming Language Design and Implementation (PLDI'94), ACM, Orlando, 1994.
28. J. Launchbury, T. Sheard, Warm fusion, in: Proc. Functional Programming Languages and Computer Architecture, ACM, La Jolla, 1995.
29. S. Marlow, Deforestation for Higher Order Functional Programs, Ph.D. Thesis, Department of Computing Science, University of Glasgow, 1996.
30. R. Morrison, A. Dearle, R.C.H. Connor, A.L. Brown, An ad hoc approach to the implementation of polymorphism, ACM Trans. Programming Languages Systems 13 (1991).
31. A. Ohori, A compilation method for ML-style polymorphic record calculi, in: 19th ACM Symp. on Principles of Programming Languages, ACM, Albuquerque, 1992.
32. W.D. Partain, The nofib Benchmark suite of Haskell programs, in: J. Launchbury, P.M. Sansom (Eds.), Functional Programming, Glasgow 1992, Workshops in Computing, Springer, Berlin, 1993.
33. S.L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice-Hall, Englewood Cliffs, NJ, 1987.
34. S.L. Peyton Jones, Implementing lazy functional languages on stock hardware: the spineless tagless G-machine, J. Funct. Programming 2 (1992).
35. S.L. Peyton Jones, Compilation by transformation: a report from the trenches, in: European Symp. on Programming (ESOP'96), Linköping, Sweden, Lecture Notes in Computer Science, Vol. 1058, Springer, Berlin, 1996.
36. S.L. Peyton Jones, C.V. Hall, K. Hammond, W.D. Partain, P.L. Wadler, The Glasgow Haskell compiler: a technical overview, in: Proc. Joint Framework for Information Technology Techn. Conf., Keele, DTI/SERC, 1993.
37. S.L. Peyton Jones, J. Launchbury, Unboxed values as first class citizens, in: Hughes (Ed.), Functional Programming Languages and Computer Architecture, Boston, Lecture Notes in Computer Science, Vol. 523, Springer, Berlin, 1991.
38. S.L. Peyton Jones, D. Lester, A modular fully-lazy lambda lifter in HASKELL, Software - Practice and Experience 21 (1991).
39. S.L. Peyton Jones, W.D. Partain, Measuring the effectiveness of a simple strictness analyser, in: K. Hammond, J.T. O'Donnell (Eds.), Functional Programming, Glasgow, Workshops in Computing, Springer, Berlin, 1993.
40. S.L. Peyton Jones, W.D. Partain, A. Santos, Let-floating: moving bindings to give faster programs, in: Proc. Internat. Conf. on Functional Programming, ACM, Philadelphia, 1996.
41. S.L. Peyton Jones, A. Santos, Compilation by transformation in the Glasgow Haskell compiler, in: K. Hammond, D.N. Turner, P.M. Sansom (Eds.), Functional Programming, Glasgow, Workshops in Computing, Springer, Berlin, 1994.
42. S.L. Peyton Jones, P.L. Wadler, Imperative functional programming, in: 20th ACM Symp. on Principles of Programming Languages, ACM, Charleston, 1993.
43. J.C. Reynolds, Towards a theory of type structure, in: Internat. Programming Symp., Lecture Notes in Computer Science, Vol. 19, Springer, Berlin, 1974.
44. P.M. Sansom, Execution profiling for non-strict functional languages, Ph.D. Thesis, Tech. Report FP-1994-09, Department of Computer Science, University of Glasgow, 1994 (ftp://ftp.dcs.glasgow. ac.uk/pub/glasgow-fp/tech_reports/FP-94-09_execution-profiling.ps.Z).
45. P.M. Sansom, S.L. Peyton Jones, Time and space profiling for non-strict, higher-order functional languages, in: 22nd ACM Symp. on Principles of Programming Languages, ACM, San Francisco, 1995.
46. A. Santos, Compilation by transformation in non-strict functional languages, Ph.D. Thesis, Department of Computing Science, Glasgow University, 1995.
47. Z. Shao, A.W. Appel, A type-based compiler for Standard ML, in: SIGPLAN Symp. on Programming Language Design and Implementation (PLDI'95), ACM, La Jolla, 1995.
48. G.L. Steele, Rabbit: a compiler for scheme, AI-TR-474, MIT Lab for Computer Science, 1978.
49. D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper, P. Lee, TIL: a type-directed optimizing compiler for ML, in: SIGPLAN Symp. on Programming Language Design and Implementation (PLDI'96), ACM, Philadelphia, 1996.
50. A. Tolmach, Tag-free garbage collection using explicit type parameters, in: ACM Symp. on Lisp and Functional Programming, ACM, Orlando, 1994.
51. D.N. Turner, P.L. Wadler, C. Mossin, Once upon a type, in: Proc. Functional Programming Languages and Computer Architecture, ACM, La Jolla, 1995.
52. P.L. Wadler, Deforestation: transforming programs to eliminate trees, Theoret. Comput. Sci. 73 (1990).
53. P.L. Wadler, The essence of functional programming, in: 19th ACM Symp. on Principles of Programming Languages, ACM, Albuquerque, 1992.