Functional Programming in an Imperative World. Maybe
summary
Claims that Python already has the FP tools and then shows them: higher-order functions implemented as decorators and returned callables, immutable data illustrated with tuples and linked to persistent-data-structure work, and map filter reduce performance demonstrated on large sequences (fast, iterator-based, and memory-friendly). Recursion examples expose Python’s lack of tail-call optimization and a practical recursion limit ~1000, and examples run in a Jupyter Notebook on GitHub so code is available to clone and verify.
AI-written summary · about
chapters (28)
- 0:00Introduction
- 1:46Functional Programming
- 1:59Why Functional Programming
- 2:46Concurrent Parallel Programming
- 3:20What is Functional Programming
- 4:32Functional Programming Tools
- 5:04HigherOrder Functions
- 8:44Return Functions
- 10:08Calling Functions
- 10:24Passing Back Functions
- 11:03decorators
- 12:00immutable data structures
- 16:13tuples
- 17:45recursion
- 19:44recursive summation
- 21:59recursion error
- 24:21map filter and reduce
- 24:45lambdas
- 25:55filter
- 28:16map
- 28:39transform
- 29:29themap
- 30:35reduce
- 31:57reduce example
- 36:03list comprehensions
- 36:25filtering functions
- 36:52Should we bring functional programming into our code
- 38:38Questions
related talks
27mFunctional Programming for Pythonistas
30mFunctional Programming in Python
39mFunctional Programming in Python
02h 43mFunctional Python
29mWriting Functional Code in Python
37mFunctional Programming for Data Scientists
02h 28mFunctional Python
33mPythonic `functional` (`iter`)tools for your data challenges
