There is a bluebird in my talk that wants to get out
summary
Claims that JavaScript can be rewritten using only lambda calculus-style functions and combinators and demonstrates it by encoding booleans, Church numerals, arithmetic (succ, plus, mul, pow), pairs and predecessor, comparisons and control flow, then deriving combinators and Y combinator recursion and reducing many definitions down to S and K. The demo runs in a terminal, prints expected results for examples, and the uploader warns this is educational not production-ready.
AI-written summary · about
chapters (11)
- 0:00Start
- 1:18Lambda Calculus
- 5:20Beta Reduction
- 6:07Parentheses
- 9:58Replacing Numbers
- 10:39How Can We Represent Quantities with Functions
- 14:18Successor Function
- 20:53Increment Pairs
- 23:06Replace Boolean Operators
- 27:11All Four Equivalents
- 38:52Why Did They Choose the Name Y Combinator
related talks
48mIt’s birds all the way down: Fun Introduction to Lambda Calculus
53mExplaining Lambda Calculus through Plain JavaScript
59mLambda Calculus For People Who Can't Be Bothered to Learn It - part 1 of 2
34mThe universe in a single arrow: A live dive into the lambda calculus
01h 03mLambda Calculus For People Who Can't Be Bothered to Learn It - part 2 of 2
30mThe Universe in a Single Arrow: A Live Dive into the Lambda Calculus
48mThe universe in a single arrow
37mFun with Lambdas!