Keynote: (Parenthetically Speaking)
summary
Covers a concrete tour of SICP (the SICP wizard book), showing working Ruby code that builds functions at runtime (a make_find_root factory that yields root-finder lambdas), implements cons cells as closures (a cons-as-proc data structure), and encodes polymorphism via function-dispatch for complex numbers. Demonstrations run and converge (Newton iterations, list ops, complex add), code and slides live on GitHub, and practical tradeoffs between OO and functional implementations are compared.
AI-written summary · about
chapters (11)
- 0:00Intro
- 0:40The Atom
- 9:10Models
- 10:37The Rule of Three
- 13:41The Spark
- 16:10Newton Approximation
- 18:45Find Root
- 23:41Lateral Thinking
- 29:56Implementation Details
- 37:31Summary
- 56:31Outtakes
