λ-Calculus: A Brief History of Functional Programming
summary
Covers the syntax and reduction rules of the lambda calculus with live examples, including beta-reduction and evaluation strategies such as call-by-name versus call-by-value. Explains currying and higher-order functions by encoding multi-argument and recursive patterns, and traces historical milestones (Church and Turing equivalence), noting influences of System F on ML/Haskell and actor-style concurrency on Erlang/Elixir, plus when laziness or purity matter.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 1:13Problème d'arrêt
- 3:33Syntaxe
- 5:32Ordre d'application
- 6:30Stratégies d'évaluation
- 8:59Fonction anonyme
- 9:30Fonction pure
- 10:41Fonction d'ordre supérieur
- 11:45Fonction unaire
- 17:30Conclusion
related talks
30mLambda Calculus: The Origins of Functional Programming
51mGreek Classics: Lambda Calculus For Beginners
01h 01mLive Lambda Calculus
42mPractical Lambda Calculus
01h 00mTheory and Models of Lambda Calculus Untyped and Typed - Part 1 of 5
34mAn introduction to Lambda Calculus
48mIt’s birds all the way down: Fun Introduction to Lambda Calculus
49mFunctional Programming Essentials