Copyright  (c) Russell O'Connor 2009 

License  BSDstyle (see the file LICENSE) 
Maintainer  R.Paterson@city.ac.uk 
Stability  experimental 
Portability  portable 
Safe Haskell  Safe 
Language  Haskell98 
Making functors whose elements are notionally in the reverse order from the original functor.
 newtype Reverse f a = Reverse {
 getReverse :: f a
Documentation
The same functor, but with Foldable
and Traversable
instances
that process the elements in the reverse order.
Reverse  

Functor f => Functor (Reverse * f) Source  Derived instance. 
Applicative f => Applicative (Reverse * f) Source  Derived instance. 
Foldable f => Foldable (Reverse * f) Source  Fold from right to left. 
Traversable f => Traversable (Reverse * f) Source  Traverse from right to left. 
Alternative f => Alternative (Reverse * f) Source  Derived instance. 
Show1 f => Show1 (Reverse * f) Source  
Read1 f => Read1 (Reverse * f) Source  
Ord1 f => Ord1 (Reverse * f) Source  
Eq1 f => Eq1 (Reverse * f) Source  
(Eq1 f, Eq a) => Eq (Reverse * f a) Source  
(Ord1 f, Ord a) => Ord (Reverse * f a) Source  
(Read1 f, Read a) => Read (Reverse * f a) Source  
(Show1 f, Show a) => Show (Reverse * f a) Source 