4 ms·
In a way. It's a subset of Haskell focused on array operations that optimize really really well. You can use these instead of list operations, basically, and ge
by dons 17y ago
In a way. It's a subset of Haskell focused on array operations that optimize really really well. You can use these instead of list operations, basically, and getter performance in all sorts of ways.
- eru 17y agoYou could get very good performance when you do the fusion manually, too. The really exciting thing about fusion is that it allows really fast code that _composes_ well. Composability is also what makes Haskellers excited about Monads and software transactional memory (STM). STM give composable concurrency --- in contrast with locks which are notoriously uncomposable.