Hitchhiker's Guide to Functional Programming
summary
Starts from an imperative Java loop that computes the sum of squares of even numbers (result 220) and refactors it into small pure functions, showing iterate/filter/square/sum as separate composable expressions, then replaces loops with recursion and lifts patterns into higher-order combinators like flatMap/fold/map implemented with Java 8 lambdas. Demonstrates that Java 8 Streams reproduce the same pipeline, explains improved testability (no mocks), and warns about recursion/tail-call limits in JVM while recommending library-backed immutable structures for performance.
AI-written summary · about
chapters (6)
- 0:00Start
- 3:30The Challenge
- 31:46flatMap as fold
- 35:03Beware Recursion
- 40:46On Performance
- 42:53On Testing...
related talks
52mFunctional Programming with Java 8
57mLearning To Code In Functional Style with Java
43mRefactoring to Functional Style
56mJava Functional Programming Idioms
51mFunctional Programming with Java
36mHow functional programming change my Java code
01h 00mWhat The Functional Programming
55mFunctional Programming Patterns with Java8
