Skip to content
0:00 / 0:00

#laziness#strictness#ghc

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

Tweag by Modus Create

5K subscribers • 25 videos on Hallway

YouTube
  • Recommended by 2 people: 1 on Lobsters and 1 in engineering communities.
  • Presented by Alexis King
  • An opinion. It argues one side of a question engineers disagree on.

Intermediate. Assumes working knowledge.

6.6K views3 years ago2 recommendations

Programming languagesSoftware designHaskellFunctional programmingPerformance and optimization

Alexis King explains why a hypothetical strict-by-default Haskell would limit compiler optimizations and why laziness provides unique benefits.

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: youtube.com/watch?v=fSqE-HSh_NU Part 3: youtube.com/watch?v=Xceng7i98Y0 Series Playlist: youtube.com/playlist?list=PLyzwHTVJlRc8620PjqbM0x435-6-Gi1Gu — Contact: • Tweag Website: tweag.io/ • Tweag Twitter: twitter.com/tweagio • Alexis King's Twitter: twitter.com/lexi_lambda

Why it's here

2 people recommend this

What people say. Recommended as a brilliant defense of laziness in Haskell, explaining how it enables optimizations that strict languages cannot easily perform.

u/lexi-lambdain r/haskell • Recommends

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

adamshayloron Lobsters • Recommends

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