Copyright | (c) Nils Schweinsberg 2011, (c) George Giorgidze 2011 (c) University Tuebingen 2011 |
---|---|
License | BSD-style (see the file libraries/base/LICENSE) |
Maintainer | libraries@haskell.org |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell2010 |
Monadic zipping (used for monad comprehensions)
Documentation
class Monad m => MonadZip m where Source #
MonadZip
type class. Minimal definition: mzip
or mzipWith
Instances should satisfy the laws:
- Naturality :
liftM (f *** g) (mzip ma mb) = mzip (liftM f ma) (liftM g mb)
- Information Preservation:
liftM (const ()) ma = liftM (const ()) mb ==> munzip (mzip ma mb) = (ma, mb)
MonadZip [] # | |
MonadZip Maybe # | |
MonadZip U1 # | |
MonadZip Par1 # | |
MonadZip Last # | |
MonadZip First # | |
MonadZip Product # | |
MonadZip Sum # | |
MonadZip Dual # | |
MonadZip NonEmpty # | |
MonadZip Identity # | |
MonadZip f => MonadZip (Rec1 f) # | |
MonadZip (Proxy *) # | |
(MonadZip f, MonadZip g) => MonadZip ((:*:) f g) # | |
MonadZip f => MonadZip (Alt * f) # | |
MonadZip f => MonadZip (M1 i c f) # | |
(MonadZip f, MonadZip g) => MonadZip (Product * f g) # | |