@hackage functor-apply0.10.4

Haskell 98: Applicative sans pure, Monad sans return, Alternative sans empty

Provides a wide array of semigroup based Functors.

When working with comonads you often have the <*> portion of an Applicative, but not the pure. This was captured in Uustalu and Vene's "Essence of Dataflow Programming" in the form of the ComonadZip class in the days before Applicative. Apply provides a weaker invariant, but for the comonads used for data flow programming (found in the streams package), this invariant is preserved.

Ideally the following relationships would hold:

Traversable <---- Foldable <--- Functor ------> Alt ---------> Plus
     |               |            |                              |
     v               v            v                              v
Traversable1 <--- Foldable1     Apply --------> Applicative -> Alternative
                                  |               |              |
                                  v               v              v
                                Bind ---------> Monad -------> MonadPlus



Bitraversable <-- Bifoldable <- Bifunctor                      Semigroupoid
    |                  |          |                              |
    v                  v          v                              v
Bitraversable1 <- Bifoldable1   Biapply                        Category
                                                                 |
                                                                 v
                                                               Arrow

This lets us remove many of the restrictions from various monad transformers as in many cases the binding operation or <*> operation does not require them.

Finally, to work with these weaker structures it is beneficial to have containers that can provide stronger guarantees about their contents, so versions of Traversable and Foldable that can be folded with just a Semigroup are added.