A Type-based Analysis for Stack Allocation in Functional Languages
Abstract elided by the publisher.
Related papers
- A Type-Based Escape Analysis for Functional Languages JFP 1998
- Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations ESOP 1990
- Storage Use Analysis and its Applications ICFP 1996
- Implementation of the Typed Call-by-Value lambda-Calculus using a Stack of Regions POPL 1994
- Fast Escape Analysis and Stack Allocation for Object-Based Programs CC 2000
- Empirical and Analytic Study of Stack Versus Heap Cost for Languages with Closures JFP 1996
- Jolt: lightweight dynamic analysis and removal of object churn OOPSLA 2008
- Optimistic stack allocation for java-like languages ISMM 2006