A simple, clean and fast implementation of the λ-calculus on JavaScript.
Browse cluster: Functional Programming & Type Theory →Lambda-calculus is a minimal lambda calculus normalizer implemented in JavaScript. The project provides command-line tools (`lam`, `lam-hs`, and `lam-ts`) for normalizing lambda calculus expressions written in a custom syntax that supports variables, lambda abstractions, function applications, and top-level definitions. The implementation uses a Haskell backend when available, falling back to a TypeScript implementation otherwise, and includes features such as beta reduction statistics, binary encoding and decoding of terms, and affinity checking to verify that variables are used at most once.