Expand description
Tree-walking interpreter for the lambda calculus.
Evaluation is purely functional: every reduction step is a non-mutating
transformation of an immutable environment. Recursion is bounded by a
Fuel budget so that proptest-generated inputs cannot stall the test
suite. Fixed points are unfolded by substitution; the captured
environment carries no self-reference, which keeps every value
representable without Rc, Arc, or interior mutability.
Structs§
- Fuel
- A step budget for evaluation.
Functions§
- eval
- Evaluate
expragainstenvwith the given step budget.