Lightweight Lexical Closures for Legitimate Execution Stack Access
Abstract elided by the publisher.
Related papers
- Empirical and Analytic Study of Stack Versus Heap Cost for Languages with Closures JFP 1996
- Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages PLDI 1995
- Virtualizing Continuations PLDI 2026
- Multiple Resumptions and Local Mutable State, Directly ICFP 2025
- SafeRace: Assessing and Addressing WebGPU Memory Safety in the Presence of Data Races OOPSLA 2025
- Lightweight Closure Conversion TOPLAS 1997
- Selective and Lightweight Closure Conversion POPL 1994
- MEA2: A Lightweight Field-Sensitive Escape Analysis with Points-to Calculation for Golang OOPSLA 2024