Optimal evaluator of λ-calculus terms.
Browse cluster: Functional Programming & Type Theory →Absal is an optimal evaluator for the λ-calculus that compiles terms to symmetric interaction combinators, achieving asymptotic speedups over conventional functional language evaluators like GHC and V8. The project is implemented in JavaScript as a minimal core of approximately 250 lines of code, available as an npm package that can be used as a command-line tool or imported as a library. While the evaluator can be millions of times faster than standard approaches in some cases, it has a known limitation: it cannot evaluate λ-terms that copy copies of themselves, which represents an open problem in making it compatible with the full λ-calculus.