A Flock of Functions: Combinators, Lambda Calculus, & Church Encodings in JS - Part II

Gabriel Lebec delivers a lecture-style monologue, diving deep into Lambda Calculus and combinatory logic. He begins with the basics, constructing numbers and arithmetic operations from scratch using Church encodings. Progressing step-by-step, Lebec explains successor functions, addition, multiplication, and exponentiation. He introduces key combinators like the Bluebird (function composition) and explores data structures such as Church pairs. The talk culminates in deriving a predecessor function and briefly touches on subtraction and comparisons, all within the framework of Lambda Calculus, interjecting occasional JavaScript examples for demonstration.