Paper Info
Title
Inlining to Reduce Stack Space
Abstract
We consider a novel use of inlining, where we reduce the amount of stack space consumed when a program is run. Stack space is a critical resource in functional- and logic-programming implementations, especially parallel implementations. We formulate an optimization problem for inlining, where code size is traded for reduced stack use, and we show that this problem is NP-hard. We then develop several heuristics for stack reduction using inlining, and present the experimental results of their effectiveness in reducing the stack use of some functional programs.
Year
DOI
Venue
1993
10.1007/3-540-57186-8_84
PLILP
Keywords
Field
DocType
reduce stack space,optimization problem,functional programming
Programming language,Functional programming,Code size,Computer science,Parallel computing,Call stack,Call graph,Implementation,Heuristics,Optimization problem
Conference
ISBN
Citations 
PageRank 
3-540-57186-8
4
0.61
References 
Authors
12
1
Name
Order
Citations
PageRank
Owen Kaser132524.02