Join Newsletter

Memoizing Algorithms

YOW! Lambda Jam 2013

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.

Andrew Newman

Software Developer

Megaport

Australia

Andrew is a software developer who has over 20 years of experience.  He has applied Agile and Lean development methodologies in both academia and industry in areas such as database development, banking, molecular bioscience, consumer analytics, traffic modelling and geographical systems.