| Copyright | (c) Russell O'Connor 2009 |
|---|---|
| License | BSD-style (see the file LICENSE) |
| Maintainer | [email protected] |
| Stability | experimental |
| Portability | portable |
| Safe Haskell | Safe |
| Language | Haskell98 |
Making functors with an Applicative instance that performs actions in the reverse order.
The same functor, but with an Applicative instance that performs actions in the reverse order.
| Functor f => Functor (Backwards f) | Derived instance. |
| Applicative f => Applicative (Backwards f) | Apply |
| Foldable f => Foldable (Backwards f) | Derived instance. |
| Traversable f => Traversable (Backwards f) | Derived instance. |
| Alternative f => Alternative (Backwards f) | Try alternatives in the same order as |
| Show1 f => Show1 (Backwards f) | |
| Read1 f => Read1 (Backwards f) | |
| Ord1 f => Ord1 (Backwards f) | |
| Eq1 f => Eq1 (Backwards f) | |
| (Eq1 f, Eq a) => Eq (Backwards f a) | |
| (Ord1 f, Ord a) => Ord (Backwards f a) | |
| (Read1 f, Read a) => Read (Backwards f a) | |
| (Show1 f, Show a) => Show (Backwards f a) |
© The University of Glasgow and others
Licensed under a BSD-style license (see top of the page).
https://downloads.haskell.org/~ghc/7.10.3/docs/html/libraries/transformers-0.4.2.0/Control-Applicative-Backwards.html