Functional Programming for Dummies*

on YouTube ↗41m

" summary

Starts by defining referential transparency and shows the substitution model, then proves why pure functions plus immutable pairs require recursion and tail-call style by converting a looping average into a tail-recursive accumulator. Moves from ES6 examples to Haskell to demonstrate currying, replacing sum with foldr as sum, pointfree map/compose, algebraic types and pattern matching, Hindley‑Milner type inference, and verifies the Maybe functor laws by concrete examples.

AI-written summary · about

" chapters (9)

1. 0:00Intro
2. 0:50What is Functional Programming
3. 11:03Point Free Programming
4. 17:15Algebraic Data Types
5. 22:29Hindley Milner Type System
6. 28:19Functor
7. 31:19Category Theory
8. 33:59FMap
9. 40:46Conclusion

" related talks

• 49mFunctional Programming EssentialsKelley Robinson · Scala Days Copenhagen 2017
• 41mFunctional programming: Give it a chance!Dmytro Tereshchenko · VinnytsiaJS 2018
• 56mFunctional Programming with JavaScriptSimon Painter · foss-north 2020
• 45mFunctional Programming bits and piecesZuzanna Kruszczynska · Software Crafters Barcelona 2019
• 44mFunctional Programming You Already KnowKevlin Henney · Codemotion Rome 2015
• 43mFunctional programming is not just lambdas!David Sferruzza · Codemotion Amsterdam 2017
• 46mFunctional Programming with GoDylan Meeus · GopherCon 2020
• 58mFunctional Programming with C#Simon Painter · NDC Porto 2022