Tag
call-by-value
- Mar 30, 2025 Fixed-Point Combinators and How Recursion Enters a Nameless Calculus Why a finite lambda term cannot refer to itself, how the Y and Turing combinators manufacture self-reference through duplication, and what the Z variant fixes about call-by-value. computation theory
- Nov 7, 2023 Beta Reduction and the Consequences of Evaluation Order How the single rewrite rule of the lambda calculus produces drastically different programs depending on where it is applied, and why normal order finds a value whenever one exists. computation theory