Tag
An academic exploration of various encodings for ordinal numbers within lambda calculus, comparing Linear, Affine, and Non-Linear systems including Mackie and Parigot encodings.
This article presents a minimalist 7-line interpreter for a Turing-equivalent functional language based on lambda calculus, demonstrating the eval/apply design pattern.
The article presents an algorithmic reconstruction of normalisation by evaluation (NbE) for untyped lambda calculus, showing step-by-step optimizations that yield an asymptotically faster normaliser than standard NbE implementations.
Researchers release λ-RLM, an open-source typed λ-calculus runtime that replaces self-written recursive control code with pre-verified combinators, boosting long-context reasoning accuracy by up to 21.9% and winning 29/36 trials.