Abstract Machines for Good
summary
Introduces the lambda calculus (especially the nameless/de Bruijn variant) as a foundation for symbolic computation where functions and variables are first-class, then surveys several abstract machines derived from that theory and their influence on modern programming paradigms. Demonstrates how to implement functional programming concepts (combinators like “bananas”, lenses, etc.) on machine-oriented abstract lambda machines, abstracting away from specific languages and architectures.
AI-written summary · about
chapters (11)
- 0:00Introduction
- 5:09Lambda calculus history
- 15:43Lambda expressions
- 16:03Why abstract machines
- 21:19Simple abstract machine
- 24:15Paper walkthrough
- 25:43Tail recursion optimization
- 27:08Lazy evaluation and K-machine
- 29:14Why study abstract machines
- 32:01Further reading
- 32:45Q&A
related talks
01h 00mTheory and Models of Lambda Calculus Untyped and Typed - Part 2 of 5
21mλ-Calculus: A Brief History of Functional Programming
30mLambda Calculus: The Origins of Functional Programming
20mCertified Abstract Machines for Skeletal Semantics
45mLogic Meta Programming for Functional Languages
53mExplaining Lambda Calculus through Plain JavaScript
34mAn introduction to Lambda Calculus
48mIt’s birds all the way down: Fun Introduction to Lambda Calculus