Not Quite Object Oriented
summary
Shows CoffeeScript examples (postage + discount + tax) and implements compos, bind, unit, lift to glue pure functions so composing p and d yields 130 and composing t,p,d yields 165 without mutating originals. Demonstrates Haskell currying and an infinite fibs sequence where take 10 returns the first ten numbers, and Python lambdas building lists/trees via Church-encoded cons/car/cdr, then defines reduce and factorial (5! = 120). Notes JavaScript lacks tail call optimization so deep recursion will blow the stack.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 1:55Aslam Khan
- 2:38Functional Programming
- 3:28No Ruby
- 4:17CoffeeScript
- 6:30Function Composition
- 9:10Debugging
- 11:07Binding
- 19:37State monett
- 22:07Fibonacci
