Control.MonadPlus.Graph

Documentation

class GMonadZero m => GMonadPlus m where

Graph indexed monad with a monoidal operation satisfying the left distribution law.

See the typeclassopedia https://wiki.haskell.org/Typeclassopedia.

Minimal complete definition

gplus

Associated Types

type Plus m (i :: p) (j :: p) :: p

The or operation (mplus) on the graph index.

Default instance: Plus m i j = Combine m i j

type PlusInv m (i :: p) (j :: p) :: Constraint

An invariant on the indexes of Plus.

Default instance: PlusInv m i j = Inv m i j

Methods

gplus :: PlusInv m i j => m i a -> m j a -> m (Plus m i j) a

An associative binary operation (mplus).

Instances

MonadPlus m => GMonadPlus * (GWrapped m)

Associated Types

type Plus (GWrapped m) (m :: GWrapped m -> * -> *) (i :: GWrapped m) (j :: GWrapped m) :: p

type PlusInv (GWrapped m) (m :: GWrapped m -> * -> *) (i :: GWrapped m) (j :: GWrapped m) :: Constraint

Methods

gplus :: PlusInv (GWrapped m) m i j => m i a -> m j a -> m (Plus (GWrapped m) m i j) a

IxMonadPlus * m => GMonadPlus (*, *) (WrappedIx m)

Associated Types

type Plus (WrappedIx m) (m :: WrappedIx m -> * -> *) (i :: WrappedIx m) (j :: WrappedIx m) :: p

type PlusInv (WrappedIx m) (m :: WrappedIx m -> * -> *) (i :: WrappedIx m) (j :: WrappedIx m) :: Constraint

Methods

gplus :: PlusInv (WrappedIx m) m i j => m i a -> m j a -> m (Plus (WrappedIx m) m i j) a