From folklore to fact: comparing implementations of stacks and continuations

2020/06/07 by Kavon Farvardin, John Reppy · 1 voice
Computer Science · #Distributed systems and fault tolerance #Logic, programming, and type systems #Parallel Computing and Optimization Techniques

paper · pdf · doi:10.1145/3385412.3385994

openalex publication_date 2020/06/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30

Abstract

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.

Discussions

• Folklore to Fact: Comparing Implementations of Stacks and Continuations [hn, 2 points, 0 comments]

Related

• Continuation-Passing C, compiling threads to events through continuations
• CPC: programming with a massive number of lightweight threads
• Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations
• Compiling without continuations
• A program logic for higher-order procedural variables and non-local jumps