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:
• Laziness in Haskell — Part 1: Prologue
Series Playlist:
• Laziness in Haskell
—
Contact:
• Tweag Website: https://www.tweag.io/
• Tweag Twitter: https://twitter.com/tweagio
• Alexis King's Twitter: https://twitter.com/lexi_lambda