Laziness in Haskell — Part 2: Why not Strict Haskell?

Answering the question raised at the end of Part 1, we take a look at how a hypothetical Strict Haskell would tie the compilers hands despite pervasive purity. We also examine how laziness permits optimizations that come with no intrinsic cost and compare its benefits to a strict language with opt-in laziness.

Part 1: https://www.youtube.com/watch?v=fSqE-HSh_NU
Part 3: https://www.youtube.com/watch?v=Xceng7i98Y0
Series Playlist: https://www.youtube.com/playlist?list=PLyzwHTVJlRc8620PjqbM0x435-6-Gi1Gu

—
Contact:
• Tweag Website: https://www.tweag.io/
• Tweag Twitter: https://twitter.com/tweagio
• Alexis King's Twitter: https://twitter.com/lexi_lambda