LAMBDA CORE – HARDCORE
summary
Shows concrete Scala code that implements Church lambda calculus encodings: boolean-as-functions, Church numerals with successor/plus/multiply/predecessor, and a Y combinator used to produce recursion so factorial evaluates (3 → 6, 7 → 5040), with a working but impractical boolean implementation; demonstrates nontermination via Omega and explains equivalence to Turing machines and undecidability (Entscheidungsproblem/Gödel); uses a tiny pretty-printing library to map examples back to Church lambda calculus while running on Scala.
AI-written summary · about
chapters (6)
- 0:00Start
- 2:32What Is the Lambda
- 6:17The Basic Lambda
- 9:28Boolean Logic
- 11:02Natural Numbers
- 27:20Lazy and Eager Evaluation
