Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
class (Covariant (->) (->) t, Monoidal (->) (->) (:*:) (:*:) t, Bindable (->) t) => Monad t Source #
Let f :: (Monoidal t (->) (->) (:*:) (:*:), Bindable t) => a -> t a Let g :: (Monoidal t (->) (->) (:*:) (:*:), Bindable t) => a -> t a Let h :: (Monoidal t (->) (->) (:*:) (:*:), Bindable t) => t a
When providing a new instance, you should ensure it satisfies: * Left identity: point a >>= f ≡ f a * Right identity: h >>= point ≡ h * Associativity: h >>= (f >=> g) ≡ (h >>= f) >>= g
Instances
Monad Identity Source # | |
Defined in Pandora.Paradigm.Primary.Functor.Identity | |
Monad t => Monad (Instruction t) Source # | |
Monad (State s) Source # | |
Defined in Pandora.Paradigm.Inventory.State | |
Monad (Tagged tag) Source # | |
Defined in Pandora.Paradigm.Primary.Functor.Tagged | |
(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (Schematic Monad t u), Monoidal ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (:*:) (:*:) (Schematic Monad t u), Bindable ((->) :: Type -> Type -> Type) (t :> u)) => Monad (t :> u) Source # | |
type Schematic Monad Maybe Source # | |
type Schematic Monad (Conclusion e) Source # | |
Defined in Pandora.Paradigm.Primary.Functor.Conclusion | |
type Schematic Monad (State s) Source # | |
type Schematic Monad (Environment e) Source # | |
Defined in Pandora.Paradigm.Inventory.Environment | |
type Schematic Monad (Accumulator e) Source # | |
Defined in Pandora.Paradigm.Inventory.Accumulator |