Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Documentation
class (Pointable t, Bindable t) => Monad t Source #
Let f :: (Pointable t, Bindable t) => a -> t a Let g :: (Pointable t, Bindable t) => a -> t a Let h :: (Pointable t, Bindable t) => t a
When providing a new instance, you should ensure it satisfies the three laws: * Left identity: point a >>= f ≡ f a * Right identity: h >>= point ≡ h * Associativity: h >>= (\x -> f x >>= g) ≡ (h >>= f) >>= g
Instances
Monad Maybe Source # | |
Defined in Pandora.Paradigm.Basis.Maybe | |
Monad Identity Source # | |
Defined in Pandora.Paradigm.Basis.Identity | |
Monad (Proxy :: Type -> Type) Source # | |
Defined in Pandora.Paradigm.Basis.Proxy | |
Monad (Environment e) Source # | |
Defined in Pandora.Paradigm.Inventory.Environment | |
(Avoidable t, Alternative t) => Monad (Twister t) Source # | |
Defined in Pandora.Paradigm.Basis.Twister | |
Monad (State s) Source # | |
Defined in Pandora.Paradigm.Inventory.State | |
Monad (Conclusion e) Source # | |
Defined in Pandora.Paradigm.Basis.Conclusion | |
Monad (Tagged tag) Source # | |
Defined in Pandora.Paradigm.Basis.Tagged | |
Monad t => Monad (Continuation r t) Source # | |
Defined in Pandora.Paradigm.Basis.Continuation | |
Monad u => Monad (UT Co Co Maybe u) Source # | |
Defined in Pandora.Paradigm.Basis.Maybe | |
Monad u => Monad (UT Co Co (Conclusion e) u) Source # | |
Defined in Pandora.Paradigm.Basis.Conclusion | |
Monad u => Monad (TUV Co Co Co ((->) s :: Type -> Type) u ((:*:) s)) Source # | |
Defined in Pandora.Paradigm.Inventory.State |