Lambda? You Keep Using that Letter
summary
Lambda calculus originates with Alonzo Church (1936) and proves undecidability while giving a syntax where everything is a function; numbers become Church numerals λf.λx.x that count repeated application and booleans choose between two branches. Implementations show surprises: Lisp and Scheme embody true lambdas from the 1960s/70s, actors turn out implementation-equivalent to closures, but mainstream languages differ — Java lambdas (2014) are syntactic sugar lacking free application and full type integration, C#/C++ partially support lambdas, and Excel LAMBDA (Dec 2020) actually provides full first-class lambdas.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 1:47Lambda calculus history
- 10:37Lambda basics
- 17:39Lambdas in languages
- 27:13Lambda as unifier
- 36:20Lambda in Excel
- 41:38Church encoding
- 48:15Conclusion
related talks
38mLambda? You Keep Using that Letter
01h 01mLambda? You Keep Using that Letter
34mAn introduction to Lambda Calculus
53mExplaining Lambda Calculus through Plain JavaScript
30mLambda Calculus: The Origins of Functional Programming
01h 01mLive Lambda Calculus
42mWould Aliens Understand Lambda Calculus
59mLambdas from First Principles: A Whirlwind Tour of C++""
