Functional Programming in 40 Minutes
summary
Defines functional programming as enforcing pure functions that map inputs to outputs with no side effects, pairing them with persistent data structures (tree-backed, copy-on-write, e.g. 32-wide nodes holding ~1M items cheaply) and pushing real-world effects to small bridges. Clojure solutions use atoms for controlled mutation and queues for ordered side effects. Real example: a 10k-line Clojure web library has 460 pure functions and 21 side-effect bridges, so the codebase is 96% functional and easier to reason about and test.
AI-written summary · about
chapters (6)
related talks
42mFunctional Programming in 40 Minutes
41mFunctional Programming for Pragmatists
31mA Primer on Functional Programming
49mFunctional Programming Essentials
36mConcrete Functional Programming
44mFunctional Programming You Already Know
01h 06mThe Joy of Functional Programming
43mPure Functional Programming in JavaScript
