Search results

• MonadPlus reform proposal
  class Monad m => MonadZero m where mzero :: m a
  4 KB (609 words) - 18:22, 23 June 2015
• Mutable variable
  data T m a = Cons { write :: a -> m (), read :: m a } modify :: Monad m => T m a -> (a -> a) -> m ()
  2 KB (338 words) - 20:04, 13 May 2020
• New monads/MonadRandom
  class (Monad m) => MonadRandom m where getRandom :: (Random a) => m a
  6 KB (894 words) - 13:41, 2 April 2019
• Upgrading from MTL 1 to MTL 2
  * ''Could not deduce (Functor m) from the context (Monad m)<br/>arising from a use of fmap'' * ''Could not deduce (Functor m) from the context (Monad m)<br/>arising from the superclasses of an instance declaration''
  2 KB (374 words) - 00:43, 9 April 2021
• Monad Transformers Tutorial
  newtype MaybeT m a = MaybeT { runMaybeT :: m (Maybe a)
  5 KB (801 words) - 19:04, 8 February 2014
• Merely monadic
  * <code>return :: Monad m => a -> m a</code>: | <code>:: m a</code>
  6 KB (988 words) - 04:35, 16 March 2021
• 99 questions/Solutions/18
  --slice xs m n = [(xs !! (m-1)) .. (xs !! (n-1))] slice lst 1 m = slice' lst m []
  3 KB (560 words) - 22:51, 3 December 2020
• Expanding type synonyms in error messages proposal
  duplicate :: Monad m => a -> Producer a m () doubleUp :: Monad m => Consumer String m String
  2 KB (215 words) - 09:14, 19 June 2015
• Diagrams/Converting
  ! !! <code>QDiagram ... m</code> !! <code>Diagram</code> ! <code>QDiagram ... m</code>
  3 KB (373 words) - 20:53, 2 June 2017
• Monads as containers/is
  ...ldi ásamt auka upplýsingum. Auka upplýsingarnar eru mismunandi fyrir hvern mónað. Fyrir Either eru auka upplýsingarnar eitt Boolean: annaðhvort Left return :: (Monad m) => a -> m a
  3 KB (553 words) - 12:08, 13 August 2015
• Haskell入門 5ステップ
  ack m 0 = ack (m-1) 1 ack m n = ack (m-1) (ack m (n-1))
  7 KB (356 words) - 07:44, 16 November 2019
• Monad laws
  | <haskell>m</haskell> | <haskell>m</haskell>
  5 KB (788 words) - 10:40, 1 February 2024
• Ru/GHC/Class Instance Extensions
  class Map m k v where empty :: m k v
  3 KB (170 words) - 23:05, 29 June 2021
• Random shuffle
  fisherYatesStep (m, gen) (i, x) = ((insert j x . insert i (m ! j)) m, gen') {- | @grabble xs m n@ is /O(m*n')/, where @n' = min n (length xs)@
  5 KB (743 words) - 13:10, 9 May 2017
• Concurrency demos/Haskell-Javascript concurrency
  Just m -> putLine "" ("Success") doc body showmsg t m doc body =
  4 KB (517 words) - 04:59, 26 April 2021
• Contstuff
  newtype ContT r m a ...tT'' behaves like the identity monad. A computation of type <hask>ContT r m a</hask> is a CPS computation with an intermediate result of type <hask>a</
  12 KB (2,067 words) - 05:43, 9 March 2021
• Testing primality
  f k m | r == 1 = (k,m)
  4 KB (605 words) - 17:09, 18 July 2022
• Performance/Monads
  instance (Monoid m, Error e) => Monad (DRMonad e s w) where bindDRMonad :: Monoid m => DRMonad a e s w -> (a -> DRMonad b e s w) -> DRMonad b e s w
  6 KB (995 words) - 23:51, 16 April 2021
• MapReduce as a monad
  ...hask>m</hask> be a <hask>Monad'</hask>, a type with four parameters: <hask>m s a s' b</hask>. m s a s' b -> ( b -> m s' b s'' c ) -> m s a s'' c
  6 KB (1,053 words) - 03:27, 9 April 2021
• Humor/Dialogs
  Student: Hey, you're cheating! I'm the one doing all the work here! I'm generating primes faster than I need them, so really I'm stealing
  3 KB (445 words) - 15:19, 6 February 2021

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