Hacker News Reader

Making Haskell strict-by-default would also break the rewrite engine which is the core of Haskell's high performance with functional combinators.

The whole haskell project is about allowing programmers to write code that is declarative without making concessions for performance. Laziness makes this possible because it abstracts out evaluation order and thus allows extreme optimization by the compiler

I don't see how the rewrite engine would break if Haskell would be strict. Can you expand on that?

Idris for instance is strict "by default" but still supports laziness through the Lazy data type.

Forgot about Idris.

Elm, PureScript, OCaml (Reason/ReScript) and F# did come to mind.

Isn't that basically every other ML variant?

Not exactly. Syntax-aside, MLs in general: have better module systems than Haskell, no typeclasses, and aren’t pure.