Lambda Calculus: The Origins of Functional Programming
summary
Examines the origins of functional programming by tracing logic paradoxes to Church and Turing’s independent solutions of the decision problem and their equivalence, then presents concrete lambda-calculus rules: beta-reduction (left-to-right), normal vs applicative evaluation, and how lazy evaluation prevents duplicated work. Shows anonymous higher-order functions, currying for multi-argument calls, closure formation, and how purity yields referential transparency, linking these concepts to Lisp, ML, Haskell, Erlang, Scala and Rust.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 1:29Math paradoxes and contradictions
- 3:33Turing’s decision problem
- 5:20Origins of λ-calculus
- 6:22λ-calculus presentation
- 7:25Syntax and basic examples
- 8:51Beta reduction and evaluation
- 11:58Lazy evaluation and performance
- 12:40Properties of λ functions
- 16:41Currying single-argument functions
- 18:50Timeline of functional languages
- 26:25Impact and diversity
- 26:45Conclusion
related talks
21mλ-Calculus: A Brief History of Functional Programming
49mLambda? You Keep Using that Letter
51mGreek Classics: Lambda Calculus For Beginners
34mAn introduction to Lambda Calculus
49mFunctional Programming Essentials
53mExplaining Lambda Calculus through Plain JavaScript
37mLearn You Some Lambda Calculus
01h 01mLambda? You Keep Using that Letter