Y Not- Adventures in Functional Programming
summary
Walks from lambda calculus to a working Ruby implementation that computes recursion without named methods, using mechanical refactorings: Tennent correspondence, introduce binding, wrap function and inline. Builds an anonymous factorial improver and then the applicative-order (Z) combinator (Y for lazy languages), produces a pure lambda expression that calculates factorials (demonstrated to about 2000 before stack overflow), and shows the concrete steps and why the combinator actually works.
AI-written summary · about
chapters (18)
- 0:00Start
- 0:25The Y Combinator
- 2:17Audience Participation
- 3:36Turing Machine
- 4:09Animation of a Turing Machine
- 6:55Lambda Calculus
- 10:01Beta Reduction
- 10:38Beta Expansion
- 14:40Definition of Fixed Point
- 17:50Fixed Points
- 18:21Regular Functions
- 20:06Compose
- 21:17Functional Refactorings
- 23:08Argument Binding
- 24:35Wrap Function
- 26:08In Line Refactoring
- 32:41Lambda Function
- 50:45Use the Y Combinator in My Own Code
