Search results

From HaskellWiki

There is no page titled "MonadPlus,".

For more information about searching HaskellWiki, see Help.

Showing below up to 20 results starting with #1.

View (previous 20) (next 20) (20 | 50 | 100 | 250 | 500)

Page title matches

1. MonadPlus (1,601 bytes)
   1: {{Standard class|MonadPlus|module=Control.Monad|module-doc=Control-Monad|pac...
   2: The '''MonadPlus''' class is defined like this:
   5: class (Monad m) => MonadPlus m where
   10: The precise set of rules that MonadPlus should obey is not agreed upon.
   42: ...eft Distribution'''. This makes <hask>[]</hask> a MonadPlus, but not <hask>Maybe</hask> or <hask>IO</hask>.
2. MonadPlus reform proposal (3,478 bytes)
   1: The [[MonadPlus]] class is ambiguous: while all instances satisfy...
   5: It is proposed that MonadPlus be split like this:
   20: === MonadPlus ===
   23: class MonadZero m => MonadPlus m where
   65: instance MonadPlus Maybe where
3. Ce sunt Monad respectiv MonadPlus ? (1,297 bytes)

Page text matches

1. MonadPlus (1,601 bytes)
   1: {{Standard class|MonadPlus|module=Control.Monad|module-doc=Control-Monad|pac...
   2: The '''MonadPlus''' class is defined like this:
   5: class (Monad m) => MonadPlus m where
   10: The precise set of rules that MonadPlus should obey is not agreed upon.
   42: ...eft Distribution'''. This makes <hask>[]</hask> a MonadPlus, but not <hask>Maybe</hask> or <hask>IO</hask>.
2. MonadPlus reform proposal (3,478 bytes)
   1: The [[MonadPlus]] class is ambiguous: while all instances satisfy...
   5: It is proposed that MonadPlus be split like this:
   20: === MonadPlus ===
   23: class MonadZero m => MonadPlus m where
   65: instance MonadPlus Maybe where
3. Simple to complex (6,203 bytes)
   103: filter :: (MonadPlus m) => (a -> Bool) -> m a -> m a
4. Haskell in practice (13,964 bytes)
   49: ... but not by me - I don't understand MonadZero and MonadPlus. -->
5. Blow your mind (11,105 bytes)
   45: ensure :: MonadPlus m => (a -> Bool) -> a -> m a
   269: more fun with monad, monadPlus (liftM, ap, guard, when)
6. Generalised algebraic datatype (8,399 bytes)
   104: ... could generalise the return type to being in any MonadPlus. Note that an advantage of this representation wh...
7. Sudoku (59,698 bytes)
   47: deriving (Functor, Monad, MonadPlus)
   51: deriving (Functor, Monad, MonadPlus)
   130: instance (Monad m) => MonadPlus (NondetT m) where
   137: ...et (NondetT Identity a) deriving (Functor, Monad, MonadPlus)
   144: option :: (MonadPlus m) => [a] -> m a
8. Class system extension proposal (7,650 bytes)
   105: ... annoyance is that the <hask>Monoid</hask>, <hask>MonadPlus</hask> and <hask>ArrowPlus</hask> are all essenti...
9. Stateful nondeterminism (1,338 bytes)
   17: instance MonadPlus (SuperState s t) where
10. Chaitin's construction/Parser (3,835 bytes)
    95: neverfailing :: MonadPlus m => m a -> m (Maybe a)
11. New monads/LazyWriterT (2,283 bytes)
    31: instance (Monoid w, MonadPlus m) => MonadPlus (LazyWriterT w m) where
12. HaWiki migration (53,644 bytes)
    620: ...ttp://www.haskell.org/wikisnapshot/MonadPlus.html MonadPlus]
13. Abstract data type (5,426 bytes)
    86: left :: (MonadPlus m) => t a -> m (t a)
    87: right :: (MonadPlus m) => t a -> m (t a)
    88: value :: (MonadPlus m) => t a -> m a
14. Haskell programming tips/Discussion (24,782 bytes)
    279: ...ails</hask>, the code would even have type <hask>(MonadPlus m, Functor m) => Int -> [a] -> m [a]</hask>, incr...
15. 99 questions/Solutions/70 (4,390 bytes)
    25: instance MonadPlus P where
16. Haskell Quiz/Housie/Solution Dolio (3,194 bytes)
    30: splitAtM :: MonadPlus m => Int -> [a] -> m ([a], [a])
17. New monads/MonadAdvSTM (24,718 bytes)
    142: import Control.Monad(MonadPlus(..),liftM)
    164: ...dvSTM (ReaderT Env STM a) deriving (Functor,Monad,MonadPlus,Typeable)
    169: ...se` gives the semantics Simon wants, use deriving MonadPlus instead
    170: instance MonadPlus AdvSTM where
    375: import Control.Monad(MonadPlus(..),liftM,when)
18. Intrebarile incepatorului (14,094 bytes)
    98: * [[Ce sunt Monad respectiv MonadPlus ? ]]
19. New monads/MonadSplit (4,456 bytes)
    13: > class MonadPlus m => MonadSplit m where
    124: > search :: (MonadSplit s, MonadPlus p) =>
20. The Other Prelude (7,351 bytes)
    97: -- We copy from the MonadPlus reform proposal (link below) now.
    105: class (MonadZero mp) => MonadPlus mp where
    162: ... reform proposal]] - Clarifies ambiguities around MonadPlus laws (adopted by ''The Other Prelude'')

View (previous 20) (next 20) (20 | 50 | 100 | 250 | 500)

Search in namespaces:
(Main) Talk User User talk HaskellWiki HaskellWiki talk Image Image talk MediaWiki MediaWiki talk Template Template talk Help Help talk Category Category talk
List redirects
Search for