Lambda Calculus Interpreter in 383 Bytes

This blog post introduces a brand new 383-byte implementation of a binary lambda calculus interpreter as an x86-64 Linux ELF executable. This tiny interpreter manages to achieve garbage collection, lazy lists, and tail recursion. Programs are encoded in a remarkably small binary format; for example, its metacircular evaluator is only 232 bits. The author provides friendly portable C code and pre-built binaries for other platforms. This project is a fun learning tool for lambda calculus and showcases the possibility of implementing complex computation in extremely resource-constrained environments.