Why recursion matters
summary
Recursion is framed as fundamental: it proves programs are correct by structural induction, it yields real speedups (example build script vs make: initial run ~13 seconds, incremental + -j parallelism cuts runtime by about a second), and it enables surprising capabilities — lazy evaluation pulls a single element from an infinite list to produce 36, and a tiny Ruby implementation of variables, pairs, unification and goals actually runs programs backwards to enumerate inputs that produce a given output.
AI-written summary · about
chapters (10)
- 0:00Start
- 6:03The Proof by Induction
- 10:16The Functor Composition Law
- 10:37Frontal Composition Law
- 15:21Make File
- 26:26Unification
- 29:03Bind
- 29:49Composing Goals
- 31:58List Operation
- 32:52List Operation Append
