Dynamic Programming in Haskell | Lazy Evaluation | Infinite Data Structures

In this video, I explain how to implement Dynamic Programming in Haskell by making use of the lazy evaluation feature of Haskell and the ability to define infinite data structures in a self-referential way.

The video also explains how to scale up the approach from one dimensional dynamic programming to multi-dimensional dynamic programming without having to change much of the core logic.

Because of being a purely functional programming language, Haskell allows a very declarative style of programming which can be used to our advantage for encoding recursive relations as they are and making use of its unique ability to declare infinite data structure in a self-referential manner.

[johnpavel]

fibs = 1 : 2 : zipWith (+) fibs (tail fibs)

[hrtmtbrng]

This video has nothing to do with dynamic programming. The author has no idea what dynamic programming is. The video is nice, but the title does not fit.