| Copyright | (c) 2011 Patrick Bahr, Tom Hvitved |
|---|---|
| License | BSD3 |
| Maintainer | Tom Hvitved <hvitved@diku.dk> |
| Stability | experimental |
| Portability | non-portable (GHC Extensions) |
| Safe Haskell | Safe-Inferred |
| Language | Haskell98 |
Data.Comp.Param.Ditraversable
Description
This module defines traversable difunctors.
- class Difunctor f => Ditraversable f where
- dimapM :: Monad m => (b -> m c) -> f a b -> m (f a c)
- disequence :: Monad m => f a (m b) -> m (f a b)
Documentation
class Difunctor f => Ditraversable f where Source
Difunctors representing data structures that can be traversed from left to right.
Minimal complete definition
Nothing
Methods
dimapM :: Monad m => (b -> m c) -> f a b -> m (f a c) Source
disequence :: Monad m => f a (m b) -> m (f a b) Source
Instances
| Ditraversable f => Ditraversable ((:&:) f p) | |
| (Ditraversable f, Ditraversable g) => Ditraversable ((:+:) f g) |