Tag
closures
- Oct 5, 2026 Tail Position, Accumulators, and Continuation-Passing Style Why a call in tail position needs no return frame, how accumulator arguments turn structural recursion into a loop, and what the CPS transformation costs. programming languages
- Aug 6, 2026 Abstract Machines: The CEK, the Krivine Machine, and Closure Conversion How an evaluator becomes an explicit state machine with a control string, an environment, and a continuation, and what each of the three registers costs. computation theory
- Jun 22, 2026 Normalisation by Evaluation for Conversion Checking How to decide equality of terms by evaluating them into a semantic domain of closures and neutral values, and why this avoids the quadratic cost of substitution. computation theory
- Aug 1, 2025 Closure Capture, Lexical Scope, and Storage Duration Why capturing a variable is a decision about storage rather than about names, how an escaping frame is moved to the heap, and what breaks when a loop body shares one binding. compilers
- Aug 5, 2024 Execution Contexts, Environment Records, and What a Closure Keeps Alive How identifier resolution walks a chain of environment records, why the per-iteration binding of let changes closure behaviour, and which storage a closure pins in memory. web platform
- 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