[Haskell-cafe] Dynamic choice of "reverse" implementation

David Benbennick dbenbenn at gmail.com
Fri Sep 28 14:24:33 EDT 2007

On 9/28/07, Ross Paterson <ross at soi.city.ac.uk> wrote:
> However one can define
>         reversor :: Traversable f => f a -> f a
> which returns something of the same shape, but with the contents reversed.

How?  Is it possible to define a version of foldl for Traversable?

More information about the Haskell-Cafe mailing list