4 Programming Paradigms in 45 Minutes
summary
The session claims programming languages are tools and demonstrates that by actually building a cash‑change routine four different ways: an imperative OO version in Ruby, a concise recursive version in Racket (Lisp style), a constraints/backtracking spec in Prolog, and a brute‑force procedural implementation in the NAND‑to‑Tetris assembly. It uses 190 slides compressed into 45 minutes, shows the functional solution is shortest, Prolog is conceptually hardest but powerful, and the assembly works but is extremely verbose.
AI-written summary · about
chapters (34)
- 0:00Intro
- 0:54Google Cloud Platform
- 1:30Introduction to Principles of Computer Science
- 2:14Abstraction
- 3:03Similarities
- 3:23Differences
- 3:48Primary Example
- 4:57State & Behavior
- 5:29Objects Interact
- 8:07Modeling
- 8:28Reusability
- 8:47Ease of Testing
- 9:00Making Change
- 12:23Racket
- 13:01Pure Functional
- 13:19Input - Output
- 13:33Procedures
- 13:50Syntax
- 14:44Functions
- 15:11Conditionals
- 17:34Concurrency
- 17:53Easier To Test
- 21:32Overview
- 23:53Pattern Matching
- 25:03Basic Examples
- 29:57Constraints
- 30:30change (amount, coins, change)
- 33:34Procedural
- 34:22Registers
- 35:12Computations
- 35:55Assignment
- 39:32Strengths?
- 39:51Scripting
- 42:26Thoughtful Closing
related talks
41m4 Programming Paradigms in 45 minutes
24mOne machine please, make it Turing
25mSmalltalk, Lisp, Bash: Three Interesting Languages
01h 14mShaving with Occam
47mA Game of Theories: why languages do what they do
28mRuby for your two internal programmers
34mStanding on the Shoulders of Giants
53mCode Generation: ....