Control.Super.Monad

Representation of supermonads in Haskell.

Supermonads

class (Functor m, Functor n, Functor p) => Bind m n p where

Representation of bind operations for supermonads. A proper supermonad consists of an instance for Bind, Return and optionally Fail.

The instances are required to follow a certain scheme. If the type constructor of your supermonad is M there may only be exactly one Bind and one Return instance that look as follows:

instance Bind (M ...) (M ...) (M ...) where
  ...
instance Return (M ...) where
  ...

This is enforced by the plugin. A compilation error will result from either instance missing or multiple instances for M.

For supermonads we expect the usual monad laws to hold:

• return a >>= k  =  k a

• m >>= return  =  m

• m >>= (\x -> k x >>= h)  =  (m >>= k) >>= h

• fmap f xs  =  xs >>= return . f

Minimal complete definition

(>>=)

Associated Types

type BindCts m n p :: Constraint

Methods

(>>=) :: BindCts m n p => m a -> (a -> n b) -> p b infixl 1

(>>) :: BindCts m n p => m a -> n b -> p b infixl 1

Instances

Bind [] [] []

Associated Types

type BindCts ([] :: * -> *) ([] :: * -> *) ([] :: * -> *) :: Constraint

Methods

(>>=) :: BindCts [] [] [] => [a] -> (a -> [b]) -> [b]

(>>) :: BindCts [] [] [] => [a] -> [b] -> [b]

Bind Maybe Maybe Maybe

Associated Types

type BindCts (Maybe :: * -> *) (Maybe :: * -> *) (Maybe :: * -> *) :: Constraint

Methods

(>>=) :: BindCts Maybe Maybe Maybe => Maybe a -> (a -> Maybe b) -> Maybe b

(>>) :: BindCts Maybe Maybe Maybe => Maybe a -> Maybe b -> Maybe b

Bind IO IO IO

Associated Types

type BindCts (IO :: * -> *) (IO :: * -> *) (IO :: * -> *) :: Constraint

Methods

(>>=) :: BindCts IO IO IO => IO a -> (a -> IO b) -> IO b

(>>) :: BindCts IO IO IO => IO a -> IO b -> IO b

Bind Complex Complex Complex

Associated Types

type BindCts (Complex :: * -> *) (Complex :: * -> *) (Complex :: * -> *) :: Constraint

Methods

(>>=) :: BindCts Complex Complex Complex => Complex a -> (a -> Complex b) -> Complex b

(>>) :: BindCts Complex Complex Complex => Complex a -> Complex b -> Complex b

Bind Min Min Min

Associated Types

type BindCts (Min :: * -> *) (Min :: * -> *) (Min :: * -> *) :: Constraint

Methods

(>>=) :: BindCts Min Min Min => Min a -> (a -> Min b) -> Min b

(>>) :: BindCts Min Min Min => Min a -> Min b -> Min b

Bind Max Max Max

Associated Types

type BindCts (Max :: * -> *) (Max :: * -> *) (Max :: * -> *) :: Constraint

Methods

(>>=) :: BindCts Max Max Max => Max a -> (a -> Max b) -> Max b

(>>) :: BindCts Max Max Max => Max a -> Max b -> Max b

Bind First First First

Associated Types

type BindCts (First :: * -> *) (First :: * -> *) (First :: * -> *) :: Constraint

Methods

(>>=) :: BindCts First First First => First a -> (a -> First b) -> First b

(>>) :: BindCts First First First => First a -> First b -> First b

Bind Last Last Last

Associated Types

type BindCts (Last :: * -> *) (Last :: * -> *) (Last :: * -> *) :: Constraint

Methods

(>>=) :: BindCts Last Last Last => Last a -> (a -> Last b) -> Last b

(>>) :: BindCts Last Last Last => Last a -> Last b -> Last b

Bind Option Option Option

Associated Types

type BindCts (Option :: * -> *) (Option :: * -> *) (Option :: * -> *) :: Constraint

Methods

(>>=) :: BindCts Option Option Option => Option a -> (a -> Option b) -> Option b

(>>) :: BindCts Option Option Option => Option a -> Option b -> Option b

Bind NonEmpty NonEmpty NonEmpty

Associated Types

type BindCts (NonEmpty :: * -> *) (NonEmpty :: * -> *) (NonEmpty :: * -> *) :: Constraint

Methods

(>>=) :: BindCts NonEmpty NonEmpty NonEmpty => NonEmpty a -> (a -> NonEmpty b) -> NonEmpty b

(>>) :: BindCts NonEmpty NonEmpty NonEmpty => NonEmpty a -> NonEmpty b -> NonEmpty b

Bind Identity Identity Identity

Associated Types

type BindCts (Identity :: * -> *) (Identity :: * -> *) (Identity :: * -> *) :: Constraint

Methods

(>>=) :: BindCts Identity Identity Identity => Identity a -> (a -> Identity b) -> Identity b

(>>) :: BindCts Identity Identity Identity => Identity a -> Identity b -> Identity b

Bind STM STM STM

Associated Types

type BindCts (STM :: * -> *) (STM :: * -> *) (STM :: * -> *) :: Constraint

Methods

(>>=) :: BindCts STM STM STM => STM a -> (a -> STM b) -> STM b

(>>) :: BindCts STM STM STM => STM a -> STM b -> STM b

Bind Dual Dual Dual

Associated Types

type BindCts (Dual :: * -> *) (Dual :: * -> *) (Dual :: * -> *) :: Constraint

Methods

(>>=) :: BindCts Dual Dual Dual => Dual a -> (a -> Dual b) -> Dual b

(>>) :: BindCts Dual Dual Dual => Dual a -> Dual b -> Dual b

Bind Sum Sum Sum

Associated Types

type BindCts (Sum :: * -> *) (Sum :: * -> *) (Sum :: * -> *) :: Constraint

Methods

(>>=) :: BindCts Sum Sum Sum => Sum a -> (a -> Sum b) -> Sum b

(>>) :: BindCts Sum Sum Sum => Sum a -> Sum b -> Sum b

Bind Product Product Product

Associated Types

type BindCts (Product :: * -> *) (Product :: * -> *) (Product :: * -> *) :: Constraint

Methods

(>>=) :: BindCts Product Product Product => Product a -> (a -> Product b) -> Product b

(>>) :: BindCts Product Product Product => Product a -> Product b -> Product b

Bind First First First

Associated Types

type BindCts (First :: * -> *) (First :: * -> *) (First :: * -> *) :: Constraint

Methods

(>>=) :: BindCts First First First => First a -> (a -> First b) -> First b

(>>) :: BindCts First First First => First a -> First b -> First b

Bind Last Last Last

Associated Types

type BindCts (Last :: * -> *) (Last :: * -> *) (Last :: * -> *) :: Constraint

Methods

(>>=) :: BindCts Last Last Last => Last a -> (a -> Last b) -> Last b

(>>) :: BindCts Last Last Last => Last a -> Last b -> Last b

Bind ReadPrec ReadPrec ReadPrec

Associated Types

type BindCts (ReadPrec :: * -> *) (ReadPrec :: * -> *) (ReadPrec :: * -> *) :: Constraint

Methods

(>>=) :: BindCts ReadPrec ReadPrec ReadPrec => ReadPrec a -> (a -> ReadPrec b) -> ReadPrec b

(>>) :: BindCts ReadPrec ReadPrec ReadPrec => ReadPrec a -> ReadPrec b -> ReadPrec b

Bind ReadP ReadP ReadP

Associated Types

type BindCts (ReadP :: * -> *) (ReadP :: * -> *) (ReadP :: * -> *) :: Constraint

Methods

(>>=) :: BindCts ReadP ReadP ReadP => ReadP a -> (a -> ReadP b) -> ReadP b

(>>) :: BindCts ReadP ReadP ReadP => ReadP a -> ReadP b -> ReadP b

Bind (Either e) (Either e) (Either e)

Associated Types

