Functional Programming basics for PHP developers
summary
Explains that lambda calculus is the foundation of functional programming, contrasting typed lambda calculus (guaranteed termination) with untyped lambda calculus (Turing-complete and undecidable). Covers PHP-specific FP features and limitations: closures, create_function strings, recursion vs loops, lack of tail-call optimization (so recursion can overflow), and shows examples including recursive sum, currying, immutable list operations, and implementing a Maybe monad with flatMap for null/error handling; notes practical tradeoffs and points to Scala and other tools for stronger FP support.
AI-written summary · about
chapters (12)
- 0:00Functional programming intro
- 1:50Code issues causes
- 3:16Leibniz and Church origins
- 6:25Lambda calculus basics
- 9:43Typed lambda decidability
- 13:55Category theory insights
- 17:13PHP functions syntax
- 18:40Recursion and tail calls
- 20:30Functional data structures
- 22:44Monads in PHP
- 24:56Maybe monad practice
- 26:43Functional pros and cons
