STATUTORY: A Turing-complete language in 17th-century legal English
Summary
STATUTORY describes a Turing-complete esoteric language that translates 17th-century English legal prose into SKI combinator calculus. It includes a fixed-point carrier, examples like Fibonacci, and a Tree-sitter parser; the project covers architecture, usage, and theory, highlighting language design and parsing challenges.