GoKawiilNew open-source e-graph tool 'lambda-microegg' adds binder support for lambda calculus rewriting
A developer released lambda-microegg, an e-graph library extending Max's microegg with built-in variable binders, higher-order Miller pattern matching, and capture-avoiding substitution. The tool is available on GitHub along with a WebAssembly browser demo, and includes example benchmarks such as sum-rewrite rules and AC-10 saturation tests compared against the existing egg library.
GoKawiil's interpretation of the reporting above, not reported fact.
E-graphs are used in compilers and theorem provers to represent equivalent program expressions efficiently, and adding alpha-aware binder support could make them more directly usable for reasoning about programs with variable scoping, like lambda calculus terms. The author's own benchmark suggests the tool is somewhat slower than the established egg library, which may indicate a tradeoff between added expressiveness and raw performance that further optimization could address.
- lambda-microegg is a new e-graph tool supporting well-scoped, alpha-aware variable binders
- It extends Max's microegg with higher-order Miller patterns and capture-avoiding substitution in rewrite rules
- Author-reported benchmarks show it running roughly the same order of magnitude but slower than the egg library on an AC-10 saturation test
Source: philipzucker.com — Hey There Buddo, 2026-09-20
Published there as: “Lambda MicroEgg”
Read the original report → The summary and analysis above are GoKawiil's own, written from reporting by the source above. Facts and quotes belong to the original publisher.