Haskell Nuggets Power Series Brought to Life
summary
Haskell implements power series as lists of coefficients and uses lazy lists and numeric overloading to make sum, product, integral, derivative, composition and inversion into concise code. Division becomes long division with defenses against zero divisors; reversion (the functional inverse) is a single-line with feedback that actually computes coefficients. Generating functions execute to produce Catalan and Pascal sequences; the uploader claims ten one-liners suffice to get Pascal's triangle, and the examples shown run and produce the expected integer and rational coefficients.
AI-written summary · about
chapters (6)
- 0:00Start
- 8:44Long Division
- 11:11Reversion
- 14:38Sum of the Geometric Series
- 18:04Differential Equations
- 23:27Application Generating Function for the Binomial Coefficients
related talks
45mFunctional Programming bits and pieces
01h 22mHaskell for Everyday Programmers
58mLet’s Get Lazy—The Real Power of Functional Programming
01h 02mHaskell for Java Programmers
38mNot Quite Object Oriented
42mThe Power of Function Composition
55mModern Software Development with Haskell
42mProgramming with Math