Re:Case Study: Npm uses Rust for its CPU-bound bottlenecks [...
by platz on Sunday March 03, 2019 @11:49AM
(#19295349)
Honestly just using strict data structures (one StrictData pragma will do) and strict accumulators in recursive functions will get you there, it's not that hard.
It will take a fair amount of time to be proficient in Haskell to the point where it is not a (potential) big problem.