Copyright | (c) Russell O'Connor 2009 |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | R.Paterson@city.ac.uk |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell98 |
Control.Applicative.Backwards
Description
Making functors with an Applicative
instance that performs actions
in the reverse order.
Documentation
The same functor, but with an Applicative
instance that performs
actions in the reverse order.
Instances
Functor f => Functor (Backwards (TYPE Lifted) f) | Derived instance. |
Applicative f => Applicative (Backwards (TYPE Lifted) f) | Apply |
Foldable f => Foldable (Backwards (TYPE Lifted) f) | Derived instance. |
Traversable f => Traversable (Backwards (TYPE Lifted) f) | Derived instance. |
Eq1 f => Eq1 (Backwards (TYPE Lifted) f) | |
Ord1 f => Ord1 (Backwards (TYPE Lifted) f) | |
Read1 f => Read1 (Backwards (TYPE Lifted) f) | |
Show1 f => Show1 (Backwards (TYPE Lifted) f) | |
Alternative f => Alternative (Backwards (TYPE Lifted) f) | Try alternatives in the same order as |
(Eq1 f, Eq a) => Eq (Backwards (TYPE Lifted) f a) | |
(Ord1 f, Ord a) => Ord (Backwards (TYPE Lifted) f a) | |
(Read1 f, Read a) => Read (Backwards (TYPE Lifted) f a) | |
(Show1 f, Show a) => Show (Backwards (TYPE Lifted) f a) | |