6 ms·
It turns out that purely functional data structures are useful anyway as a solution to concurrency, though.
by philwelch 14y ago
It turns out that purely functional data structures are useful anyway as a solution to concurrency, though.
- Drbble 14y agoImmutable structures, yes. And you can get those without Haskell's other baggage. Haskell is great for research in persistent data structures because it is impossible to cheat. But then it is more industry-practical to port the algorithms than write an application in Haskell. check out Google's MapReduce and Flume papers, for example.