Check strictness details for Data.Tree instances
Open
docs
Tree
- Dominant language
- Haskell
- Stars
- 355
- Forks
- 194
- Avg merge
- 3d 4h
- Merged PRs (30d)
- 4
Description
I recently fixed a strictness problem affecting an identity law for the `Monad Tree` instance. We should verify that strictness is okay for the associativity law, and similarly check strictness for the `MonadFix` laws. One question is whether list conses should contain thunks that evaluate to trees or the trees themselves.
Contributor guide
Assessment
This issue has not been assessed yet.