More efficient folds for Seq
Open
discussion/rfc
performance
Seq
- Dominant language
- Haskell
- Stars
- 355
- Forks
- 194
- Avg merge
- 3d 4h
- Merged PRs (30d)
- 4
Description
We can define folds for `Seq` more efficiently. See thread starting https://github.com/haskell/containers/issues/1016#issuecomment-2336465956 and in particular the code by treeowl in https://github.com/haskell/containers/issues/1016#issuecomment-2337033674
The catch is that we need GADTs, which is not portable.
Contributor guide
Assessment
This issue has not been assessed yet.