Getting started with Functional Programming
summary
Shows a concrete refactor: mutable product-list sort that originally calls list.sort becomes a pure function that returns a new copied list, is testable, and can run on another isolate. Uses immutable helpers like KT Dart and the fast_immutable_collections idea plus utilities from dartx (sortedWith, compareBy) and a small higher-order reverse function to flip comparators. Result is fewer branches, easy extension by map lookup, and deterministic, cacheable behavior.
AI-written summary · about
chapters (9)
- 0:00Introduction to talk
- 1:53Pure functions basics
- 5:06Functions in functional programming
- 9:00Immutable data structures
- 13:18First-class and higher-order functions
- 20:20Functional Dart solution
- 24:16Dart team's functional future
- 27:02Recap and conclusion
- 28:06Q&A session
related talks
48mKotlin & Functional Programming: pick the best, skip the rest
37mA Guide To Functional Programming
01h 44mFunctional Programming: Technical Reasons to Adapt
58mFunctional Programming with C#
31mA Primer on Functional Programming
45mFrom Imperative to Functional
50mFrom Javascript to Haskell : Functional Programming made simple
01h 06mDesigning Applications with Functional Programming Constructs
