Virtualizing Continuations
summary
Implements a novel virtual continuation scheme that assigns virtual addresses to stack-allocated handlers and mediates effect invocations via a software MMU (SMMU). Provides an operational semantics and a correctness proof, compiles into a new runtime/compiler called MultiLexer, and compares against BaseLexer; overhead of zoning is a small constant per resume and benchmarks show real parallel speedups when multishot resumptions run on multiple threads. Artifacts and reproducible evaluations are available.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 1:05N-queens and effect handlers
- 3:54Multi-shot continuations challenges
- 5:21Stack switching vs copying
- 8:55Virtual continuations with SMMU
- 13:46Performance evaluation
- 16:12Conclusion
- 16:32Q&A
related talks
22mLexical Effect Handler: Fast by Design, Correct by Proof
18mLexical Effect Handlers, Directly
25mModularizing CPU Semantics for Virtualization
37mAssembling
15mZero-Overhead Lexical Effect Handlers
01h 02mMemory and Compilers
15mLightweight On-Stack Replacement in Languages with Unstructured Loops
27mRegions as Continuation Marks
