A World Without Assignment
summary
Claims that common Ruby tasks work with no assignment, using Ruby and Scheme side by side and showing exact code that runs. Demonstrates recursion, anonymous functions, function composition, and tail-call optimization with accumulator helpers. Implements a working count_change solution (292 ways to make a dollar) and steps through bugs, base cases, and fixes. Shows cloning instead of mutation, idiomatic list operations, and concrete examples that compile and produce measurable results.
AI-written summary · about
chapters (8)
- 0:00Start
- 3:34Easier to Test
- 3:45Concurrency
- 4:50Scheme Basics
- 9:28Factorial
- 10:11Tail Call Optimization
- 12:24Semi-Contrived Example
- 13:02Making Change
