| |
| | Inline expansion - Wikipedia, the free encyclopedia |
 | | In the context of functional programming languages, inline expansion is often referred to as beta reduction, a term used in the lambda calculus, the formal language underlying these languages. |
 | | Inline expansion itself is an optimization, since it eliminates call overhead, but it is much more important as an enabling transformation. |
 | | That is, once the body of the function is expanded in the context of its call site, often with arguments that may be fixed constants, the code is opened to a variety of new optimizations that were not possible before. |
| en.wikipedia.org /wiki/Inline_expansion (1000 words) |
|