Unlifted types vs strict-wrapper

[atravers]

Well, there’s another solution to the “thunk-building” problem:

What about having StrictData and non-strict semantics on functions as the default programming style?

Alternatively, we could use an implementation that has no (heap) space to leak e.g. figure 9 on page 24 of On Inter-deriving Small-step and Big-step Semantics: A Case Study for Storeless Call-by-need Evaluation (2011). Now if that could be implemented in GHC (or some other Haskell implementation), I believe it would greatly reduce the need for strictness annotations…and the need for “semi-duplicate” types with varying levels of strictness. That we have “semi-duplicate” definitions for varying …