Copyright | (c) Nils Schweinsberg 2011 (c) George Giorgidze 2011 (c) University Tuebingen 2011 |
---|---|
License | BSD-style (see the file libraries/base/LICENSE) |
Maintainer | [email protected] |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell2010 |
Monadic zipping (used for monad comprehensions)
class Monad m => MonadZip m where Source
MonadZip
type class. Minimal definition: mzip
or mzipWith
Instances should satisfy the laws:
liftM (f *** g) (mzip ma mb) = mzip (liftM f ma) (liftM g mb)
liftM (const ()) ma = liftM (const ()) mb ==> munzip (mzip ma mb) = (ma, mb)
MonadZip [] | Since: 4.3.1.0 |
MonadZip Maybe | Since: 4.8.0.0 |
MonadZip Par1 | Since: 4.9.0.0 |
MonadZip Last | Since: 4.8.0.0 |
MonadZip First | Since: 4.8.0.0 |
MonadZip Product | Since: 4.8.0.0 |
MonadZip Sum | Since: 4.8.0.0 |
MonadZip Dual | Since: 4.8.0.0 |
MonadZip Identity | Since: 4.8.0.0 |
MonadZip NonEmpty | Since: 4.9.0.0 |
MonadZip (U1 *) | Since: 4.9.0.0 |
MonadZip (Proxy *) | Since: 4.9.0.0 |
MonadZip f => MonadZip (Rec1 * f) | Since: 4.9.0.0 |
MonadZip f => MonadZip (Alt * f) | Since: 4.8.0.0 |
(MonadZip f, MonadZip g) => MonadZip ((:*:) * f g) | Since: 4.9.0.0 |
(MonadZip f, MonadZip g) => MonadZip (Product * f g) | Since: 4.9.0.0 |
MonadZip f => MonadZip (M1 * i c f) | Since: 4.9.0.0 |
© The University of Glasgow and others
Licensed under a BSD-style license (see top of the page).
https://downloads.haskell.org/~ghc/8.2.1/docs/html/libraries/base-4.10.0.0/Control-Monad-Zip.html