Tag
runtime-systems
- Jul 8, 2026 Growable Stacks and Reduction Budgets in Coroutine Runtimes How a runtime gives each coroutine its own stack segment, why segmented and copied stacks differ, and how a preemption counter bounds the work a coroutine can do. programming languages
- Apr 24, 2026 Tiered Compilation and Deoptimization: Undoing a Speculation How a runtime decides when to compile, what a speculation record contains, and how execution resumes in the interpreter when a guard fails. programming languages
- Dec 24, 2025 Safepoints and Stack Maps: Letting a Collector Find Roots Why compiled code must describe its live pointers at specific instruction offsets, how the runtime gets control there, and what polling costs in the hot path. programming languages
- Nov 14, 2025 Value Representation: Tagged Pointers and NaN Boxing How a dynamically typed runtime distinguishes integers, heap objects, and doubles inside one machine word, and what each encoding costs in branches, memory, and portability. programming languages
- Feb 26, 2023 Tree-Walking Interpretation and the Cost of Re-Deciding at Every Node Why an interpreter that evaluates syntax nodes spends most of its time on type dispatch and environment lookup, and which of those costs a bytecode compiler removes. programming languages
- Jul 4, 2022 Closure Conversion: Flat Closures, Displays, and Boxed Upvalues How a nested function that references an outer variable becomes a heap object with a specific layout, and what each representation of the captured environment costs per call. programming languages