Functional Programming in JS: What? Why? How?
summary
Claims that pure functions (avoid side effects and immutability) make code more predictable and testable, and demonstrates concrete rewrites: an impure vs a returning greet; mutate‑in‑place vs returning new conf; array-as‑trie persistent structures with structural sharing to limit copying. Tools shown: Mori, Ramda, Immutable.js (compose/pipe, map/filter/reduce “map‑reduce sandwich”). Benchmarks and caveats: recursion can be ~2× slower on 1,000 items and needs tail‑call or better data structures for performance.
AI-written summary · about
chapters (4)
- 0:00Start
- 0:14Functional Programming: What? Why? How?
- 6:08Declarative this is what I want I don't care how you do it
- 35:24Persistent data structures Mori
related talks
41mFunctional programming: Give it a chance!
01h 03mFunctional Programming in JavaScript
12mAn introduction to functional programming
30mLearning Functional Programming with JavaScript
25mA Guide To Functional Programming
47mFunctional Programming on the Web
43mFunctional programming is not just lambdas!
20mFunctional JavaScript