Case Study: Npm uses Rust for its CPU-bound bottlenecks [pdf]

Re:Case Study: Npm uses Rust for its CPU-bound bottlenecks [... by platz on Sunday March 03, 2019 @11:32AM (#19295240)

Default laziness in Haskell is not as big a problem as is made out to be. For someone like NPM though, Haskell's current GC would probably be too much of a bottleneck. Haskell's GC is tuned for lots of small garbage and does not like a large persistent working-set. But this has nothing to do with laziness.

[ Parent | on HN ]

Re:Case Study: Npm uses Rust for its CPU-bound bottlenecks [... by Jare on Sunday March 03, 2019 @11:43AM (#19295300)

> Default laziness in Haskell is not as big a problem as is made out to be

It will take a fair amount of time to be proficient in Haskell to the point where it is not a (potential) big problem.

[ Parent | on HN ]

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.

[ Parent | on HN ]