2 ms·
I think the overall outlook in PL research is that the "next Haskell" should abstract away altogether from the whole strict/lazy distinction by treating both 's
by zozbot234 3y ago
I think the overall outlook in PL research is that the "next Haskell" should abstract away altogether from the whole strict/lazy distinction by treating both 'strictness' and 'laziness' on a first-class basis, leveraging ideas such as polarity, focusing and call-by-push-value.
This would essentially make 'data' types strict by default and 'codata' types lazy by default, but with easy syntax to add laziness or strictness after the fact. And some types (tuples, functions) would exist in both 'data' (strict by default) and 'codata' (lazy by default) flavors.
- KirillPanov 3y ago> make 'data' types strict by default and 'codata' types lazy by default Coq has been doing exactly this for over a decade...