Lambda-splitting: A higher-order approach to cross-module optimizations

Matthias Blume; Andrew W. Appel

Lambda-splitting: A higher-order approach to cross-module optimizations

Matthias Blume
, Andrew W. Appel

Research output: Contribution to conference › Paper › peer-review

Abstract

We describe an algorithm for automatic inline expansion across module boundaries that works in the presence of higher-order functions and free variables; it rearranges bindings and scopes as necessary to move nonexpansive code from one module to another. We describe - and implement - the algorithm as transformations on λ-calculus. Our inliner interacts well with separate compilation and is efficient, robust, and practical enough for everyday use in the SML/NJ compiler. Inlining improves performance by 4-8% on existing code, and makes it possible to use much more data abstraction by consistently eliminating penalties for modularity.

Original language	English (US)
Pages	112-124
Number of pages	13
State	Published - 1997
Event	Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, ICFP - Amsterdam, Neth Duration: Jun 9 1997 → Jun 11 1997

Other

Other	Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, ICFP
City	Amsterdam, Neth
Period	6/9/97 → 6/11/97

All Science Journal Classification (ASJC) codes

Software

Cite this

@conference{744d803b3d3f44438fbb70fddff417b3,

title = "Lambda-splitting: A higher-order approach to cross-module optimizations",

abstract = "We describe an algorithm for automatic inline expansion across module boundaries that works in the presence of higher-order functions and free variables; it rearranges bindings and scopes as necessary to move nonexpansive code from one module to another. We describe - and implement - the algorithm as transformations on λ-calculus. Our inliner interacts well with separate compilation and is efficient, robust, and practical enough for everyday use in the SML/NJ compiler. Inlining improves performance by 4-8\% on existing code, and makes it possible to use much more data abstraction by consistently eliminating penalties for modularity.",

author = "Matthias Blume and Appel, \{Andrew W.\}",

year = "1997",

language = "English (US)",

pages = "112--124",

note = "Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, ICFP ; Conference date: 09-06-1997 Through 11-06-1997",

}

TY - CONF

T1 - Lambda-splitting

T2 - Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, ICFP

AU - Blume, Matthias

AU - Appel, Andrew W.

PY - 1997

Y1 - 1997

N2 - We describe an algorithm for automatic inline expansion across module boundaries that works in the presence of higher-order functions and free variables; it rearranges bindings and scopes as necessary to move nonexpansive code from one module to another. We describe - and implement - the algorithm as transformations on λ-calculus. Our inliner interacts well with separate compilation and is efficient, robust, and practical enough for everyday use in the SML/NJ compiler. Inlining improves performance by 4-8% on existing code, and makes it possible to use much more data abstraction by consistently eliminating penalties for modularity.

AB - We describe an algorithm for automatic inline expansion across module boundaries that works in the presence of higher-order functions and free variables; it rearranges bindings and scopes as necessary to move nonexpansive code from one module to another. We describe - and implement - the algorithm as transformations on λ-calculus. Our inliner interacts well with separate compilation and is efficient, robust, and practical enough for everyday use in the SML/NJ compiler. Inlining improves performance by 4-8% on existing code, and makes it possible to use much more data abstraction by consistently eliminating penalties for modularity.

UR - https://www.scopus.com/pages/publications/0030697597

UR - https://www.scopus.com/pages/publications/0030697597#tab=citedBy

M3 - Paper

AN - SCOPUS:0030697597

SP - 112

EP - 124

Y2 - 9 June 1997 through 11 June 1997

ER -

Lambda-splitting: A higher-order approach to cross-module optimizations

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this