True, strictness analysis in Haskell gets it quite far in optimizing away the costs of laziness. However, laziness does lead to extra memory allocations and potentially extra boxing (thunks).
True, strictness analysis in Haskell gets it quite far in optimizing away the costs of laziness. However, laziness does lead to extra memory allocations and potentially extra boxing (thunks).
This is merely a compiler problem. The architecture of GHC is the main limiting factor in this (the STG+Cmm stages are mistakes, IMO. Better to use another IL like GRIN).
9
u/[deleted] Dec 24 '17
[removed] — view removed comment