j
k
j a
j l
On 9/28/07, Ross Paterson wrote:
However one can define reversor :: Traversable f => f a -> f a which returns something of the same shape, but with the contents reversed.
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?
Back to the thread
Back to the list