Practical Lambda Calculus
summary
Live coding shows a small lambda interpreter running inside Emacs and builds booleans numbers and lists from raw lambda forms, implements successor predecessor and a subtraction by repeated predecessor, and composes addition and multiplication to get 100 as result. The demo uses a home‑brew Emacs Lambda machine, proves predecessor actually works by pairing technique, shows lists as foldable structures and a working filter, and notes subtraction is correct but inefficient compared to native integers.
AI-written summary · about
chapters (15)
- 0:00Practical Lambda intro
- 1:07Emacs as Lambda machine
- 2:12Core Lambda rules
- 4:24Booleans in Lambda
- 7:54Numbers in Lambda
- 9:42Successor and arithmetic
- 17:09Multiplication as repeated addition
- 20:04Subtraction challenge
- 21:10Pairs for predecessor
- 28:56Generalized subtraction
- 31:06Lists as extensions of numbers
- 37:07Folding lists/numbers
- 39:18Computing list and number lengths
- 41:27Filtering lists
- 44:43Q&A
related talks
32mTheory & Models of Lambda Calculus: Typed and Untyped (Part 2)
56mTheory & Models of Lambda Calculus: Typed and Untyped (Part 1)
33mTheory & Models of Lambda Calculus: Typed and Untyped (Part 6)
59mTheory & Models of Lambda Calculus: Typed and Untyped (Part 3)
01h 04mTheory & Models of Lambda Calculus: Typed and Untyped (Part 3)
01h 01mTheory & Models of Lambda Calculus: Typed and Untyped (Part 5)
01h 04mSymbolic Calculus for High-performance Computing From Scratch Using C++23
58mSome History of Functional Programming Languages
