Secrets of the Glasgow Haskell compiler inliner

Journal of Functional Programming

Volumn 12, Issue 4-5, 2002, Pages 393-434

  Jones, Simon Peyton ^a   Marlow, Simon ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAM LISTINGS; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS;

GLASGOW HASKELL COMPILERS;

PROGRAM COMPILERS;

EID: 0036058519     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796802004331     Document Type: Article

References (28)

1. Shrinking lambda-expressions in linear time
2. Loop headers in lambda-calculus or CPS
3. On generating unique names
4. Inlining semantics for subroutines which are recursive
5. The lambda calculus: Its syntax and semantics
6. Compiling standard ML to java bytecodes
7. An experiment with inline substitution
8. Unexpected side effects of inline substitution: A case study
9. Profile-guided automatic inline expansion for C programs
10. A survey of the project AUTOMATH
11. Subprogram inlining: A study of its effects on program execution time
12. Lambda-dropping: Transforming recursive equations into programs with block structure
13. How not to lie with statistics - The correct way to summarise benchmark results
14. Inductive, co-inductive, and pointed types
15. The nofib benchmark suite of Haskell programs
16. A transformation-based optimiser for Haskell
17. Measuring the effectiveness of a simple strictness analyser
18. Let-floating: Moving bindings to give faster programs
19. A fresh look to inlining decision
20. Inline expansion: When and how?
21. Implementing typed intermediate languages
22. Fast and effective procedure inlining
23. Once upon a polymorphic type