type BindCts (Either e :: * -> *) (Either e :: * -> *) (Either e :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (Either e) (Either e) (Either e) => Either e a -> (a -> Either e b) -> Either e b

(>>) :: BindCts (Either e) (Either e) (Either e) => Either e a -> Either e b -> Either e b

Bind (U1 *) (U1 *) (U1 *)

Associated Types

type BindCts (U1 * :: * -> *) (U1 * :: * -> *) (U1 * :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (U1 *) (U1 *) (U1 *) => U1 * a -> (a -> U1 * b) -> U1 * b

(>>) :: BindCts (U1 *) (U1 *) (U1 *) => U1 * a -> U1 * b -> U1 * b

Bind (ST s) (ST s) (ST s)

Associated Types

type BindCts (ST s :: * -> *) (ST s :: * -> *) (ST s :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (ST s) (ST s) (ST s) => ST s a -> (a -> ST s b) -> ST s b

(>>) :: BindCts (ST s) (ST s) (ST s) => ST s a -> ST s b -> ST s b

Bind (ST s) (ST s) (ST s)

Associated Types

type BindCts (ST s :: * -> *) (ST s :: * -> *) (ST s :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (ST s) (ST s) (ST s) => ST s a -> (a -> ST s b) -> ST s b

(>>) :: BindCts (ST s) (ST s) (ST s) => ST s a -> ST s b -> ST s b

(Bind m m m, Monad m) => Bind (WrappedMonad m) (WrappedMonad m) (WrappedMonad m)

TODO / FIXME: The wrapped monad instances for Functor and Monad are both based on m being a monad, although the functor instance should only be dependend on m being a functor (as can be seen below). This can only be fixed by either giving a custom version of WrappedMonad here or by fixing the version of WrappedMonad in base. Once this issue is fixed we can replace the Monad constraint with a Functor constraint.

instance (Functor m) => Functor (App.WrappedMonad m) where
  fmap f m = App.WrapMonad $ fmap (App.unwrapMonad m) f

Associated Types

type BindCts (WrappedMonad m :: * -> *) (WrappedMonad m :: * -> *) (WrappedMonad m :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (WrappedMonad m) (WrappedMonad m) (WrappedMonad m) => WrappedMonad m a -> (a -> WrappedMonad m b) -> WrappedMonad m b

(>>) :: BindCts (WrappedMonad m) (WrappedMonad m) (WrappedMonad m) => WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b

ArrowApply a => Bind (ArrowMonad a) (ArrowMonad a) (ArrowMonad a)

Associated Types

type BindCts (ArrowMonad a :: * -> *) (ArrowMonad a :: * -> *) (ArrowMonad a :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (ArrowMonad a) (ArrowMonad a) (ArrowMonad a) => ArrowMonad a a -> (a -> ArrowMonad a b) -> ArrowMonad a b

(>>) :: BindCts (ArrowMonad a) (ArrowMonad a) (ArrowMonad a) => ArrowMonad a a -> ArrowMonad a b -> ArrowMonad a b

Bind (Proxy *) (Proxy *) (Proxy *)

Associated Types

type BindCts (Proxy * :: * -> *) (Proxy * :: * -> *) (Proxy * :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (Proxy *) (Proxy *) (Proxy *) => Proxy * a -> (a -> Proxy * b) -> Proxy * b

(>>) :: BindCts (Proxy *) (Proxy *) (Proxy *) => Proxy * a -> Proxy * b -> Proxy * b

(Return n, Bind m n p) => Bind (MaybeT m) (MaybeT n) (MaybeT p)

Associated Types

type BindCts (MaybeT m :: * -> *) (MaybeT n :: * -> *) (MaybeT p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (MaybeT m) (MaybeT n) (MaybeT p) => MaybeT m a -> (a -> MaybeT n b) -> MaybeT p b

(>>) :: BindCts (MaybeT m) (MaybeT n) (MaybeT p) => MaybeT m a -> MaybeT n b -> MaybeT p b

Bind m n p => Bind (Rec1 * m) (Rec1 * n) (Rec1 * p)

Associated Types

type BindCts (Rec1 * m :: * -> *) (Rec1 * n :: * -> *) (Rec1 * p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (Rec1 * m) (Rec1 * n) (Rec1 * p) => Rec1 * m a -> (a -> Rec1 * n b) -> Rec1 * p b

(>>) :: BindCts (Rec1 * m) (Rec1 * n) (Rec1 * p) => Rec1 * m a -> Rec1 * n b -> Rec1 * p b

Bind m n p => Bind (Alt * m) (Alt * n) (Alt * p)

Associated Types

type BindCts (Alt * m :: * -> *) (Alt * n :: * -> *) (Alt * p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (Alt * m) (Alt * n) (Alt * p) => Alt * m a -> (a -> Alt * n b) -> Alt * p b

(>>) :: BindCts (Alt * m) (Alt * n) (Alt * p) => Alt * m a -> Alt * n b -> Alt * p b

(Bind m n p, Return n) => Bind (ExceptT e m) (ExceptT e n) (ExceptT e p)

Associated Types

type BindCts (ExceptT e m :: * -> *) (ExceptT e n :: * -> *) (ExceptT e p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (ExceptT e m) (ExceptT e n) (ExceptT e p) => ExceptT e m a -> (a -> ExceptT e n b) -> ExceptT e p b

(>>) :: BindCts (ExceptT e m) (ExceptT e n) (ExceptT e p) => ExceptT e m a -> ExceptT e n b -> ExceptT e p b

Bind m n p => Bind (StateT s m) (StateT s n) (StateT s p)

Associated Types

type BindCts (StateT s m :: * -> *) (StateT s n :: * -> *) (StateT s p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (StateT s m) (StateT s n) (StateT s p) => StateT s m a -> (a -> StateT s n b) -> StateT s p b

(>>) :: BindCts (StateT s m) (StateT s n) (StateT s p) => StateT s m a -> StateT s n b -> StateT s p b

Bind m n p => Bind (StateT s m) (StateT s n) (StateT s p)

Associated Types

type BindCts (StateT s m :: * -> *) (StateT s n :: * -> *) (StateT s p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (StateT s m) (StateT s n) (StateT s p) => StateT s m a -> (a -> StateT s n b) -> StateT s p b

(>>) :: BindCts (StateT s m) (StateT s n) (StateT s p) => StateT s m a -> StateT s n b -> StateT s p b

(Monoid w, Bind m n p) => Bind (WriterT w m) (WriterT w n) (WriterT w p)

Associated Types

type BindCts (WriterT w m :: * -> *) (WriterT w n :: * -> *) (WriterT w p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (WriterT w m) (WriterT w n) (WriterT w p) => WriterT w m a -> (a -> WriterT w n b) -> WriterT w p b

(>>) :: BindCts (WriterT w m) (WriterT w n) (WriterT w p) => WriterT w m a -> WriterT w n b -> WriterT w p b

(Monoid w, Bind m n p) => Bind (WriterT w m) (WriterT w n) (WriterT w p)

Associated Types

type BindCts (WriterT w m :: * -> *) (WriterT w n :: * -> *) (WriterT w p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (WriterT w m) (WriterT w n) (WriterT w p) => WriterT w m a -> (a -> WriterT w n b) -> WriterT w p b

(>>) :: BindCts (WriterT w m) (WriterT w n) (WriterT w p) => WriterT w m a -> WriterT w n b -> WriterT w p b

Bind m n p => Bind (IdentityT * m) (IdentityT * n) (IdentityT * p)

Associated Types

type BindCts (IdentityT * m :: * -> *) (IdentityT * n :: * -> *) (IdentityT * p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (IdentityT * m) (IdentityT * n) (IdentityT * p) => IdentityT * m a -> (a -> IdentityT * n b) -> IdentityT * p b

(>>) :: BindCts (IdentityT * m) (IdentityT * n) (IdentityT * p) => IdentityT * m a -> IdentityT * n b -> IdentityT * p b

Bind ((->) LiftedRep LiftedRep r) ((->) LiftedRep LiftedRep r) ((->) LiftedRep LiftedRep r)

Associated Types

type BindCts ((LiftedRep -> LiftedRep) r :: * -> *) ((LiftedRep -> LiftedRep) r :: * -> *) ((LiftedRep -> LiftedRep) r :: * -> *) :: Constraint

Methods

(>>=) :: BindCts ((LiftedRep -> LiftedRep) r) ((LiftedRep -> LiftedRep) r) ((LiftedRep -> LiftedRep) r) => (LiftedRep -> LiftedRep) r a -> (a -> (LiftedRep -> LiftedRep) r b) -> (LiftedRep -> LiftedRep) r b

(>>) :: BindCts ((LiftedRep -> LiftedRep) r) ((LiftedRep -> LiftedRep) r) ((LiftedRep -> LiftedRep) r) => (LiftedRep -> LiftedRep) r a -> (LiftedRep -> LiftedRep) r b -> (LiftedRep -> LiftedRep) r b

(Bind f g h, Bind f' g' h') => Bind ((:*:) * f f') ((:*:) * g g') ((:*:) * h h')

Associated Types

type BindCts ((* :*: f) f' :: * -> *) ((* :*: g) g' :: * -> *) ((* :*: h) h' :: * -> *) :: Constraint

Methods

(>>=) :: BindCts ((* :*: f) f') ((* :*: g) g') ((* :*: h) h') => (* :*: f) f' a -> (a -> (* :*: g) g' b) -> (* :*: h) h' b

(>>) :: BindCts ((* :*: f) f') ((* :*: g) g') ((* :*: h) h') => (* :*: f) f' a -> (* :*: g) g' b -> (* :*: h) h' b

(Bind m1 n1 p1, Bind m2 n2 p2) => Bind (Product * m1 m2) (Product * n1 n2) (Product * p1 p2)

Associated Types

type BindCts (Product * m1 m2 :: * -> *) (Product * n1 n2 :: * -> *) (Product * p1 p2 :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (Product * m1 m2) (Product * n1 n2) (Product * p1 p2) => Product * m1 m2 a -> (a -> Product * n1 n2 b) -> Product * p1 p2 b

(>>) :: BindCts (Product * m1 m2) (Product * n1 n2) (Product * p1 p2) => Product * m1 m2 a -> Product * n1 n2 b -> Product * p1 p2 b

Bind (ContT * r m) (ContT * r m) (ContT * r m)

TODO / FIXME: Still need to figure out how and if we can generalize the continuation implementation.

Associated Types

type BindCts (ContT * r m :: * -> *) (ContT * r m :: * -> *) (ContT * r m :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (ContT * r m) (ContT * r m) (ContT * r m) => ContT * r m a -> (a -> ContT * r m b) -> ContT * r m b

(>>) :: BindCts (ContT * r m) (ContT * r m) (ContT * r m) => ContT * r m a -> ContT * r m b -> ContT * r m b

Bind m n p => Bind (ReaderT * r m) (ReaderT * r n) (ReaderT * r p)

Associated Types

type BindCts (ReaderT * r m :: * -> *) (ReaderT * r n :: * -> *) (ReaderT * r p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (ReaderT * r m) (ReaderT * r n) (ReaderT * r p) => ReaderT * r m a -> (a -> ReaderT * r n b) -> ReaderT * r p b

(>>) :: BindCts (ReaderT * r m) (ReaderT * r n) (ReaderT * r p) => ReaderT * r m a -> ReaderT * r n b -> ReaderT * r p b

Bind f g h => Bind (M1 * i c f) (M1 * i c g) (M1 * i c h)

Associated Types

type BindCts (M1 * i c f :: * -> *) (M1 * i c g :: * -> *) (M1 * i c h :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (M1 * i c f) (M1 * i c g) (M1 * i c h) => M1 * i c f a -> (a -> M1 * i c g b) -> M1 * i c h b

(>>) :: BindCts (M1 * i c f) (M1 * i c g) (M1 * i c h) => M1 * i c f a -> M1 * i c g b -> M1 * i c h b

(Monoid w, Bind m n p) => Bind (RWST r w s m) (RWST r w s n) (RWST r w s p)

Associated Types

type BindCts (RWST r w s m :: * -> *) (RWST r w s n :: * -> *) (RWST r w s p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (RWST r w s m) (RWST r w s n) (RWST r w s p) => RWST r w s m a -> (a -> RWST r w s n b) -> RWST r w s p b

(>>) :: BindCts (RWST r w s m) (RWST r w s n) (RWST r w s p) => RWST r w s m a -> RWST r w s n b -> RWST r w s p b

(Monoid w, Bind m n p) => Bind (RWST r w s m) (RWST r w s n) (RWST r w s p)

Associated Types

type BindCts (RWST r w s m :: * -> *) (RWST r w s n :: * -> *) (RWST r w s p :: * -> *) :: Constraint

Methods

(>>=) :: BindCts (RWST r w s m) (RWST r w s n) (RWST r w s p) => RWST r w s m a -> (a -> RWST r w s n b) -> RWST r w s p b

(>>) :: BindCts (RWST r w s m) (RWST r w s n) (RWST r w s p) => RWST r w s m a -> RWST r w s n b -> RWST r w s p b

class Functor m => Return m where

See Bind or Ap for details on laws and requirements.

Minimal complete definition

return

Associated Types

type ReturnCts m :: Constraint

Methods

return :: ReturnCts m => a -> m a

Instances

Return []

Associated Types

type ReturnCts ([] :: * -> *) :: Constraint

Methods

return :: ReturnCts [] => a -> [a]

Return Maybe

Associated Types

type ReturnCts (Maybe :: * -> *) :: Constraint

Methods

return :: ReturnCts Maybe => a -> Maybe a

Return IO

Associated Types

type ReturnCts (IO :: * -> *) :: Constraint

Methods

return :: ReturnCts IO => a -> IO a

Return Complex

Associated Types

type ReturnCts (Complex :: * -> *) :: Constraint

Methods

return :: ReturnCts Complex => a -> Complex a

Return Min

Associated Types

type ReturnCts (Min :: * -> *) :: Constraint

Methods

return :: ReturnCts Min => a -> Min a

Return Max

Associated Types

type ReturnCts (Max :: * -> *) :: Constraint

Methods

return :: ReturnCts Max => a -> Max a

Return First

Associated Types

type ReturnCts (First :: * -> *) :: Constraint

Methods

return :: ReturnCts First => a -> First a

Return Last

Associated Types

type ReturnCts (Last :: * -> *) :: Constraint

Methods

return :: ReturnCts Last => a -> Last a

Return Option

Associated Types

type ReturnCts (Option :: * -> *) :: Constraint

Methods

return :: ReturnCts Option => a -> Option a

Return NonEmpty

Associated Types

type ReturnCts (NonEmpty :: * -> *) :: Constraint

Methods

return :: ReturnCts NonEmpty => a -> NonEmpty a

Return Identity

Associated Types

type ReturnCts (Identity :: * -> *) :: Constraint

Methods

return :: ReturnCts Identity => a -> Identity a

Return STM

Associated Types

type ReturnCts (STM :: * -> *) :: Constraint

Methods

return :: ReturnCts STM => a -> STM a

Return Dual

Associated Types

type ReturnCts (Dual :: * -> *) :: Constraint

Methods

return :: ReturnCts Dual => a -> Dual a

Return Sum

Associated Types

type ReturnCts (Sum :: * -> *) :: Constraint

Methods

return :: ReturnCts Sum => a -> Sum a

Return Product

Associated Types

type ReturnCts (Product :: * -> *) :: Constraint

Methods

return :: ReturnCts Product => a -> Product a

Return First

Associated Types

type ReturnCts (First :: * -> *) :: Constraint

Methods

return :: ReturnCts First => a -> First a

Return Last

Associated Types

type ReturnCts (Last :: * -> *) :: Constraint

Methods

return :: ReturnCts Last => a -> Last a

Return ReadPrec

Associated Types

type ReturnCts (ReadPrec :: * -> *) :: Constraint

Methods

return :: ReturnCts ReadPrec => a -> ReadPrec a

Return ReadP

Associated Types

type ReturnCts (ReadP :: * -> *) :: Constraint

Methods

return :: ReturnCts ReadP => a -> ReadP a

Return (Either e)

Associated Types

type ReturnCts (Either e :: * -> *) :: Constraint

Methods

return :: ReturnCts (Either e) => a -> Either e a

Return (U1 *)

Associated Types

type ReturnCts (U1 * :: * -> *) :: Constraint

Methods

return :: ReturnCts (U1 *) => a -> U1 * a

Return (ST s)

Associated Types

type ReturnCts (ST s :: * -> *) :: Constraint

Methods

return :: ReturnCts (ST s) => a -> ST s a

Return (ST s)

Associated Types

type ReturnCts (ST s :: * -> *) :: Constraint

Methods

return :: ReturnCts (ST s) => a -> ST s a

(Return m, Monad m) => Return (WrappedMonad m)

TODO / FIXME: This has the same issue as the Bind instance for WrappedMonad.

Associated Types

type ReturnCts (WrappedMonad m :: * -> *) :: Constraint

Methods

return :: ReturnCts (WrappedMonad m) => a -> WrappedMonad m a

ArrowApply a => Return (ArrowMonad a)

Associated Types

type ReturnCts (ArrowMonad a :: * -> *) :: Constraint

Methods

return :: ReturnCts (ArrowMonad a) => a -> ArrowMonad a a

Return (Proxy *)

Associated Types

type ReturnCts (Proxy * :: * -> *) :: Constraint

Methods

return :: ReturnCts (Proxy *) => a -> Proxy * a

Return m => Return (MaybeT m)

Associated Types

type ReturnCts (MaybeT m :: * -> *) :: Constraint

Methods

return :: ReturnCts (MaybeT m) => a -> MaybeT m a

Return m => Return (Rec1 * m)

Associated Types

type ReturnCts (Rec1 * m :: * -> *) :: Constraint

Methods

return :: ReturnCts (Rec1 * m) => a -> Rec1 * m a

Return a => Return (Alt * a)

Associated Types

type ReturnCts (Alt * a :: * -> *) :: Constraint

Methods

return :: ReturnCts (Alt * a) => a -> Alt * a a

Return m => Return (ExceptT e m)

Associated Types

type ReturnCts (ExceptT e m :: * -> *) :: Constraint

Methods

return :: ReturnCts (ExceptT e m) => a -> ExceptT e m a

Return m => Return (StateT s m)

Associated Types

type ReturnCts (StateT s m :: * -> *) :: Constraint

Methods

return :: ReturnCts (StateT s m) => a -> StateT s m a

Return m => Return (StateT s m)

Associated Types

type ReturnCts (StateT s m :: * -> *) :: Constraint

Methods

return :: ReturnCts (StateT s m) => a -> StateT s m a

(Monoid w, Return m) => Return (WriterT w m)

Associated Types

type ReturnCts (WriterT w m :: * -> *) :: Constraint

Methods

return :: ReturnCts (WriterT w m) => a -> WriterT w m a

(Monoid w, Return m) => Return (WriterT w m)

Associated Types

type ReturnCts (WriterT w m :: * -> *) :: Constraint

Methods

return :: ReturnCts (WriterT w m) => a -> WriterT w m a

Return m => Return (IdentityT * m)

Associated Types

type ReturnCts (IdentityT * m :: * -> *) :: Constraint

Methods

return :: ReturnCts (IdentityT * m) => a -> IdentityT * m a

Return ((->) LiftedRep LiftedRep r)

Associated Types

type ReturnCts ((LiftedRep -> LiftedRep) r :: * -> *) :: Constraint

Methods

return :: ReturnCts ((LiftedRep -> LiftedRep) r) => a -> (LiftedRep -> LiftedRep) r a

(Return f, Return g) => Return ((:*:) * f g)

Associated Types

type ReturnCts ((* :*: f) g :: * -> *) :: Constraint

Methods

return :: ReturnCts ((* :*: f) g) => a -> (* :*: f) g a

(Return m1, Return m2) => Return (Product * m1 m2)

Associated Types

type ReturnCts (Product * m1 m2 :: * -> *) :: Constraint

Methods

return :: ReturnCts (Product * m1 m2) => a -> Product * m1 m2 a

Return (ContT * r m)

Associated Types

type ReturnCts (ContT * r m :: * -> *) :: Constraint

Methods

return :: ReturnCts (ContT * r m) => a -> ContT * r m a

Return m => Return (ReaderT * r m)

Associated Types

type ReturnCts (ReaderT * r m :: * -> *) :: Constraint

Methods

return :: ReturnCts (ReaderT * r m) => a -> ReaderT * r m a

Return f => Return (M1 * i c f)

Associated Types

type ReturnCts (M1 * i c f :: * -> *) :: Constraint

Methods

return :: ReturnCts (M1 * i c f) => a -> M1 * i c f a

(Return f, Return g) => Return ((:.:) * * f g)

Associated Types

type ReturnCts ((* :.: *) f g :: * -> *) :: Constraint

Methods

return :: ReturnCts ((* :.: *) f g) => a -> (* :.: *) f g a

(Return f, Return f') => Return (Compose * * f f')

Associated Types

type ReturnCts (Compose * * f f' :: * -> *) :: Constraint

Methods

return :: ReturnCts (Compose * * f f') => a -> Compose * * f f' a

(Monoid w, Return m) => Return (RWST r w s m)

Associated Types

type ReturnCts (RWST r w s m :: * -> *) :: Constraint

Methods

return :: ReturnCts (RWST r w s m) => a -> RWST r w s m a

(Monoid w, Return m) => Return (RWST r w s m)

Associated Types

type ReturnCts (RWST r w s m :: * -> *) :: Constraint

Methods

return :: ReturnCts (RWST r w s m) => a -> RWST r w s m a

class Fail m where

See Bind for details on laws and requirements.

Minimal complete definition

fail

Associated Types

type FailCts m :: Constraint

Methods

fail :: FailCts m => String -> m a

Instances

Fail []

Associated Types

type FailCts ([] :: * -> *) :: Constraint

Methods

fail :: FailCts [] => String -> [a]

Fail Maybe

Associated Types

type FailCts (Maybe :: * -> *) :: Constraint

Methods

fail :: FailCts Maybe => String -> Maybe a

Fail IO

Associated Types

type FailCts (IO :: * -> *) :: Constraint

Methods

fail :: FailCts IO => String -> IO a

Fail Complex

Associated Types

type FailCts (Complex :: * -> *) :: Constraint

Methods

fail :: FailCts Complex => String -> Complex a

Fail Min

Associated Types

type FailCts (Min :: * -> *) :: Constraint

Methods

fail :: FailCts Min => String -> Min a

Fail Max

Associated Types

type FailCts (Max :: * -> *) :: Constraint

Methods

fail :: FailCts Max => String -> Max a

Fail First

Associated Types

type FailCts (First :: * -> *) :: Constraint

Methods

fail :: FailCts First => String -> First a

Fail Last

Associated Types

type FailCts (Last :: * -> *) :: Constraint

Methods

fail :: FailCts Last => String -> Last a

Fail Option

Associated Types

type FailCts (Option :: * -> *) :: Constraint

Methods

fail :: FailCts Option => String -> Option a

Fail NonEmpty

Associated Types

type FailCts (NonEmpty :: * -> *) :: Constraint

Methods

fail :: FailCts NonEmpty => String -> NonEmpty a

Fail Identity

Associated Types

type FailCts (Identity :: * -> *) :: Constraint

Methods

fail :: FailCts Identity => String -> Identity a

Fail STM

Associated Types

type FailCts (STM :: * -> *) :: Constraint

Methods

fail :: FailCts STM => String -> STM a

Fail Dual

Associated Types

type FailCts (Dual :: * -> *) :: Constraint

Methods

fail :: FailCts Dual => String -> Dual a

Fail Sum

Associated Types

type FailCts (Sum :: * -> *) :: Constraint

Methods

fail :: FailCts Sum => String -> Sum a

Fail Product

Associated Types

type FailCts (Product :: * -> *) :: Constraint

Methods

fail :: FailCts Product => String -> Product a

Fail First

Associated Types

type FailCts (First :: * -> *) :: Constraint

Methods

fail :: FailCts First => String -> First a

Fail Last

Associated Types

type FailCts (Last :: * -> *) :: Constraint

Methods

fail :: FailCts Last => String -> Last a

Fail ReadPrec

Associated Types

type FailCts (ReadPrec :: * -> *) :: Constraint

Methods

fail :: FailCts ReadPrec => String -> ReadPrec a

Fail ReadP

Associated Types

type FailCts (ReadP :: * -> *) :: Constraint

Methods

fail :: FailCts ReadP => String -> ReadP a

Fail (Either e)

Associated Types

type FailCts (Either e :: * -> *) :: Constraint

Methods

fail :: FailCts (Either e) => String -> Either e a

Fail (U1 *)

Associated Types

type FailCts (U1 * :: * -> *) :: Constraint

Methods

fail :: FailCts (U1 *) => String -> U1 * a

Fail (ST s)

Associated Types

type FailCts (ST s :: * -> *) :: Constraint

Methods

fail :: FailCts (ST s) => String -> ST s a

Fail (ST s)

Associated Types

type FailCts (ST s :: * -> *) :: Constraint

Methods

fail :: FailCts (ST s) => String -> ST s a

(Fail m, Monad m) => Fail (WrappedMonad m)

TODO / FIXME: This has the same issue as the Bind instance for WrappedMonad.

Associated Types

type FailCts (WrappedMonad m :: * -> *) :: Constraint

Methods

fail :: FailCts (WrappedMonad m) => String -> WrappedMonad m a

ArrowApply a => Fail (ArrowMonad a)

Associated Types

type FailCts (ArrowMonad a :: * -> *) :: Constraint

Methods

fail :: FailCts (ArrowMonad a) => String -> ArrowMonad a a

Fail (Proxy *)

Associated Types

type FailCts (Proxy * :: * -> *) :: Constraint

Methods

fail :: FailCts (Proxy *) => String -> Proxy * a

Return m => Fail (MaybeT m)

Associated Types

type FailCts (MaybeT m :: * -> *) :: Constraint

Methods

fail :: FailCts (MaybeT m) => String -> MaybeT m a

Fail m => Fail (Rec1 * m)

Associated Types

type FailCts (Rec1 * m :: * -> *) :: Constraint

Methods

fail :: FailCts (Rec1 * m) => String -> Rec1 * m a

Fail a => Fail (Alt * a)

Associated Types

type FailCts (Alt * a :: * -> *) :: Constraint

Methods

fail :: FailCts (Alt * a) => String -> Alt * a a

Fail m => Fail (ExceptT e m)

Associated Types

type FailCts (ExceptT e m :: * -> *) :: Constraint

Methods

fail :: FailCts (ExceptT e m) => String -> ExceptT e m a

Fail m => Fail (StateT s m)

Associated Types

type FailCts (StateT s m :: * -> *) :: Constraint

Methods

fail :: FailCts (StateT s m) => String -> StateT s m a

Fail m => Fail (StateT s m)

Associated Types

type FailCts (StateT s m :: * -> *) :: Constraint

Methods

fail :: FailCts (StateT s m) => String -> StateT s m a

(Monoid w, Fail m) => Fail (WriterT w m)

Associated Types

type FailCts (WriterT w m :: * -> *) :: Constraint

Methods

fail :: FailCts (WriterT w m) => String -> WriterT w m a

(Monoid w, Fail m) => Fail (WriterT w m)

Associated Types

type FailCts (WriterT w m :: * -> *) :: Constraint

Methods

fail :: FailCts (WriterT w m) => String -> WriterT w m a

Fail m => Fail (IdentityT * m)

Associated Types

type FailCts (IdentityT * m :: * -> *) :: Constraint

Methods

fail :: FailCts (IdentityT * m) => String -> IdentityT * m a

Fail ((->) LiftedRep LiftedRep r)

Associated Types

type FailCts ((LiftedRep -> LiftedRep) r :: * -> *) :: Constraint

Methods

fail :: FailCts ((LiftedRep -> LiftedRep) r) => String -> (LiftedRep -> LiftedRep) r a

(Fail f, Fail g) => Fail ((:*:) * f g)

Associated Types

type FailCts ((* :*: f) g :: * -> *) :: Constraint

Methods

fail :: FailCts ((* :*: f) g) => String -> (* :*: f) g a

(Fail m1, Fail m2) => Fail (Product * m1 m2)

Associated Types

type FailCts (Product * m1 m2 :: * -> *) :: Constraint

Methods

fail :: FailCts (Product * m1 m2) => String -> Product * m1 m2 a

Fail m => Fail (ContT * r m)

Associated Types

type FailCts (ContT * r m :: * -> *) :: Constraint

Methods

fail :: FailCts (ContT * r m) => String -> ContT * r m a

Fail m => Fail (ReaderT * r m)

Associated Types

type FailCts (ReaderT * r m :: * -> *) :: Constraint

Methods

fail :: FailCts (ReaderT * r m) => String -> ReaderT * r m a

Fail f => Fail (M1 * i c f)

Associated Types

type FailCts (M1 * i c f :: * -> *) :: Constraint

Methods

fail :: FailCts (M1 * i c f) => String -> M1 * i c f a

(Monoid w, Fail m) => Fail (RWST r w s m)

Associated Types

type FailCts (RWST r w s m :: * -> *) :: Constraint

Methods

fail :: FailCts (RWST r w s m) => String -> RWST r w s m a

(Monoid w, Fail m) => Fail (RWST r w s m)

Associated Types

type FailCts (RWST r w s m :: * -> *) :: Constraint

Methods

fail :: FailCts (RWST r w s m) => String -> RWST r w s m a

Super-Applicatives

class (Functor m, Functor n, Functor p) => Applicative m n p where

TODO

Minimal complete definition

(<*>)

Associated Types

type ApplicativeCts m n p :: Constraint

Methods

(<*>) :: ApplicativeCts m n p => m (a -> b) -> n a -> p b infixl 4

(*>) :: ApplicativeCts m n p => m a -> n b -> p b infixl 4

(<*) :: ApplicativeCts m n p => m a -> n b -> p a infixl 4

Instances

Applicative [] [] []

Associated Types

type ApplicativeCts ([] :: * -> *) ([] :: * -> *) ([] :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts [] [] [] => [a -> b] -> [a] -> [b]

(*>) :: ApplicativeCts [] [] [] => [a] -> [b] -> [b]

(<*) :: ApplicativeCts [] [] [] => [a] -> [b] -> [a]

Applicative Maybe Maybe Maybe

Associated Types

type ApplicativeCts (Maybe :: * -> *) (Maybe :: * -> *) (Maybe :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts Maybe Maybe Maybe => Maybe (a -> b) -> Maybe a -> Maybe b

(*>) :: ApplicativeCts Maybe Maybe Maybe => Maybe a -> Maybe b -> Maybe b

(<*) :: ApplicativeCts Maybe Maybe Maybe => Maybe a -> Maybe b -> Maybe a

Applicative IO IO IO

Associated Types

type ApplicativeCts (IO :: * -> *) (IO :: * -> *) (IO :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts IO IO IO => IO (a -> b) -> IO a -> IO b

(*>) :: ApplicativeCts IO IO IO => IO a -> IO b -> IO b

(<*) :: ApplicativeCts IO IO IO => IO a -> IO b -> IO a

Applicative Complex Complex Complex

Associated Types

type ApplicativeCts (Complex :: * -> *) (Complex :: * -> *) (Complex :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts Complex Complex Complex => Complex (a -> b) -> Complex a -> Complex b

(*>) :: ApplicativeCts Complex Complex Complex => Complex a -> Complex b -> Complex b

(<*) :: ApplicativeCts Complex Complex Complex => Complex a -> Complex b -> Complex a

Applicative Min Min Min

Associated Types

type ApplicativeCts (Min :: * -> *) (Min :: * -> *) (Min :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts Min Min Min => Min (a -> b) -> Min a -> Min b

(*>) :: ApplicativeCts Min Min Min => Min a -> Min b -> Min b

(<*) :: ApplicativeCts Min Min Min => Min a -> Min b -> Min a

Applicative Max Max Max

Associated Types

type ApplicativeCts (Max :: * -> *) (Max :: * -> *) (Max :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts Max Max Max => Max (a -> b) -> Max a -> Max b

(*>) :: ApplicativeCts Max Max Max => Max a -> Max b -> Max b

(<*) :: ApplicativeCts Max Max Max => Max a -> Max b -> Max a

Applicative First First First

Associated Types

type ApplicativeCts (First :: * -> *) (First :: * -> *) (First :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts First First First => First (a -> b) -> First a -> First b

(*>) :: ApplicativeCts First First First => First a -> First b -> First b

(<*) :: ApplicativeCts First First First => First a -> First b -> First a

Applicative Last Last Last

Associated Types

type ApplicativeCts (Last :: * -> *) (Last :: * -> *) (Last :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts Last Last Last => Last (a -> b) -> Last a -> Last b

(*>) :: ApplicativeCts Last Last Last => Last a -> Last b -> Last b

(<*) :: ApplicativeCts Last Last Last => Last a -> Last b -> Last a

Applicative Option Option Option

Associated Types

type ApplicativeCts (Option :: * -> *) (Option :: * -> *) (Option :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts Option Option Option => Option (a -> b) -> Option a -> Option b

(*>) :: ApplicativeCts Option Option Option => Option a -> Option b -> Option b

(<*) :: ApplicativeCts Option Option Option => Option a -> Option b -> Option a

Applicative NonEmpty NonEmpty NonEmpty

Associated Types

type ApplicativeCts (NonEmpty :: * -> *) (NonEmpty :: * -> *) (NonEmpty :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts NonEmpty NonEmpty NonEmpty => NonEmpty (a -> b) -> NonEmpty a -> NonEmpty b

(*>) :: ApplicativeCts NonEmpty NonEmpty NonEmpty => NonEmpty a -> NonEmpty b -> NonEmpty b

(<*) :: ApplicativeCts NonEmpty NonEmpty NonEmpty => NonEmpty a -> NonEmpty b -> NonEmpty a

Applicative Identity Identity Identity

Associated Types

type ApplicativeCts (Identity :: * -> *) (Identity :: * -> *) (Identity :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts Identity Identity Identity => Identity (a -> b) -> Identity a -> Identity b

(*>) :: ApplicativeCts Identity Identity Identity => Identity a -> Identity b -> Identity b

(<*) :: ApplicativeCts Identity Identity Identity => Identity a -> Identity b -> Identity a

Applicative STM STM STM

Associated Types

type ApplicativeCts (STM :: * -> *) (STM :: * -> *) (STM :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts STM STM STM => STM (a -> b) -> STM a -> STM b

(*>) :: ApplicativeCts STM STM STM => STM a -> STM b -> STM b

(<*) :: ApplicativeCts STM STM STM => STM a -> STM b -> STM a

Applicative Dual Dual Dual

Associated Types

type ApplicativeCts (Dual :: * -> *) (Dual :: * -> *) (Dual :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts Dual Dual Dual => Dual (a -> b) -> Dual a -> Dual b

(*>) :: ApplicativeCts Dual Dual Dual => Dual a -> Dual b -> Dual b

(<*) :: ApplicativeCts Dual Dual Dual => Dual a -> Dual b -> Dual a

Applicative Sum Sum Sum

Associated Types

type ApplicativeCts (Sum :: * -> *) (Sum :: * -> *) (Sum :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts Sum Sum Sum => Sum (a -> b) -> Sum a -> Sum b

(*>) :: ApplicativeCts Sum Sum Sum => Sum a -> Sum b -> Sum b

(<*) :: ApplicativeCts Sum Sum Sum => Sum a -> Sum b -> Sum a

Applicative Product Product Product

Associated Types

type ApplicativeCts (Product :: * -> *) (Product :: * -> *) (Product :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts Product Product Product => Product (a -> b) -> Product a -> Product b

(*>) :: ApplicativeCts Product Product Product => Product a -> Product b -> Product b

(<*) :: ApplicativeCts Product Product Product => Product a -> Product b -> Product a

Applicative First First First

Associated Types

type ApplicativeCts (First :: * -> *) (First :: * -> *) (First :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts First First First => First (a -> b) -> First a -> First b

(*>) :: ApplicativeCts First First First => First a -> First b -> First b

(<*) :: ApplicativeCts First First First => First a -> First b -> First a

Applicative Last Last Last

Associated Types

type ApplicativeCts (Last :: * -> *) (Last :: * -> *) (Last :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts Last Last Last => Last (a -> b) -> Last a -> Last b

(*>) :: ApplicativeCts Last Last Last => Last a -> Last b -> Last b

(<*) :: ApplicativeCts Last Last Last => Last a -> Last b -> Last a

Applicative ReadPrec ReadPrec ReadPrec

Associated Types

type ApplicativeCts (ReadPrec :: * -> *) (ReadPrec :: * -> *) (ReadPrec :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts ReadPrec ReadPrec ReadPrec => ReadPrec (a -> b) -> ReadPrec a -> ReadPrec b

(*>) :: ApplicativeCts ReadPrec ReadPrec ReadPrec => ReadPrec a -> ReadPrec b -> ReadPrec b

(<*) :: ApplicativeCts ReadPrec ReadPrec ReadPrec => ReadPrec a -> ReadPrec b -> ReadPrec a

Applicative ReadP ReadP ReadP

Associated Types

type ApplicativeCts (ReadP :: * -> *) (ReadP :: * -> *) (ReadP :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts ReadP ReadP ReadP => ReadP (a -> b) -> ReadP a -> ReadP b

(*>) :: ApplicativeCts ReadP ReadP ReadP => ReadP a -> ReadP b -> ReadP b

(<*) :: ApplicativeCts ReadP ReadP ReadP => ReadP a -> ReadP b -> ReadP a

Applicative (Either e) (Either e) (Either e)

Associated Types

type ApplicativeCts (Either e :: * -> *) (Either e :: * -> *) (Either e :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (Either e) (Either e) (Either e) => Either e (a -> b) -> Either e a -> Either e b

(*>) :: ApplicativeCts (Either e) (Either e) (Either e) => Either e a -> Either e b -> Either e b

(<*) :: ApplicativeCts (Either e) (Either e) (Either e) => Either e a -> Either e b -> Either e a

Applicative (U1 *) (U1 *) (U1 *)

Associated Types

type ApplicativeCts (U1 * :: * -> *) (U1 * :: * -> *) (U1 * :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (U1 *) (U1 *) (U1 *) => U1 * (a -> b) -> U1 * a -> U1 * b

(*>) :: ApplicativeCts (U1 *) (U1 *) (U1 *) => U1 * a -> U1 * b -> U1 * b

(<*) :: ApplicativeCts (U1 *) (U1 *) (U1 *) => U1 * a -> U1 * b -> U1 * a

Applicative (ST s) (ST s) (ST s)

Associated Types

type ApplicativeCts (ST s :: * -> *) (ST s :: * -> *) (ST s :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (ST s) (ST s) (ST s) => ST s (a -> b) -> ST s a -> ST s b

(*>) :: ApplicativeCts (ST s) (ST s) (ST s) => ST s a -> ST s b -> ST s b

(<*) :: ApplicativeCts (ST s) (ST s) (ST s) => ST s a -> ST s b -> ST s a

Applicative (ST s) (ST s) (ST s)

Associated Types

type ApplicativeCts (ST s :: * -> *) (ST s :: * -> *) (ST s :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (ST s) (ST s) (ST s) => ST s (a -> b) -> ST s a -> ST s b

(*>) :: ApplicativeCts (ST s) (ST s) (ST s) => ST s a -> ST s b -> ST s b

(<*) :: ApplicativeCts (ST s) (ST s) (ST s) => ST s a -> ST s b -> ST s a

(Applicative m m m, Monad m) => Applicative (WrappedMonad m) (WrappedMonad m) (WrappedMonad m)

TODO / FIXME: The wrapped monad instances for Functor and Monad are both based on m being a monad, although the functor instance should only be dependend on m being a functor (as can be seen below). This can only be fixed by either giving a custom version of WrappedMonad here or by fixing the version of WrappedMonad in base. Once this issue is fixed we can replace the Monad constraint with a Functor constraint.

instance (Functor m) => Functor (App.WrappedMonad m) where
  fmap f m = App.WrapMonad $ fmap (App.unwrapMonad m) f

Associated Types

type ApplicativeCts (WrappedMonad m :: * -> *) (WrappedMonad m :: * -> *) (WrappedMonad m :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (WrappedMonad m) (WrappedMonad m) (WrappedMonad m) => WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b

(*>) :: ApplicativeCts (WrappedMonad m) (WrappedMonad m) (WrappedMonad m) => WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b

(<*) :: ApplicativeCts (WrappedMonad m) (WrappedMonad m) (WrappedMonad m) => WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a

Arrow a => Applicative (ArrowMonad a) (ArrowMonad a) (ArrowMonad a)

Associated Types

type ApplicativeCts (ArrowMonad a :: * -> *) (ArrowMonad a :: * -> *) (ArrowMonad a :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (ArrowMonad a) (ArrowMonad a) (ArrowMonad a) => ArrowMonad a (a -> b) -> ArrowMonad a a -> ArrowMonad a b

(*>) :: ApplicativeCts (ArrowMonad a) (ArrowMonad a) (ArrowMonad a) => ArrowMonad a a -> ArrowMonad a b -> ArrowMonad a b

(<*) :: ApplicativeCts (ArrowMonad a) (ArrowMonad a) (ArrowMonad a) => ArrowMonad a a -> ArrowMonad a b -> ArrowMonad a a

Applicative (Proxy *) (Proxy *) (Proxy *)

Associated Types

type ApplicativeCts (Proxy * :: * -> *) (Proxy * :: * -> *) (Proxy * :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (Proxy *) (Proxy *) (Proxy *) => Proxy * (a -> b) -> Proxy * a -> Proxy * b

(*>) :: ApplicativeCts (Proxy *) (Proxy *) (Proxy *) => Proxy * a -> Proxy * b -> Proxy * b

(<*) :: ApplicativeCts (Proxy *) (Proxy *) (Proxy *) => Proxy * a -> Proxy * b -> Proxy * a

Applicative m n p => Applicative (MaybeT m) (MaybeT n) (MaybeT p)

Associated Types

type ApplicativeCts (MaybeT m :: * -> *) (MaybeT n :: * -> *) (MaybeT p :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (MaybeT m) (MaybeT n) (MaybeT p) => MaybeT m (a -> b) -> MaybeT n a -> MaybeT p b

(*>) :: ApplicativeCts (MaybeT m) (MaybeT n) (MaybeT p) => MaybeT m a -> MaybeT n b -> MaybeT p b

(<*) :: ApplicativeCts (MaybeT m) (MaybeT n) (MaybeT p) => MaybeT m a -> MaybeT n b -> MaybeT p a

Applicative f g h => Applicative (Rec1 * f) (Rec1 * g) (Rec1 * h)

Associated Types

type ApplicativeCts (Rec1 * f :: * -> *) (Rec1 * g :: * -> *) (Rec1 * h :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (Rec1 * f) (Rec1 * g) (Rec1 * h) => Rec1 * f (a -> b) -> Rec1 * g a -> Rec1 * h b

(*>) :: ApplicativeCts (Rec1 * f) (Rec1 * g) (Rec1 * h) => Rec1 * f a -> Rec1 * g b -> Rec1 * h b

(<*) :: ApplicativeCts (Rec1 * f) (Rec1 * g) (Rec1 * h) => Rec1 * f a -> Rec1 * g b -> Rec1 * h a

Applicative m n p => Applicative (Alt * m) (Alt * n) (Alt * p)

Associated Types

type ApplicativeCts (Alt * m :: * -> *) (Alt * n :: * -> *) (Alt * p :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (Alt * m) (Alt * n) (Alt * p) => Alt * m (a -> b) -> Alt * n a -> Alt * p b

(*>) :: ApplicativeCts (Alt * m) (Alt * n) (Alt * p) => Alt * m a -> Alt * n b -> Alt * p b

(<*) :: ApplicativeCts (Alt * m) (Alt * n) (Alt * p) => Alt * m a -> Alt * n b -> Alt * p a

Applicative m n p => Applicative (ExceptT e m) (ExceptT e n) (ExceptT e p)

Associated Types

type ApplicativeCts (ExceptT e m :: * -> *) (ExceptT e n :: * -> *) (ExceptT e p :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (ExceptT e m) (ExceptT e n) (ExceptT e p) => ExceptT e m (a -> b) -> ExceptT e n a -> ExceptT e p b

(*>) :: ApplicativeCts (ExceptT e m) (ExceptT e n) (ExceptT e p) => ExceptT e m a -> ExceptT e n b -> ExceptT e p b

(<*) :: ApplicativeCts (ExceptT e m) (ExceptT e n) (ExceptT e p) => ExceptT e m a -> ExceptT e n b -> ExceptT e p a

Bind m n p => Applicative (StateT s m) (StateT s n) (StateT s p)

Associated Types

type ApplicativeCts (StateT s m :: * -> *) (StateT s n :: * -> *) (StateT s p :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (StateT s m) (StateT s n) (StateT s p) => StateT s m (a -> b) -> StateT s n a -> StateT s p b

(*>) :: ApplicativeCts (StateT s m) (StateT s n) (StateT s p) => StateT s m a -> StateT s n b -> StateT s p b

(<*) :: ApplicativeCts (StateT s m) (StateT s n) (StateT s p) => StateT s m a -> StateT s n b -> StateT s p a

Bind m n p => Applicative (StateT s m) (StateT s n) (StateT s p)

Associated Types

type ApplicativeCts (StateT s m :: * -> *) (StateT s n :: * -> *) (StateT s p :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (StateT s m) (StateT s n) (StateT s p) => StateT s m (a -> b) -> StateT s n a -> StateT s p b

(*>) :: ApplicativeCts (StateT s m) (StateT s n) (StateT s p) => StateT s m a -> StateT s n b -> StateT s p b

(<*) :: ApplicativeCts (StateT s m) (StateT s n) (StateT s p) => StateT s m a -> StateT s n b -> StateT s p a

(Monoid w, Applicative m n p) => Applicative (WriterT w m) (WriterT w n) (WriterT w p)

Associated Types

type ApplicativeCts (WriterT w m :: * -> *) (WriterT w n :: * -> *) (WriterT w p :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (WriterT w m) (WriterT w n) (WriterT w p) => WriterT w m (a -> b) -> WriterT w n a -> WriterT w p b

(*>) :: ApplicativeCts (WriterT w m) (WriterT w n) (WriterT w p) => WriterT w m a -> WriterT w n b -> WriterT w p b

(<*) :: ApplicativeCts (WriterT w m) (WriterT w n) (WriterT w p) => WriterT w m a -> WriterT w n b -> WriterT w p a

(Monoid w, Applicative m n p) => Applicative (WriterT w m) (WriterT w n) (WriterT w p)

Associated Types

type ApplicativeCts (WriterT w m :: * -> *) (WriterT w n :: * -> *) (WriterT w p :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (WriterT w m) (WriterT w n) (WriterT w p) => WriterT w m (a -> b) -> WriterT w n a -> WriterT w p b

(*>) :: ApplicativeCts (WriterT w m) (WriterT w n) (WriterT w p) => WriterT w m a -> WriterT w n b -> WriterT w p b

(<*) :: ApplicativeCts (WriterT w m) (WriterT w n) (WriterT w p) => WriterT w m a -> WriterT w n b -> WriterT w p a

Applicative m n p => Applicative (IdentityT * m) (IdentityT * n) (IdentityT * p)

Associated Types

type ApplicativeCts (IdentityT * m :: * -> *) (IdentityT * n :: * -> *) (IdentityT * p :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (IdentityT * m) (IdentityT * n) (IdentityT * p) => IdentityT * m (a -> b) -> IdentityT * n a -> IdentityT * p b

(*>) :: ApplicativeCts (IdentityT * m) (IdentityT * n) (IdentityT * p) => IdentityT * m a -> IdentityT * n b -> IdentityT * p b

(<*) :: ApplicativeCts (IdentityT * m) (IdentityT * n) (IdentityT * p) => IdentityT * m a -> IdentityT * n b -> IdentityT * p a

Applicative ((->) LiftedRep LiftedRep r) ((->) LiftedRep LiftedRep r) ((->) LiftedRep LiftedRep r)

Associated Types

type ApplicativeCts ((LiftedRep -> LiftedRep) r :: * -> *) ((LiftedRep -> LiftedRep) r :: * -> *) ((LiftedRep -> LiftedRep) r :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts ((LiftedRep -> LiftedRep) r) ((LiftedRep -> LiftedRep) r) ((LiftedRep -> LiftedRep) r) => (LiftedRep -> LiftedRep) r (a -> b) -> (LiftedRep -> LiftedRep) r a -> (LiftedRep -> LiftedRep) r b

(*>) :: ApplicativeCts ((LiftedRep -> LiftedRep) r) ((LiftedRep -> LiftedRep) r) ((LiftedRep -> LiftedRep) r) => (LiftedRep -> LiftedRep) r a -> (LiftedRep -> LiftedRep) r b -> (LiftedRep -> LiftedRep) r b

(<*) :: ApplicativeCts ((LiftedRep -> LiftedRep) r) ((LiftedRep -> LiftedRep) r) ((LiftedRep -> LiftedRep) r) => (LiftedRep -> LiftedRep) r a -> (LiftedRep -> LiftedRep) r b -> (LiftedRep -> LiftedRep) r a

(Applicative f g h, Applicative f' g' h') => Applicative ((:*:) * f f') ((:*:) * g g') ((:*:) * h h')

Associated Types

type ApplicativeCts ((* :*: f) f' :: * -> *) ((* :*: g) g' :: * -> *) ((* :*: h) h' :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts ((* :*: f) f') ((* :*: g) g') ((* :*: h) h') => (* :*: f) f' (a -> b) -> (* :*: g) g' a -> (* :*: h) h' b

(*>) :: ApplicativeCts ((* :*: f) f') ((* :*: g) g') ((* :*: h) h') => (* :*: f) f' a -> (* :*: g) g' b -> (* :*: h) h' b

(<*) :: ApplicativeCts ((* :*: f) f') ((* :*: g) g') ((* :*: h) h') => (* :*: f) f' a -> (* :*: g) g' b -> (* :*: h) h' a

(Applicative m1 n1 p1, Applicative m2 n2 p2) => Applicative (Product * m1 m2) (Product * n1 n2) (Product * p1 p2)

Associated Types

type ApplicativeCts (Product * m1 m2 :: * -> *) (Product * n1 n2 :: * -> *) (Product * p1 p2 :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (Product * m1 m2) (Product * n1 n2) (Product * p1 p2) => Product * m1 m2 (a -> b) -> Product * n1 n2 a -> Product * p1 p2 b

(*>) :: ApplicativeCts (Product * m1 m2) (Product * n1 n2) (Product * p1 p2) => Product * m1 m2 a -> Product * n1 n2 b -> Product * p1 p2 b

(<*) :: ApplicativeCts (Product * m1 m2) (Product * n1 n2) (Product * p1 p2) => Product * m1 m2 a -> Product * n1 n2 b -> Product * p1 p2 a

Applicative (ContT * r m) (ContT * r m) (ContT * r m)

TODO / FIXME: Still need to figure out how and if we can generalize the continuation implementation.

Associated Types

type ApplicativeCts (ContT * r m :: * -> *) (ContT * r m :: * -> *) (ContT * r m :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (ContT * r m) (ContT * r m) (ContT * r m) => ContT * r m (a -> b) -> ContT * r m a -> ContT * r m b

(*>) :: ApplicativeCts (ContT * r m) (ContT * r m) (ContT * r m) => ContT * r m a -> ContT * r m b -> ContT * r m b

(<*) :: ApplicativeCts (ContT * r m) (ContT * r m) (ContT * r m) => ContT * r m a -> ContT * r m b -> ContT * r m a

Applicative m n p => Applicative (ReaderT * r m) (ReaderT * r n) (ReaderT * r p)

Associated Types

type ApplicativeCts (ReaderT * r m :: * -> *) (ReaderT * r n :: * -> *) (ReaderT * r p :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (ReaderT * r m) (ReaderT * r n) (ReaderT * r p) => ReaderT * r m (a -> b) -> ReaderT * r n a -> ReaderT * r p b

(*>) :: ApplicativeCts (ReaderT * r m) (ReaderT * r n) (ReaderT * r p) => ReaderT * r m a -> ReaderT * r n b -> ReaderT * r p b

(<*) :: ApplicativeCts (ReaderT * r m) (ReaderT * r n) (ReaderT * r p) => ReaderT * r m a -> ReaderT * r n b -> ReaderT * r p a

Applicative f g h => Applicative (M1 * i c f) (M1 * i c g) (M1 * i c h)

Associated Types

type ApplicativeCts (M1 * i c f :: * -> *) (M1 * i c g :: * -> *) (M1 * i c h :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (M1 * i c f) (M1 * i c g) (M1 * i c h) => M1 * i c f (a -> b) -> M1 * i c g a -> M1 * i c h b

(*>) :: ApplicativeCts (M1 * i c f) (M1 * i c g) (M1 * i c h) => M1 * i c f a -> M1 * i c g b -> M1 * i c h b

(<*) :: ApplicativeCts (M1 * i c f) (M1 * i c g) (M1 * i c h) => M1 * i c f a -> M1 * i c g b -> M1 * i c h a

(Applicative f g h, Applicative f' g' h') => Applicative ((:.:) * * f f') ((:.:) * * g g') ((:.:) * * h h')

Associated Types

type ApplicativeCts ((* :.: *) f f' :: * -> *) ((* :.: *) g g' :: * -> *) ((* :.: *) h h' :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts ((* :.: *) f f') ((* :.: *) g g') ((* :.: *) h h') => (* :.: *) f f' (a -> b) -> (* :.: *) g g' a -> (* :.: *) h h' b

(*>) :: ApplicativeCts ((* :.: *) f f') ((* :.: *) g g') ((* :.: *) h h') => (* :.: *) f f' a -> (* :.: *) g g' b -> (* :.: *) h h' b

(<*) :: ApplicativeCts ((* :.: *) f f') ((* :.: *) g g') ((* :.: *) h h') => (* :.: *) f f' a -> (* :.: *) g g' b -> (* :.: *) h h' a

(Applicative f g h, Applicative f' g' h') => Applicative (Compose * * f f') (Compose * * g g') (Compose * * h h')

Associated Types

type ApplicativeCts (Compose * * f f' :: * -> *) (Compose * * g g' :: * -> *) (Compose * * h h' :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (Compose * * f f') (Compose * * g g') (Compose * * h h') => Compose * * f f' (a -> b) -> Compose * * g g' a -> Compose * * h h' b

(*>) :: ApplicativeCts (Compose * * f f') (Compose * * g g') (Compose * * h h') => Compose * * f f' a -> Compose * * g g' b -> Compose * * h h' b

(<*) :: ApplicativeCts (Compose * * f f') (Compose * * g g') (Compose * * h h') => Compose * * f f' a -> Compose * * g g' b -> Compose * * h h' a

(Monoid w, Bind m n p) => Applicative (RWST r w s m) (RWST r w s n) (RWST r w s p)

Associated Types

type ApplicativeCts (RWST r w s m :: * -> *) (RWST r w s n :: * -> *) (RWST r w s p :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (RWST r w s m) (RWST r w s n) (RWST r w s p) => RWST r w s m (a -> b) -> RWST r w s n a -> RWST r w s p b

(*>) :: ApplicativeCts (RWST r w s m) (RWST r w s n) (RWST r w s p) => RWST r w s m a -> RWST r w s n b -> RWST r w s p b

(<*) :: ApplicativeCts (RWST r w s m) (RWST r w s n) (RWST r w s p) => RWST r w s m a -> RWST r w s n b -> RWST r w s p a

(Monoid w, Bind m n p) => Applicative (RWST r w s m) (RWST r w s n) (RWST r w s p)

Associated Types

type ApplicativeCts (RWST r w s m :: * -> *) (RWST r w s n :: * -> *) (RWST r w s p :: * -> *) :: Constraint

Methods

(<*>) :: ApplicativeCts (RWST r w s m) (RWST r w s n) (RWST r w s p) => RWST r w s m (a -> b) -> RWST r w s n a -> RWST r w s p b

(*>) :: ApplicativeCts (RWST r w s m) (RWST r w s n) (RWST r w s p) => RWST r w s m a -> RWST r w s n b -> RWST r w s p b

(<*) :: ApplicativeCts (RWST r w s m) (RWST r w s n) (RWST r w s p) => RWST r w s m a -> RWST r w s n b -> RWST r w s p a

pure :: (Return f, ReturnCts f) => a -> f a

pure is defined in terms of return.

class Functor (f :: * -> *) where

The Functor class is used for types that can be mapped over. Instances of Functor should satisfy the following laws:

fmap id  ==  id
fmap (f . g)  ==  fmap f . fmap g

The instances of Functor for lists, Maybe and IO satisfy these laws.

Minimal complete definition

fmap

Methods

fmap :: (a -> b) -> f a -> f b

(<$) :: a -> f b -> f a infixl 4

Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

Instances

Functor []

Since: 2.1

Methods

fmap :: (a -> b) -> [a] -> [b]

(<$) :: a -> [b] -> [a]

Functor Maybe

Since: 2.1

Methods

fmap :: (a -> b) -> Maybe a -> Maybe b

(<$) :: a -> Maybe b -> Maybe a

Functor IO

Since: 2.1

Methods

fmap :: (a -> b) -> IO a -> IO b

(<$) :: a -> IO b -> IO a

Functor Par1

Methods

fmap :: (a -> b) -> Par1 a -> Par1 b

(<$) :: a -> Par1 b -> Par1 a

Functor Q

Methods

fmap :: (a -> b) -> Q a -> Q b

(<$) :: a -> Q b -> Q a

Functor P

Methods

fmap :: (a -> b) -> P a -> P b

(<$) :: a -> P b -> P a

Functor Complex

Methods

fmap :: (a -> b) -> Complex a -> Complex b

(<$) :: a -> Complex b -> Complex a

Functor Min

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> Min a -> Min b

(<$) :: a -> Min b -> Min a

Functor Max

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> Max a -> Max b

(<$) :: a -> Max b -> Max a

Functor First

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> First a -> First b

(<$) :: a -> First b -> First a

Functor Last

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> Last a -> Last b

(<$) :: a -> Last b -> Last a

Functor Option

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> Option a -> Option b

(<$) :: a -> Option b -> Option a

Functor NonEmpty

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> NonEmpty a -> NonEmpty b

(<$) :: a -> NonEmpty b -> NonEmpty a

Functor ZipList

Methods

fmap :: (a -> b) -> ZipList a -> ZipList b

(<$) :: a -> ZipList b -> ZipList a

Functor Identity

Since: 4.8.0.0

Methods

fmap :: (a -> b) -> Identity a -> Identity b

(<$) :: a -> Identity b -> Identity a

Functor STM

Since: 4.3.0.0

Methods

fmap :: (a -> b) -> STM a -> STM b

(<$) :: a -> STM b -> STM a

Functor Dual

Since: 4.8.0.0

Methods

fmap :: (a -> b) -> Dual a -> Dual b

(<$) :: a -> Dual b -> Dual a

Functor Sum

Since: 4.8.0.0

Methods

fmap :: (a -> b) -> Sum a -> Sum b

(<$) :: a -> Sum b -> Sum a

Functor Product

Since: 4.8.0.0

Methods

fmap :: (a -> b) -> Product a -> Product b

(<$) :: a -> Product b -> Product a

Functor First

Methods

fmap :: (a -> b) -> First a -> First b

(<$) :: a -> First b -> First a

Functor Last

Methods

fmap :: (a -> b) -> Last a -> Last b

(<$) :: a -> Last b -> Last a

Functor ReadPrec

Since: 2.1

Methods

fmap :: (a -> b) -> ReadPrec a -> ReadPrec b

(<$) :: a -> ReadPrec b -> ReadPrec a

Functor ReadP

Since: 2.1

Methods

fmap :: (a -> b) -> ReadP a -> ReadP b

(<$) :: a -> ReadP b -> ReadP a

Functor Put

Methods

fmap :: (a -> b) -> Put a -> Put b

(<$) :: a -> Put b -> Put a

Functor IntMap

Methods

fmap :: (a -> b) -> IntMap a -> IntMap b

(<$) :: a -> IntMap b -> IntMap a

Functor SCC

Methods

fmap :: (a -> b) -> SCC a -> SCC b

(<$) :: a -> SCC b -> SCC a

Functor Tree

Methods

fmap :: (a -> b) -> Tree a -> Tree b

(<$) :: a -> Tree b -> Tree a

Functor Seq

Methods

fmap :: (a -> b) -> Seq a -> Seq b

(<$) :: a -> Seq b -> Seq a

Functor FingerTree

Methods

fmap :: (a -> b) -> FingerTree a -> FingerTree b

(<$) :: a -> FingerTree b -> FingerTree a

Functor Digit

Methods

fmap :: (a -> b) -> Digit a -> Digit b

(<$) :: a -> Digit b -> Digit a

Functor Node

Methods

fmap :: (a -> b) -> Node a -> Node b

(<$) :: a -> Node b -> Node a

Functor Elem

Methods

fmap :: (a -> b) -> Elem a -> Elem b

(<$) :: a -> Elem b -> Elem a

Functor ViewL

Methods

fmap :: (a -> b) -> ViewL a -> ViewL b

(<$) :: a -> ViewL b -> ViewL a

Functor ViewR

Methods

fmap :: (a -> b) -> ViewR a -> ViewR b

(<$) :: a -> ViewR b -> ViewR a

Functor NormM

Methods

fmap :: (a -> b) -> NormM a -> NormM b

(<$) :: a -> NormM b -> NormM a

Functor UM

Methods

fmap :: (a -> b) -> UM a -> UM b

(<$) :: a -> UM b -> UM a

Functor TaggedVal

Methods

fmap :: (a -> b) -> TaggedVal a -> TaggedVal b

(<$) :: a -> TaggedVal b -> TaggedVal a

Functor CoreM

Methods

fmap :: (a -> b) -> CoreM a -> CoreM b

(<$) :: a -> CoreM b -> CoreM a

Functor TcPluginM

Methods

fmap :: (a -> b) -> TcPluginM a -> TcPluginM b

(<$) :: a -> TcPluginM b -> TcPluginM a

Functor Hsc

Methods

fmap :: (a -> b) -> Hsc a -> Hsc b

(<$) :: a -> Hsc b -> Hsc a

Functor UnifyResultM

Methods

fmap :: (a -> b) -> UnifyResultM a -> UnifyResultM b

(<$) :: a -> UnifyResultM b -> UnifyResultM a

Functor UniqDFM

Methods

fmap :: (a -> b) -> UniqDFM a -> UniqDFM b

(<$) :: a -> UniqDFM b -> UniqDFM a

Functor UniqFM

Methods

fmap :: (a -> b) -> UniqFM a -> UniqFM b

(<$) :: a -> UniqFM b -> UniqFM a

Functor UniqSM

Methods

fmap :: (a -> b) -> UniqSM a -> UniqSM b

(<$) :: a -> UniqSM b -> UniqSM a

Functor SizedSeq

Methods

fmap :: (a -> b) -> SizedSeq a -> SizedSeq b

(<$) :: a -> SizedSeq b -> SizedSeq a

Functor Doc

Methods

fmap :: (a -> b) -> Doc a -> Doc b

(<$) :: a -> Doc b -> Doc a

Functor AnnotDetails

Methods

fmap :: (a -> b) -> AnnotDetails a -> AnnotDetails b

(<$) :: a -> AnnotDetails b -> AnnotDetails a

Functor Span

Methods

fmap :: (a -> b) -> Span a -> Span b

(<$) :: a -> Span b -> Span a

Functor (Either a)

Since: 3.0

Methods

fmap :: (a -> b) -> Either a a -> Either a b

(<$) :: a -> Either a b -> Either a a

Functor (V1 *)

Methods

fmap :: (a -> b) -> V1 * a -> V1 * b

(<$) :: a -> V1 * b -> V1 * a

Functor (U1 *)

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> U1 * a -> U1 * b

(<$) :: a -> U1 * b -> U1 * a

Functor ((,) a)

Since: 2.1

Methods

fmap :: (a -> b) -> (a, a) -> (a, b)

(<$) :: a -> (a, b) -> (a, a)

Functor (ST s)

Since: 2.1

Methods

fmap :: (a -> b) -> ST s a -> ST s b

(<$) :: a -> ST s b -> ST s a

Functor (Array i)

Since: 2.1

Methods

fmap :: (a -> b) -> Array i a -> Array i b

(<$) :: a -> Array i b -> Array i a

Functor (Arg a)

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> Arg a a -> Arg a b

(<$) :: a -> Arg a b -> Arg a a

Functor (ST s)

Since: 2.1

Methods

fmap :: (a -> b) -> ST s a -> ST s b

(<$) :: a -> ST s b -> ST s a

Monad m => Functor (WrappedMonad m)

Since: 2.1

Methods

fmap :: (a -> b) -> WrappedMonad m a -> WrappedMonad m b

(<$) :: a -> WrappedMonad m b -> WrappedMonad m a

Arrow a => Functor (ArrowMonad a)

Since: 4.6.0.0

Methods

fmap :: (a -> b) -> ArrowMonad a a -> ArrowMonad a b

(<$) :: a -> ArrowMonad a b -> ArrowMonad a a

Functor (Proxy *)

Since: 4.7.0.0

Methods

fmap :: (a -> b) -> Proxy * a -> Proxy * b

(<$) :: a -> Proxy * b -> Proxy * a

Functor (SetM s)

Methods

fmap :: (a -> b) -> SetM s a -> SetM s b

(<$) :: a -> SetM s b -> SetM s a

Functor (State s)

Methods

fmap :: (a -> b) -> State s a -> State s b

(<$) :: a -> State s b -> State s a

Functor (Map k)

Methods

fmap :: (a -> b) -> Map k a -> Map k b

(<$) :: a -> Map k b -> Map k a

Functor (IOEnv m)

Methods

fmap :: (a -> b) -> IOEnv m a -> IOEnv m b

(<$) :: a -> IOEnv m b -> IOEnv m a

Functor (GenLocated l)

Methods

fmap :: (a -> b) -> GenLocated l a -> GenLocated l b

(<$) :: a -> GenLocated l b -> GenLocated l a

Functor m => Functor (MaybeT m)

Methods

fmap :: (a -> b) -> MaybeT m a -> MaybeT m b

(<$) :: a -> MaybeT m b -> MaybeT m a

Functor (DbOpenMode mode)

Methods

fmap :: (a -> b) -> DbOpenMode mode a -> DbOpenMode mode b

(<$) :: a -> DbOpenMode mode b -> DbOpenMode mode a

Functor m => Functor (ListT m)

Methods

fmap :: (a -> b) -> ListT m a -> ListT m b

(<$) :: a -> ListT m b -> ListT m a

Functor f => Functor (Rec1 * f)

Methods

fmap :: (a -> b) -> Rec1 * f a -> Rec1 * f b

(<$) :: a -> Rec1 * f b -> Rec1 * f a

Functor (URec * Char)

Methods

fmap :: (a -> b) -> URec * Char a -> URec * Char b

(<$) :: a -> URec * Char b -> URec * Char a

Functor (URec * Double)

Methods

fmap :: (a -> b) -> URec * Double a -> URec * Double b

(<$) :: a -> URec * Double b -> URec * Double a

Functor (URec * Float)

Methods

fmap :: (a -> b) -> URec * Float a -> URec * Float b

(<$) :: a -> URec * Float b -> URec * Float a

Functor (URec * Int)

Methods

fmap :: (a -> b) -> URec * Int a -> URec * Int b

(<$) :: a -> URec * Int b -> URec * Int a

Functor (URec * Word)

Methods

fmap :: (a -> b) -> URec * Word a -> URec * Word b

(<$) :: a -> URec * Word b -> URec * Word a

Functor (URec * (Ptr ()))

Methods

fmap :: (a -> b) -> URec * (Ptr ()) a -> URec * (Ptr ()) b

(<$) :: a -> URec * (Ptr ()) b -> URec * (Ptr ()) a

Arrow a => Functor (WrappedArrow a b)

Since: 2.1

Methods

fmap :: (a -> b) -> WrappedArrow a b a -> WrappedArrow a b b

(<$) :: a -> WrappedArrow a b b -> WrappedArrow a b a

Functor (Const * m)

Since: 2.1

Methods

fmap :: (a -> b) -> Const * m a -> Const * m b

(<$) :: a -> Const * m b -> Const * m a

Functor f => Functor (Alt * f)

Methods

fmap :: (a -> b) -> Alt * f a -> Alt * f b

(<$) :: a -> Alt * f b -> Alt * f a

(Applicative f, Monad f) => Functor (WhenMissing f x)

Methods

fmap :: (a -> b) -> WhenMissing f x a -> WhenMissing f x b

(<$) :: a -> WhenMissing f x b -> WhenMissing f x a

Functor m => Functor (ErrorT e m)

Methods

fmap :: (a -> b) -> ErrorT e m a -> ErrorT e m b

(<$) :: a -> ErrorT e m b -> ErrorT e m a

Functor m => Functor (ExceptT e m)

Methods

fmap :: (a -> b) -> ExceptT e m a -> ExceptT e m b

(<$) :: a -> ExceptT e m b -> ExceptT e m a

Functor m => Functor (StateT s m)

Methods

fmap :: (a -> b) -> StateT s m a -> StateT s m b

(<$) :: a -> StateT s m b -> StateT s m a

Functor m => Functor (StateT s m)

Methods

fmap :: (a -> b) -> StateT s m a -> StateT s m b

(<$) :: a -> StateT s m b -> StateT s m a

Functor m => Functor (WriterT w m)

Methods

fmap :: (a -> b) -> WriterT w m a -> WriterT w m b

(<$) :: a -> WriterT w m b -> WriterT w m a

Functor m => Functor (WriterT w m)

Methods

fmap :: (a -> b) -> WriterT w m a -> WriterT w m b

(<$) :: a -> WriterT w m b -> WriterT w m a

Functor m => Functor (IdentityT * m)

Methods

fmap :: (a -> b) -> IdentityT * m a -> IdentityT * m b

(<$) :: a -> IdentityT * m b -> IdentityT * m a

Functor ((->) LiftedRep LiftedRep r)

Since: 2.1

Methods

fmap :: (a -> b) -> (LiftedRep -> LiftedRep) r a -> (LiftedRep -> LiftedRep) r b

(<$) :: a -> (LiftedRep -> LiftedRep) r b -> (LiftedRep -> LiftedRep) r a

Functor (K1 * i c)

Methods

fmap :: (a -> b) -> K1 * i c a -> K1 * i c b

(<$) :: a -> K1 * i c b -> K1 * i c a

(Functor g, Functor f) => Functor ((:+:) * f g)

Methods

fmap :: (a -> b) -> (* :+: f) g a -> (* :+: f) g b

(<$) :: a -> (* :+: f) g b -> (* :+: f) g a

(Functor g, Functor f) => Functor ((:*:) * f g)

Methods

fmap :: (a -> b) -> (* :*: f) g a -> (* :*: f) g b

(<$) :: a -> (* :*: f) g b -> (* :*: f) g a

(Functor f, Functor g) => Functor (Product * f g)

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> Product * f g a -> Product * f g b

(<$) :: a -> Product * f g b -> Product * f g a

(Functor f, Functor g) => Functor (Sum * f g)

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> Sum * f g a -> Sum * f g b

(<$) :: a -> Sum * f g b -> Sum * f g a

Functor f => Functor (WhenMatched f x y)

Methods

fmap :: (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b

(<$) :: a -> WhenMatched f x y b -> WhenMatched f x y a

(Applicative f, Monad f) => Functor (WhenMissing f k x)

Methods

fmap :: (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b

(<$) :: a -> WhenMissing f k x b -> WhenMissing f k x a

Functor (ContT k r m)

Methods

fmap :: (a -> b) -> ContT k r m a -> ContT k r m b

(<$) :: a -> ContT k r m b -> ContT k r m a

Functor m => Functor (ReaderT * r m)

Methods

fmap :: (a -> b) -> ReaderT * r m a -> ReaderT * r m b

(<$) :: a -> ReaderT * r m b -> ReaderT * r m a

Functor f => Functor (M1 * i c f)

Methods

fmap :: (a -> b) -> M1 * i c f a -> M1 * i c f b

(<$) :: a -> M1 * i c f b -> M1 * i c f a

(Functor g, Functor f) => Functor ((:.:) * * f g)

Methods

fmap :: (a -> b) -> (* :.: *) f g a -> (* :.: *) f g b

(<$) :: a -> (* :.: *) f g b -> (* :.: *) f g a

(Functor f, Functor g) => Functor (Compose * * f g)

Since: 4.9.0.0

Methods

fmap :: (a -> b) -> Compose * * f g a -> Compose * * f g b

(<$) :: a -> Compose * * f g b -> Compose * * f g a

Functor f => Functor (WhenMatched f k x y)

Methods

fmap :: (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b

(<$) :: a -> WhenMatched f k x y b -> WhenMatched f k x y a

Functor m => Functor (RWST r w s m)

Methods

fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b

(<$) :: a -> RWST r w s m b -> RWST r w s m a

Functor m => Functor (RWST r w s m)

Methods

fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b

(<$) :: a -> RWST r w s m b -> RWST r w s m a

Conveniences

type family Monad m :: Constraint where ...

A short-hand for writing polymorphic standard monad functions.

Equations

Monad m = (Bind m m m, Return m, Fail m)