Greek Classics: Lambda Calculus For Beginners
summary
Starts from the identity function and shows concrete reductions step by step, demonstrating beta reduction and where substitution terminates or diverges (Omega loops). Rewrites multi-argument functions as curried lambdas, implements Const and a pair type in Haskell, and uses GHCi commands :t and :k to inspect types and kinds. Builds Church encodings for numbers and shows the Y combinator enabling recursion while noting pure lambda diverges without it.
AI-written summary · about
chapters (7)
- 0:00Start
- 3:31The Identity Function
- 3:49Lambda Abstraction
- 10:03Beta Reduction
- 31:05Types
- 36:02Type Constructor
- 46:09The I Combinator
related talks
34mAn introduction to Lambda Calculus
48mIt’s birds all the way down: Fun Introduction to Lambda Calculus
42mPractical Lambda Calculus
21mλ-Calculus: A Brief History of Functional Programming
37mLearn You Some Lambda Calculus
30mLambda Calculus: The Origins of Functional Programming
30mLAMBDA CORE – HARDCORE
01h 01mLive Lambda Calculus