Portability  portable 

Stability  experimental 
Maintainer  libraries@haskell.org 
Safe Haskell  SafeInfered 
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)  Derived instance. 
Applicative f => Applicative (Reverse f)  Derived instance. 
Foldable f => Foldable (Reverse f)  Fold from right to left. 
Traversable f => Traversable (Reverse f)  Traverse from right to left. 
Alternative f => Alternative (Reverse f)  Derived instance. 