Control.MonadOr.Graph

Documentation

class GMonadZero m => GMonadOr m where

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

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

Minimal complete definition

gorelse

Associated Types

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

The or operation (<|>) on the graph index.

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

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

An invariant on the indexes of Or.

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

Methods

gorelse :: OrInv m i j => m i a -> m j a -> m (Or m i j) a

An associative binary operation (<|>).

Instances

(Alternative m, MonadPlus m) => GMonadOr * (GWrapped m)

Associated Types

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

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

Methods

gorelse :: OrInv (GWrapped m) m i j => m i a -> m j a -> m (Or (GWrapped m) m i j) a