Thunks, Sharing, Laziness: The Haskell Heap Visualized – Joachim Breitner

Haskell is a high-level, declarative language that frees you from worrying about how your programs are actually executed, and that is a good thing. Nevertheless, it can be quite useful to know how things work under the hood.

In his talk, our guest speaker Joachim takes you on a tour to the heap of a running Haskell program, where you’ll get to see the shape of data types, observe sharing and laziness, distinguish infinite and cyclic data structures, and watch a lazy tree grow as a recursive function gets memoized.

FP merch that doesn't suck 👇
https://shop.serokell.io/

Follow on social media:
  / nomeata  
  / serokell  

Learn more about us:
https://serokell.io/

Contact us:
[email protected]

Timeline:
0:00 Introduction
0:38 Setting up ghc-vis
2:22 Simple data structures
7:15 Lists
9:16 Sharing in lists
12:18 Laziness
27:50 Cyclic data structures
36:30 How to use laziness for memoization