Memoizing Algorithms

Please log in to watch this conference skillscast.

Memoization is a technique that allows programs to trade memory usage for improved runtime performance. This is achieved in Haskell by using lazy data structures. However, they should have no effect but to improve the performance making their effectiveness difficult to test and verify. Examples of lazy evaluation, thunks, and the issue of “space leaks” will be given.

YOU MAY ALSO LIKE:

• Category Theory and Life (SkillsCast recorded in May 2018)
• Signature inference for functional property discovery (SkillsCast recorded in May 2018)