Questions tagged [traversable]

In Haskell, class of data structures that can be traversed from left to right, performing an action on each element. Defined in Data.Traversable.

In Haskell, class of data structures that can be traversed from left to right, performing an action on each element.

Defined in Data.Traversable.

76 questions
-4
votes
1 answer

How can i understand this Traversable implementation for lists

I'm having trouble to understand the following example from the NICTA course: instance Traversable List where traverse :: Applicative f => (a -> f b) -> List a -> f (List b) traverse f = foldRight (\a…
beHappy
  • 15
  • 3
1 2 3 4 5
6