@hackage/duoids

All notable changes to this project will be documented in this file.

The format is based on Keep a Changelog 1.1, and this project adheres to the Haskell Package Versioning Policy.

Applicative and Monad instances for Commutative itself, so it can be used with DerivingVia to give your own commutative Monad a Duoidal instance, rather than only being usable through Parallel and Sequential
commutativeAp and sequentialAp
Normal duoidal instances for the commutative functors in base: Complex, Down, Dual, Identity, Max, Maybe, Min, Monoid.First, Monoid.Last, Monoid.Product, Proxy, Semigroup.First, Semigroup.Last, Solo, Sum, ->, (,,), (,,,), and Const
Cabal flag lint, which (when disabled, as is the default) allows the dependency graph to be pruned, potentially avoiding solver & compilation issues.

Applicative (Parallel (Commutative f)) and Applicative (Sequential (Commutative f)) now require f to be a Monad rather than merely an Applicative. Commutative was always documented as being for commutative Monads, but the instances asked for less than they meant; the new Commutative instances need the stronger constraint.

no-recursion is no longer a dependency by default (thanks to the aforementioned lint change).