4 Programming Paradigms in 45 minutes
summary
Four concrete implementations compare paradigms by doing the same problem: an OO Ruby cash‑drawer class with encapsulated state and methods, a pure recursive Racket solution using lists and prefix notation, a Prolog constraint version that turns out Prolog shortest solution after some debugging, and a low‑level assembly program that builds an assembler/bytecode stack and produces correct coin counts for 67 cents; the demos compile or run and reveal tradeoffs in verbosity, mutability, and reuse, not vague platitudes.
AI-written summary · about
chapters (38)
- 0:00Intro
- 1:09Google Cloud Platform
- 1:52Creativity
- 2:06Differences
- 2:24Flexible
- 2:35Primary Example
- 2:56Object Oriented
- 3:21State & Behavior
- 3:43Objects Interact
- 6:09Modeling
- 6:36Ease of Testing
- 8:57Racket
- 9:24Pure Functional
- 9:36Input - Output
- 9:50Procedures
- 10:05Infix vs. Prefix
- 10:56Functions
- 11:24Conditionals
- 13:21Concurrency
- 13:37Easier To Test
- 13:51Reusability
- 15:24Prolog
- 15:40Formal Logic
- 15:57Facts & Clauses
- 18:01Pattern Matching
- 18:58Basic Examples
- 21:50Flexibility
- 22:24Constraints
- 25:41Procedural
- 26:33Registers
- 27:14Computations
- 27:50Assignment
- 28:21@Label
- 28:31Jumps
- 31:43Strengths?
- 32:12Simple
- 32:33Making Change
- 38:43Thoughtful Closing
