From folklore to fact: comparing implementations of stacks and continuations

Kavon Farvardin, John H. Reppy · 2020

The efficient implementation of function calls and non-local control transfers is a critical part of modern language implementations and is important in the implementation of everything from recursion, higher-order functions, concurrency and coroutines, to task-based parallelism. In a compiler, these features can be supported by a variety of mechanisms, including call stacks, segmented stacks, and heap-allocated continuation closures.

Read the paper · More papers on PaperTik