Safe Haskell	Safe-Inferred
Language	Haskell2010

UVMHS.Core.Classes.Functors

Documentation

newtype NoCostID (a :: ★) Source #

Constructors

NoCostID a

Instances

Instances details

Bind NoCostID Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods (≫=) :: NoCostID a -> (a -> NoCostID b) -> NoCostID b Source #
Functor NoCostID Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods map :: (a -> b) -> NoCostID a -> NoCostID b Source #
Monad NoCostID Source #
Instance details Defined in UVMHS.Core.Classes.Functors
Return NoCostID Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods return :: a -> NoCostID a Source #

class FunctorM (t :: ★ -> ★) where Source #

Minimal complete definition

Nothing

Methods

mapM :: forall m a b. Monad m => (a -> m b) -> t a -> m (t b) Source #

default mapM :: (OFunctorM t, Monad m) => (a -> m b) -> t a -> m (t b) Source #

Instances

Instances details

FunctorM 𝐼 Source #
Instance details Defined in UVMHS.Core.Data.Iter Methods mapM :: Monad m => (a -> m b) -> 𝐼 a -> m (𝐼 b) Source #
FunctorM 𝐿 Source #
Instance details Defined in UVMHS.Core.Data.List Methods mapM :: Monad m => (a -> m b) -> 𝐿 a -> m (𝐿 b) Source #
FunctorM 𝑂 Source #
Instance details Defined in UVMHS.Core.Data.Option Methods mapM :: Monad m => (a -> m b) -> 𝑂 a -> m (𝑂 b) Source #
FunctorM AddBT Source #
Instance details Defined in UVMHS.Core.Pointed Methods mapM :: Monad m => (a -> m b) -> AddBT a -> m (AddBT b) Source #
FunctorM AddBot Source #
Instance details Defined in UVMHS.Core.Pointed Methods mapM :: Monad m => (a -> m b) -> AddBot a -> m (AddBot b) Source #
FunctorM AddNull Source #
Instance details Defined in UVMHS.Core.Pointed Methods mapM :: Monad m => (a -> m b) -> AddNull a -> m (AddNull b) Source #
FunctorM AddTop Source #
Instance details Defined in UVMHS.Core.Pointed Methods mapM :: Monad m => (a -> m b) -> AddTop a -> m (AddTop b) Source #
FunctorM ZOM Source #
Instance details Defined in UVMHS.Core.Pointed Methods mapM :: Monad m => (a -> m b) -> ZOM a -> m (ZOM b) Source #
FunctorM 𝐼C Source #
Instance details Defined in UVMHS.Core.Sized Methods mapM :: Monad m => (a -> m b) -> 𝐼C a -> m (𝐼C b) Source #
FunctorM 𝕍 Source #
Instance details Defined in UVMHS.Core.Vector Methods mapM :: Monad m => (a -> m b) -> 𝕍 a -> m (𝕍 b) Source #
FunctorM FrameGrouping Source #
Instance details Defined in UVMHS.Lib.Dataframe Methods mapM :: Monad m => (a -> m b) -> FrameGrouping a -> m (FrameGrouping b) Source #
FunctorM AddInf Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods mapM :: Monad m => (a -> m b) -> AddInf a -> m (AddInf b) Source #
FunctorM AddZI Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods mapM :: Monad m => (a -> m b) -> AddZI a -> m (AddZI b) Source #
FunctorM AddZer Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods mapM :: Monad m => (a -> m b) -> AddZer a -> m (AddZer b) Source #
FunctorM List Source #
Instance details Defined in UVMHS.Core.Data.LazyList Methods mapM :: Monad m => (a -> m b) -> [a] -> m [b] Source #
Ord k => FunctorM (EDct (StdESD k)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods mapM :: Monad m => (a -> m b) -> EDct (StdESD k) a -> m (EDct (StdESD k) b) Source #
FunctorM ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods mapM :: Monad m => (a -> m b) -> (k ⇰ a) -> m (k ⇰ b) Source #
FunctorM ((∧) a) Source #
Instance details Defined in UVMHS.Core.Data.Pair Methods mapM :: Monad m => (a0 -> m b) -> (a ∧ a0) -> m (a ∧ b) Source #
FunctorM ((∨) a) Source #
Instance details Defined in UVMHS.Core.Data.Choice Methods mapM :: Monad m => (a0 -> m b) -> (a ∨ a0) -> m (a ∨ b) Source #
FunctorM (𝐴 t) Source #
Instance details Defined in UVMHS.Lib.Annotated Methods mapM :: Monad m => (a -> m b) -> 𝐴 t a -> m (𝐴 t b) Source #

class OFunctorM (t :: ★ -> ★) where Source #

Methods

omapM :: forall m a b. Monad m => (a -> m (𝑂 b)) -> t a -> m (t b) Source #

Instances

Instances details

OFunctorM ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods omapM :: Monad m => (a -> m (𝑂 b)) -> (k ⇰ a) -> m (k ⇰ b) Source #

class KFunctorM (k :: ★) (t :: ★ -> ★) | t -> k where Source #

Minimal complete definition

Nothing

Methods

kmapM :: forall m a b. Monad m => (k -> a -> m b) -> t a -> m (t b) Source #

default kmapM :: (OKFunctorM k t, Monad m) => (k -> a -> m b) -> t a -> m (t b) Source #

kmapAtM :: forall m a. Monad m => k -> (a -> m a) -> t a -> m (t a) Source #

default kmapAtM :: (OKFunctorM k t, Monad m) => k -> (a -> m a) -> t a -> m (t a) Source #

Instances

Instances details

Ord k => KFunctorM k ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods kmapM :: Monad m => (k -> a -> m b) -> (k ⇰ a) -> m (k ⇰ b) Source # kmapAtM :: Monad m => k -> (a -> m a) -> (k ⇰ a) -> m (k ⇰ a) Source #

class OKFunctorM (k :: ★) (t :: ★ -> ★) | t -> k where Source #

Methods

okmapM :: forall m a b. Monad m => (k -> a -> m (𝑂 b)) -> t a -> m (t b) Source #

okmapAtM :: forall m a. Monad m => k -> (𝑂 a -> m (𝑂 a)) -> t a -> m (t a) Source #

Instances

Instances details

Ord k => OKFunctorM k ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods okmapM :: Monad m => (k -> a -> m (𝑂 b)) -> (k ⇰ a) -> m (k ⇰ b) Source # okmapAtM :: Monad m => k -> (𝑂 a -> m (𝑂 a)) -> (k ⇰ a) -> m (k ⇰ a) Source #

class BiFunctorM (t :: ★ -> ★) where Source #

Minimal complete definition

Nothing

Methods

bimapM :: forall m a b c. Monad m => (a -> m c) -> (b -> m c) -> (a -> b -> m c) -> t a -> t b -> m (t c) Source #

default bimapM :: (OBiFunctorM t, Monad m) => (a -> m c) -> (b -> m c) -> (a -> b -> m c) -> t a -> t b -> m (t c) Source #

Instances

Instances details

Ord k => BiFunctorM ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods bimapM :: forall m a b c. Monad m => (a -> m c) -> (b -> m c) -> (a -> b -> m c) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #

class OBiFunctorM (t :: ★ -> ★) where Source #

Methods

obimapM :: forall m a b c. Monad m => (a -> m (𝑂 c)) -> (b -> m (𝑂 c)) -> (a -> b -> m (𝑂 c)) -> t a -> t b -> m (t c) Source #

Instances

Instances details

Ord k => OBiFunctorM ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods obimapM :: forall m a b c. Monad m => (a -> m (𝑂 c)) -> (b -> m (𝑂 c)) -> (a -> b -> m (𝑂 c)) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #

class KBiFunctorM (k :: ★) (t :: ★ -> ★) | t -> k where Source #

Minimal complete definition

Nothing

Methods

kbimapM :: forall m a b c. Monad m => (k -> a -> m c) -> (k -> b -> m c) -> (k -> a -> b -> m c) -> t a -> t b -> m (t c) Source #

default kbimapM :: (OKBiFunctorM k t, Monad m) => (k -> a -> m c) -> (k -> b -> m c) -> (k -> a -> b -> m c) -> t a -> t b -> m (t c) Source #

Instances

Instances details

Ord k => KBiFunctorM k ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods kbimapM :: forall m a b c. Monad m => (k -> a -> m c) -> (k -> b -> m c) -> (k -> a -> b -> m c) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #

class OKBiFunctorM (k :: ★) (t :: ★ -> ★) | t -> k where Source #

Methods

okbimapM :: forall m a b c. Monad m => (k -> a -> m (𝑂 c)) -> (k -> b -> m (𝑂 c)) -> (k -> a -> b -> m (𝑂 c)) -> t a -> t b -> m (t c) Source #

Instances

Instances details

Ord k => OKBiFunctorM k ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods okbimapM :: forall m a b c. Monad m => (k -> a -> m (𝑂 c)) -> (k -> b -> m (𝑂 c)) -> (k -> a -> b -> m (𝑂 c)) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #

class Functor (t :: ★ -> ★) where Source #

Minimal complete definition

Nothing

Methods

map :: (a -> b) -> t a -> t b Source #

default map :: forall a b. FunctorM t => (a -> b) -> t a -> t b Source #

Instances

Instances details

Functor IO Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> IO a -> IO b Source #
Functor Q Source #
Instance details Defined in UVMHS.Core.TH Methods map :: (a -> b) -> Q a -> Q b Source #
Functor NoCostID Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods map :: (a -> b) -> NoCostID a -> NoCostID b Source #
Functor 𝐼 Source #
Instance details Defined in UVMHS.Core.Data.Iter Methods map :: (a -> b) -> 𝐼 a -> 𝐼 b Source #
Functor 𝐿 Source #
Instance details Defined in UVMHS.Core.Data.List Methods map :: (a -> b) -> 𝐿 a -> 𝐿 b Source #
Functor 𝑂 Source #
Instance details Defined in UVMHS.Core.Data.Option Methods map :: (a -> b) -> 𝑂 a -> 𝑂 b Source #
Functor 𝑄 Source #
Instance details Defined in UVMHS.Core.Data.Sequence Methods map :: (a -> b) -> 𝑄 a -> 𝑄 b Source #
Functor ID Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> ID a -> ID b Source #
Functor AddBT Source #
Instance details Defined in UVMHS.Core.Pointed Methods map :: (a -> b) -> AddBT a -> AddBT b Source #
Functor AddBot Source #
Instance details Defined in UVMHS.Core.Pointed Methods map :: (a -> b) -> AddBot a -> AddBot b Source #
Functor AddNull Source #
Instance details Defined in UVMHS.Core.Pointed Methods map :: (a -> b) -> AddNull a -> AddNull b Source #
Functor AddTop Source #
Instance details Defined in UVMHS.Core.Pointed Methods map :: (a -> b) -> AddTop a -> AddTop b Source #
Functor ZOM Source #
Instance details Defined in UVMHS.Core.Pointed Methods map :: (a -> b) -> ZOM a -> ZOM b Source #
Functor 𝐼C Source #
Instance details Defined in UVMHS.Core.Sized Methods map :: (a -> b) -> 𝐼C a -> 𝐼C b Source #
Functor 𝕍 Source #
Instance details Defined in UVMHS.Core.Vector Methods map :: (a -> b) -> 𝕍 a -> 𝕍 b Source #
Functor 𝑉 Source #
Instance details Defined in UVMHS.Core.VectorSparse Methods map :: (a -> b) -> 𝑉 a -> 𝑉 b Source #
Functor FrameGrouping Source #
Instance details Defined in UVMHS.Lib.Dataframe Methods map :: (a -> b) -> FrameGrouping a -> FrameGrouping b Source #
Functor FuzzyM Source #
Instance details Defined in UVMHS.Lib.Rand Methods map :: (a -> b) -> FuzzyM a -> FuzzyM b Source #
Functor AddInf Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods map :: (a -> b) -> AddInf a -> AddInf b Source #
Functor AddZI Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods map :: (a -> b) -> AddZI a -> AddZI b Source #
Functor AddZer Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods map :: (a -> b) -> AddZer a -> AddZer b Source #
Functor List Source #
Instance details Defined in UVMHS.Core.Data.LazyList Methods map :: (a -> b) -> [a] -> [b] Source #
Functor t => Functor (FrHSM t) Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods map :: (a -> b) -> FrHSM t a -> FrHSM t b Source #
Functor (EDct (StdESD k)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods map :: (a -> b) -> EDct (StdESD k) a -> EDct (StdESD k) b Source #
Functor ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods map :: (a -> b) -> (k ⇰ a) -> k ⇰ b Source #
Functor ((∧) a) Source #
Instance details Defined in UVMHS.Core.Data.Pair Methods map :: (a0 -> b) -> (a ∧ a0) -> a ∧ b Source #
Functor ((∨) a) Source #
Instance details Defined in UVMHS.Core.Data.Choice Methods map :: (a0 -> b) -> (a ∨ a0) -> a ∨ b Source #
Functor m => Functor (FailT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> FailT m a -> FailT m b Source #
Functor m => Functor (NondetT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> NondetT m a -> NondetT m b Source #
Functor (𝐼S n) Source #
Instance details Defined in UVMHS.Core.Static Methods map :: (a -> b) -> 𝐼S n a -> 𝐼S n b Source #
Functor (𝕍SV n) Source #
Instance details Defined in UVMHS.Core.VectorStatic Methods map :: (a -> b) -> 𝕍SV n a -> 𝕍SV n b Source #
Functor (𝐴 t) Source #
Instance details Defined in UVMHS.Lib.Annotated Methods map :: (a -> b) -> 𝐴 t a -> 𝐴 t b Source #
Ord t => Functor (CParser t) Source #
Instance details Defined in UVMHS.Lib.Parser.CParser Methods map :: (a -> b) -> CParser t a -> CParser t b Source #
Functor (Parser t) Source #
Instance details Defined in UVMHS.Lib.Parser.Core Methods map :: (a -> b) -> Parser t a -> Parser t b Source #
Functor (Sep i) Source #
Instance details Defined in UVMHS.Lib.Sep Methods map :: (a -> b) -> Sep i a -> Sep i b Source #
Functor (𝑇 i) Source #
Instance details Defined in UVMHS.Lib.TreeAnnote Methods map :: (a -> b) -> 𝑇 i a -> 𝑇 i b Source #
Functor (𝑇V i) Source #
Instance details Defined in UVMHS.Lib.TreeAnnote Methods map :: (a -> b) -> 𝑇V i a -> 𝑇V i b Source #
Functor m => Functor (DelayT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> DelayT m a -> DelayT m b Source #
Functor m => Functor (ErrorT e m) Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> ErrorT e m a -> ErrorT e m b Source #
Functor m => Functor (StateT s m) Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> StateT s m a -> StateT s m b Source #
Functor (UContT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> UContT m a -> UContT m b Source #
Functor m => Functor (WriterT o m) Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> WriterT o m a -> WriterT o m b Source #
𝒩 n => Functor (𝕍S n) Source #
Instance details Defined in UVMHS.Core.VectorStatic Methods map :: (a -> b) -> 𝕍S n a -> 𝕍S n b Source #
Functor (SubstM s e) Source #
Instance details Defined in UVMHS.Lib.Substitution Methods map :: (a -> b) -> SubstM s e a -> SubstM s e b Source #
Functor (ContT u m) Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> ContT u m a -> ContT u m b Source #
Functor m => Functor (ReaderT r m) Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> ReaderT r m a -> ReaderT r m b Source #
(forall (m' :: Type -> Type). Monad m' => Monad (t₁ m'), forall (m' :: Type -> Type). Monad m' => Monad (t₂ m'), Monad m) => Functor ((t₁ ⊡ t₂) m) Source #
Instance details Defined in UVMHS.Core.Transformers Methods map :: (a -> b) -> (t₁ ⊡ t₂) m a -> (t₁ ⊡ t₂) m b Source #
Functor ((->) r) Source #
Instance details Defined in UVMHS.Core.Data.Function Methods map :: (a -> b) -> (r -> a) -> r -> b Source #
Functor m => Functor (RWST r o s m) Source #
Instance details Defined in UVMHS.Core.Monads Methods map :: (a -> b) -> RWST r o s m a -> RWST r o s m b Source #

class OFunctor (t :: ★ -> ★) where Source #

Minimal complete definition

Nothing

Methods

omap :: (a -> 𝑂 b) -> t a -> t b Source #

default omap :: forall a b. OFunctorM t => (a -> 𝑂 b) -> t a -> t b Source #

Instances

Instances details

OFunctor ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods omap :: (a -> 𝑂 b) -> (k ⇰ a) -> k ⇰ b Source #

class KFunctor (k :: ★) (t :: ★ -> ★) | t -> k where Source #

Minimal complete definition

Nothing

Methods

kmap :: (k -> a -> b) -> t a -> t b Source #

default kmap :: forall a b. KFunctorM k t => (k -> a -> b) -> t a -> t b Source #

kmapAt :: k -> (a -> a) -> t a -> t a Source #

default kmapAt :: forall a. KFunctorM k t => k -> (a -> a) -> t a -> t a Source #

Instances

Instances details

Ord k => KFunctor k ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods kmap :: (k -> a -> b) -> (k ⇰ a) -> k ⇰ b Source # kmapAt :: k -> (a -> a) -> (k ⇰ a) -> k ⇰ a Source #

class OKFunctor (k :: ★) (t :: ★ -> ★) | t -> k where Source #

Minimal complete definition

Nothing

Methods

okmap :: (k -> a -> 𝑂 b) -> t a -> t b Source #

default okmap :: forall a b. OKFunctorM k t => (k -> a -> 𝑂 b) -> t a -> t b Source #

okmapAt :: k -> (𝑂 a -> 𝑂 a) -> t a -> t a Source #

default okmapAt :: forall a. OKFunctorM k t => k -> (𝑂 a -> 𝑂 a) -> t a -> t a Source #

Instances

Instances details

Ord k => OKFunctor k ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods okmap :: (k -> a -> 𝑂 b) -> (k ⇰ a) -> k ⇰ b Source # okmapAt :: k -> (𝑂 a -> 𝑂 a) -> (k ⇰ a) -> k ⇰ a Source #

class BiFunctor (t :: ★ -> ★) where Source #

Minimal complete definition

Nothing

Methods

bimap :: (a -> c) -> (b -> c) -> (a -> b -> c) -> t a -> t b -> t c Source #

default bimap :: forall a b c. BiFunctorM t => (a -> c) -> (b -> c) -> (a -> b -> c) -> t a -> t b -> t c Source #

Instances

Instances details

Ord k => BiFunctor ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods bimap :: (a -> c) -> (b -> c) -> (a -> b -> c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #

class OBiFunctor (t :: ★ -> ★) where Source #

Minimal complete definition

Nothing

Methods

obimap :: (a -> 𝑂 c) -> (b -> 𝑂 c) -> (a -> b -> 𝑂 c) -> t a -> t b -> t c Source #

default obimap :: forall a b c. OBiFunctorM t => (a -> 𝑂 c) -> (b -> 𝑂 c) -> (a -> b -> 𝑂 c) -> t a -> t b -> t c Source #

Instances

Instances details

Ord k => OBiFunctor ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods obimap :: (a -> 𝑂 c) -> (b -> 𝑂 c) -> (a -> b -> 𝑂 c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #

class KBiFunctor (k :: ★) (t :: ★ -> ★) where Source #

Minimal complete definition

Nothing

Methods

kbimap :: (k -> a -> c) -> (k -> b -> c) -> (k -> a -> b -> c) -> t a -> t b -> t c Source #

default kbimap :: forall a b c. KBiFunctorM k t => (k -> a -> c) -> (k -> b -> c) -> (k -> a -> b -> c) -> t a -> t b -> t c Source #

Instances

Instances details

Ord k => KBiFunctor k ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods kbimap :: (k -> a -> c) -> (k -> b -> c) -> (k -> a -> b -> c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #

class OKBiFunctor (k :: ★) (t :: ★ -> ★) where Source #

Minimal complete definition

Nothing

Methods

okbimap :: (k -> a -> 𝑂 c) -> (k -> b -> 𝑂 c) -> (k -> a -> b -> 𝑂 c) -> t a -> t b -> t c Source #

default okbimap :: forall a b c. OKBiFunctorM k t => (k -> a -> 𝑂 c) -> (k -> b -> 𝑂 c) -> (k -> a -> b -> 𝑂 c) -> t a -> t b -> t c Source #

Instances

Instances details

Ord k => OKBiFunctor k ((⇰) k) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods okbimap :: (k -> a -> 𝑂 c) -> (k -> b -> 𝑂 c) -> (k -> a -> b -> 𝑂 c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #

mapMOn :: (FunctorM t, Monad m) => t a -> (a -> m b) -> m (t b) Source #

exchange :: (FunctorM t, Monad m) => t (m a) -> m (t a) Source #

omapMOn :: (OFunctorM t, Monad m) => t a -> (a -> m (𝑂 b)) -> m (t b) Source #

kmapMOn :: (KFunctorM k t, Monad m) => t a -> (k -> a -> m b) -> m (t b) Source #

kmapAtMOn :: (KFunctorM k t, Monad m) => k -> t a -> (a -> m a) -> m (t a) Source #

okmapMOn :: (OKFunctorM k t, Monad m) => t a -> (k -> a -> m (𝑂 b)) -> m (t b) Source #

okmapAtMOn :: (OKFunctorM k t, Monad m) => k -> t a -> (𝑂 a -> m (𝑂 a)) -> m (t a) Source #

bimapMOn :: (BiFunctorM t, Monad m) => t a -> t b -> (a -> m c) -> (b -> m c) -> (a -> b -> m c) -> m (t c) Source #

obimapMOn :: (OBiFunctorM t, Monad m) => t a -> t b -> (a -> m (𝑂 c)) -> (b -> m (𝑂 c)) -> (a -> b -> m (𝑂 c)) -> m (t c) Source #

kbimapMOn :: (KBiFunctorM k t, Monad m) => t a -> t b -> (k -> a -> m c) -> (k -> b -> m c) -> (k -> a -> b -> m c) -> m (t c) Source #

okbimapMOn :: (OKBiFunctorM k t, Monad m) => t a -> t b -> (k -> a -> m (𝑂 c)) -> (k -> b -> m (𝑂 c)) -> (k -> a -> b -> m (𝑂 c)) -> m (t c) Source #

mapOn :: Functor t => t a -> (a -> b) -> t b Source #

mapp :: (Functor t, Functor u) => (a -> b) -> t (u a) -> t (u b) Source #

mappOn :: (Functor t, Functor u) => t (u a) -> (a -> b) -> t (u b) Source #

mappp :: (Functor t, Functor u, Functor v) => (a -> b) -> t (u (v a)) -> t (u (v b)) Source #

mapppOn :: (Functor t, Functor u, Functor v) => t (u (v a)) -> (a -> b) -> t (u (v b)) Source #

(^$) :: Functor t => (a -> b) -> t a -> t b infixr 0 Source #

(^^$) :: (Functor t, Functor u) => (a -> b) -> t (u a) -> t (u b) infixr 0 Source #

(^∘) :: Functor t => (b -> c) -> (a -> t b) -> a -> t c infixl 7 Source #

(^^∘) :: (Functor t, Functor u) => (b -> c) -> (a -> t (u b)) -> a -> t (u c) infixl 7 Source #

omapOn :: OFunctor t => t a -> (a -> 𝑂 b) -> t b Source #

kmapOn :: KFunctor k t => t a -> (k -> a -> b) -> t b Source #

kmapAtOn :: KFunctor k t => k -> t a -> (a -> a) -> t a Source #

okmapOn :: OKFunctor k t => t a -> (k -> a -> 𝑂 b) -> t b Source #

okmapAtOn :: OKFunctor k t => k -> t a -> (𝑂 a -> 𝑂 a) -> t a Source #

bimapOn :: BiFunctor t => t a -> t b -> (a -> c) -> (b -> c) -> (a -> b -> c) -> t c Source #

obimapOn :: OBiFunctor t => t a -> t b -> (a -> 𝑂 c) -> (b -> 𝑂 c) -> (a -> b -> 𝑂 c) -> t c Source #

kbimapOn :: KBiFunctor k t => t a -> t b -> (k -> a -> c) -> (k -> b -> c) -> (k -> a -> b -> c) -> t c Source #

okbimapOn :: OKBiFunctor k t => t a -> t b -> (k -> a -> 𝑂 c) -> (k -> b -> 𝑂 c) -> (k -> a -> b -> 𝑂 c) -> t c Source #

class Functor2 (w :: (★ -> ★) -> ★ -> ★) where Source #

Methods

map2 :: (t →⁻ u) -> w t →⁻ w u Source #

Instances

Instances details

Functor2 FailT Source #
Instance details Defined in UVMHS.Core.Monads Methods map2 :: forall (t :: Type -> Type) (u :: Type -> Type). (t →⁻ u) -> FailT t →⁻ FailT u Source #
Functor2 (DelayT :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in UVMHS.Core.Monads Methods map2 :: forall (t :: Type -> Type) (u :: Type -> Type). (t →⁻ u) -> DelayT t →⁻ DelayT u Source #
Functor2 (ErrorT e) Source #
Instance details Defined in UVMHS.Core.Monads Methods map2 :: forall (t :: Type -> Type) (u :: Type -> Type). (t →⁻ u) -> ErrorT e t →⁻ ErrorT e u Source #
Functor2 (StateT s) Source #
Instance details Defined in UVMHS.Core.Monads Methods map2 :: forall (t :: Type -> Type) (u :: Type -> Type). (t →⁻ u) -> StateT s t →⁻ StateT s u Source #
Monoid o => Functor2 (WriterT o) Source #
Instance details Defined in UVMHS.Core.Monads Methods map2 :: forall (t :: Type -> Type) (u :: Type -> Type). (t →⁻ u) -> WriterT o t →⁻ WriterT o u Source #
Functor2 (ReaderT r :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in UVMHS.Core.Monads Methods map2 :: forall (t :: Type -> Type) (u :: Type -> Type). (t →⁻ u) -> ReaderT r t →⁻ ReaderT r u Source #
(Functor2 t₁, Functor2 t₂) => Functor2 (t₁ ⊡ t₂) Source #
Instance details Defined in UVMHS.Core.Transformers Methods map2 :: forall (t :: Type -> Type) (u :: Type -> Type). (t →⁻ u) -> (t₁ ⊡ t₂) t →⁻ (t₁ ⊡ t₂) u Source #
Monoid o => Functor2 (RWST r o s) Source #
Instance details Defined in UVMHS.Core.Monads Methods map2 :: forall (t :: Type -> Type) (u :: Type -> Type). (t →⁻ u) -> RWST r o s t →⁻ RWST r o s u Source #

class Functor2Iso (w :: (★ -> ★) -> ★ -> ★) where Source #

Methods

map2iso :: Iso2 t u -> w t →⁻ w u Source #

Instances

Instances details

Functor2Iso (UContT :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in UVMHS.Core.Monads Methods map2iso :: forall (t :: Type -> Type) (u :: Type -> Type). Iso2 t u -> UContT t →⁻ UContT u Source #
Functor2Iso (ContT u) Source #
Instance details Defined in UVMHS.Core.Monads Methods map2iso :: forall (t :: Type -> Type) (u0 :: Type -> Type). Iso2 t u0 -> ContT u t →⁻ ContT u u0 Source #

(>>=) :: Bind m => m a -> (a -> m b) -> m b Source #

(>>) :: Bind m => m a -> m b -> m b Source #

class Return (m :: ★ -> ★) where Source #

Methods

return :: a -> m a Source #

Instances

Instances details

Return IO Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> IO a Source #
Return Q Source #
Instance details Defined in UVMHS.Core.TH Methods return :: a -> Q a Source #
Return NoCostID Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods return :: a -> NoCostID a Source #
Return 𝐼 Source #
Instance details Defined in UVMHS.Core.Data.Iter Methods return :: a -> 𝐼 a Source #
Return 𝐿 Source #
Instance details Defined in UVMHS.Core.Data.List Methods return :: a -> 𝐿 a Source #
Return 𝑂 Source #
Instance details Defined in UVMHS.Core.Data.Option Methods return :: a -> 𝑂 a Source #
Return 𝑄 Source #
Instance details Defined in UVMHS.Core.Data.Sequence Methods return :: a -> 𝑄 a Source #
Return ID Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> ID a Source #
Return AddBT Source #
Instance details Defined in UVMHS.Core.Pointed Methods return :: a -> AddBT a Source #
Return AddBot Source #
Instance details Defined in UVMHS.Core.Pointed Methods return :: a -> AddBot a Source #
Return AddNull Source #
Instance details Defined in UVMHS.Core.Pointed Methods return :: a -> AddNull a Source #
Return AddTop Source #
Instance details Defined in UVMHS.Core.Pointed Methods return :: a -> AddTop a Source #
Return ZOM Source #
Instance details Defined in UVMHS.Core.Pointed Methods return :: a -> ZOM a Source #
Return FuzzyM Source #
Instance details Defined in UVMHS.Lib.Rand Methods return :: a -> FuzzyM a Source #
Return AddInf Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods return :: a -> AddInf a Source #
Return AddZI Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods return :: a -> AddZI a Source #
Return AddZer Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods return :: a -> AddZer a Source #
Return List Source #
Instance details Defined in UVMHS.Core.Data.LazyList Methods return :: a -> [a] Source #
Monad m => Return (FrHSM m) Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods return :: a -> FrHSM m a Source #
Null a => Return ((∧) a) Source #
Instance details Defined in UVMHS.Core.Data.Pair Methods return :: a0 -> a ∧ a0 Source #
Return ((∨) a) Source #
Instance details Defined in UVMHS.Core.Data.Choice Methods return :: a0 -> a ∨ a0 Source #
Return m => Return (FailT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> FailT m a Source #
Return m => Return (NondetT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> NondetT m a Source #
Return (CParser t) Source #
Instance details Defined in UVMHS.Lib.Parser.CParser Methods return :: a -> CParser t a Source #
Return (Parser t) Source #
Instance details Defined in UVMHS.Lib.Parser.Core Methods return :: a -> Parser t a Source #
Return m => Return (DelayT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> DelayT m a Source #
Return m => Return (ErrorT e m) Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> ErrorT e m a Source #
Return m => Return (StateT s m) Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> StateT s m a Source #
Return (UContT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> UContT m a Source #
(Return m, Null o) => Return (WriterT o m) Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> WriterT o m a Source #
Return (SubstM s e) Source #
Instance details Defined in UVMHS.Lib.Substitution Methods return :: a -> SubstM s e a Source #
Return (ContT u m) Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> ContT u m a Source #
Return m => Return (ReaderT r m) Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> ReaderT r m a Source #
(forall (m' :: Type -> Type). Monad m' => Monad (t₁ m'), forall (m' :: Type -> Type). Monad m' => Monad (t₂ m'), Monad m) => Return ((t₁ ⊡ t₂) m) Source #
Instance details Defined in UVMHS.Core.Transformers Methods return :: a -> (t₁ ⊡ t₂) m a Source #
Return ((->) r) Source #
Instance details Defined in UVMHS.Core.Data.Function Methods return :: a -> r -> a Source #
(Return m, Null o) => Return (RWST r o s m) Source #
Instance details Defined in UVMHS.Core.Monads Methods return :: a -> RWST r o s m a Source #

class Bind (m :: ★ -> ★) where Source #

Methods

(≫=) :: m a -> (a -> m b) -> m b infixl 1 Source #

Instances

Instances details

Bind IO Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: IO a -> (a -> IO b) -> IO b Source #
Bind Q Source #
Instance details Defined in UVMHS.Core.TH Methods (≫=) :: Q a -> (a -> Q b) -> Q b Source #
Bind NoCostID Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods (≫=) :: NoCostID a -> (a -> NoCostID b) -> NoCostID b Source #
Bind 𝐼 Source #
Instance details Defined in UVMHS.Core.Data.Iter Methods (≫=) :: 𝐼 a -> (a -> 𝐼 b) -> 𝐼 b Source #
Bind 𝐿 Source #
Instance details Defined in UVMHS.Core.Data.List Methods (≫=) :: 𝐿 a -> (a -> 𝐿 b) -> 𝐿 b Source #
Bind 𝑂 Source #
Instance details Defined in UVMHS.Core.Data.Option Methods (≫=) :: 𝑂 a -> (a -> 𝑂 b) -> 𝑂 b Source #
Bind 𝑄 Source #
Instance details Defined in UVMHS.Core.Data.Sequence Methods (≫=) :: 𝑄 a -> (a -> 𝑄 b) -> 𝑄 b Source #
Bind ID Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: ID a -> (a -> ID b) -> ID b Source #
Bind AddBT Source #
Instance details Defined in UVMHS.Core.Pointed Methods (≫=) :: AddBT a -> (a -> AddBT b) -> AddBT b Source #
Bind AddBot Source #
Instance details Defined in UVMHS.Core.Pointed Methods (≫=) :: AddBot a -> (a -> AddBot b) -> AddBot b Source #
Bind AddNull Source #
Instance details Defined in UVMHS.Core.Pointed Methods (≫=) :: AddNull a -> (a -> AddNull b) -> AddNull b Source #
Bind AddTop Source #
Instance details Defined in UVMHS.Core.Pointed Methods (≫=) :: AddTop a -> (a -> AddTop b) -> AddTop b Source #
Bind ZOM Source #
Instance details Defined in UVMHS.Core.Pointed Methods (≫=) :: ZOM a -> (a -> ZOM b) -> ZOM b Source #
Bind FuzzyM Source #
Instance details Defined in UVMHS.Lib.Rand Methods (≫=) :: FuzzyM a -> (a -> FuzzyM b) -> FuzzyM b Source #
Bind AddInf Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods (≫=) :: AddInf a -> (a -> AddInf b) -> AddInf b Source #
Bind AddZI Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods (≫=) :: AddZI a -> (a -> AddZI b) -> AddZI b Source #
Bind AddZer Source #
Instance details Defined in UVMHS.Lib.ZerInf Methods (≫=) :: AddZer a -> (a -> AddZer b) -> AddZer b Source #
Bind List Source #
Instance details Defined in UVMHS.Core.Data.LazyList Methods (≫=) :: [a] -> (a -> [b]) -> [b] Source #
Monad m => Bind (FrHSM m) Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods (≫=) :: FrHSM m a -> (a -> FrHSM m b) -> FrHSM m b Source #
Append a => Bind ((∧) a) Source #
Instance details Defined in UVMHS.Core.Data.Pair Methods (≫=) :: (a ∧ a0) -> (a0 -> a ∧ b) -> a ∧ b Source #
Bind ((∨) a) Source #
Instance details Defined in UVMHS.Core.Data.Choice Methods (≫=) :: (a ∨ a0) -> (a0 -> a ∨ b) -> a ∨ b Source #
Monad m => Bind (FailT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: FailT m a -> (a -> FailT m b) -> FailT m b Source #
(Bind m, Func Monoid m) => Bind (NondetT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: NondetT m a -> (a -> NondetT m b) -> NondetT m b Source #
Ord t => Bind (CParser t) Source #
Instance details Defined in UVMHS.Lib.Parser.CParser Methods (≫=) :: CParser t a -> (a -> CParser t b) -> CParser t b Source #
Bind (Parser t) Source #
Instance details Defined in UVMHS.Lib.Parser.Core Methods (≫=) :: Parser t a -> (a -> Parser t b) -> Parser t b Source #
Bind m => Bind (DelayT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: DelayT m a -> (a -> DelayT m b) -> DelayT m b Source #
Monad m => Bind (ErrorT e m) Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: ErrorT e m a -> (a -> ErrorT e m b) -> ErrorT e m b Source #
Bind m => Bind (StateT s m) Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b Source #
Bind (UContT m) Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: UContT m a -> (a -> UContT m b) -> UContT m b Source #
(Monad m, Append o) => Bind (WriterT o m) Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: WriterT o m a -> (a -> WriterT o m b) -> WriterT o m b Source #
Bind (SubstM s e) Source #
Instance details Defined in UVMHS.Lib.Substitution Methods (≫=) :: SubstM s e a -> (a -> SubstM s e b) -> SubstM s e b Source #
Bind (ContT u m) Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: ContT u m a -> (a -> ContT u m b) -> ContT u m b Source #
Bind m => Bind (ReaderT r m) Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: ReaderT r m a -> (a -> ReaderT r m b) -> ReaderT r m b Source #
(forall (m' :: Type -> Type). Monad m' => Monad (t₁ m'), forall (m' :: Type -> Type). Monad m' => Monad (t₂ m'), Monad m) => Bind ((t₁ ⊡ t₂) m) Source #
Instance details Defined in UVMHS.Core.Transformers Methods (≫=) :: (t₁ ⊡ t₂) m a -> (a -> (t₁ ⊡ t₂) m b) -> (t₁ ⊡ t₂) m b Source #
Bind ((->) r) Source #
Instance details Defined in UVMHS.Core.Data.Function Methods (≫=) :: (r -> a) -> (a -> r -> b) -> r -> b Source #
(Monad m, Append o) => Bind (RWST r o s m) Source #
Instance details Defined in UVMHS.Core.Monads Methods (≫=) :: RWST r o s m a -> (a -> RWST r o s m b) -> RWST r o s m b Source #

class (Functor m, Return m, Bind m) => Monad m Source #

Instances

Instances details

Monad IO Source #
Instance details Defined in UVMHS.Core.Monads
Monad Q Source #
Instance details Defined in UVMHS.Core.TH
Monad NoCostID Source #
Instance details Defined in UVMHS.Core.Classes.Functors
Monad 𝐼 Source #
Instance details Defined in UVMHS.Core.Data.Iter
Monad 𝐿 Source #
Instance details Defined in UVMHS.Core.Data.List
Monad 𝑂 Source #
Instance details Defined in UVMHS.Core.Data.Option
Monad 𝑄 Source #
Instance details Defined in UVMHS.Core.Data.Sequence
Monad ID Source #
Instance details Defined in UVMHS.Core.Monads
Monad AddBT Source #
Instance details Defined in UVMHS.Core.Pointed
Monad AddBot Source #
Instance details Defined in UVMHS.Core.Pointed
Monad AddNull Source #
Instance details Defined in UVMHS.Core.Pointed
Monad AddTop Source #
Instance details Defined in UVMHS.Core.Pointed
Monad ZOM Source #
Instance details Defined in UVMHS.Core.Pointed
Monad FuzzyM Source #
Instance details Defined in UVMHS.Lib.Rand
Monad AddInf Source #
Instance details Defined in UVMHS.Lib.ZerInf
Monad AddZI Source #
Instance details Defined in UVMHS.Lib.ZerInf
Monad AddZer Source #
Instance details Defined in UVMHS.Lib.ZerInf
Monad List Source #
Instance details Defined in UVMHS.Core.Data.LazyList
Monad m => Monad (FrHSM m) Source #
Instance details Defined in UVMHS.Core.Classes.Functors
Monoid a => Monad ((∧) a) Source #
Instance details Defined in UVMHS.Core.Data.Pair
Monad ((∨) a) Source #
Instance details Defined in UVMHS.Core.Data.Choice
Monad m => Monad (FailT m) Source #
Instance details Defined in UVMHS.Core.Monads
(Monad m, Func Monoid m) => Monad (NondetT m) Source #
Instance details Defined in UVMHS.Core.Monads
Ord t => Monad (CParser t) Source #
Instance details Defined in UVMHS.Lib.Parser.CParser
Monad (Parser t) Source #
Instance details Defined in UVMHS.Lib.Parser.Core
Monad m => Monad (DelayT m) Source #
Instance details Defined in UVMHS.Core.Monads
Monad m => Monad (ErrorT e m) Source #
Instance details Defined in UVMHS.Core.Monads
Monad m => Monad (StateT s m) Source #
Instance details Defined in UVMHS.Core.Monads
Monad (UContT m) Source #
Instance details Defined in UVMHS.Core.Monads
(Monad m, Monoid o) => Monad (WriterT o m) Source #
Instance details Defined in UVMHS.Core.Monads
Monad (SubstM s e) Source #
Instance details Defined in UVMHS.Lib.Substitution
Monad (ContT u m) Source #
Instance details Defined in UVMHS.Core.Monads
Monad m => Monad (ReaderT r m) Source #
Instance details Defined in UVMHS.Core.Monads
(forall (m' :: Type -> Type). Monad m' => Monad (t₁ m'), forall (m' :: Type -> Type). Monad m' => Monad (t₂ m'), Monad m) => Monad ((t₁ ⊡ t₂) m) Source #
Instance details Defined in UVMHS.Core.Transformers
Monad ((->) r) Source #
Instance details Defined in UVMHS.Core.Data.Function
(Null o, Monad m, Append o) => Monad (RWST r o s m) Source #
Instance details Defined in UVMHS.Core.Monads

class Transformer (t :: (★ -> ★) -> ★ -> ★) where Source #

Methods

lift :: forall m a. Monad m => m a -> t m a Source #

Instances

Instances details

Transformer FailT Source #
Instance details Defined in UVMHS.Core.Monads Methods lift :: Monad m => m a -> FailT m a Source #
Transformer NondetT Source #
Instance details Defined in UVMHS.Core.Monads Methods lift :: Monad m => m a -> NondetT m a Source #
Transformer (DelayT :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in UVMHS.Core.Monads Methods lift :: Monad m => m a -> DelayT m a Source #
Transformer (ErrorT e) Source #
Instance details Defined in UVMHS.Core.Monads Methods lift :: Monad m => m a -> ErrorT e m a Source #
Transformer (StateT s) Source #
Instance details Defined in UVMHS.Core.Monads Methods lift :: Monad m => m a -> StateT s m a Source #
Transformer (UContT :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in UVMHS.Core.Monads Methods lift :: Monad m => m a -> UContT m a Source #
Null o => Transformer (WriterT o) Source #
Instance details Defined in UVMHS.Core.Monads Methods lift :: Monad m => m a -> WriterT o m a Source #
Transformer (ContT u) Source #
Instance details Defined in UVMHS.Core.Monads Methods lift :: Monad m => m a -> ContT u m a Source #
Transformer (ReaderT r :: (Type -> Type) -> Type -> Type) Source #
Instance details Defined in UVMHS.Core.Monads Methods lift :: Monad m => m a -> ReaderT r m a Source #
Monoid o => Transformer (RWST r o s) Source #
Instance details Defined in UVMHS.Core.Monads Methods lift :: Monad m => m a -> RWST r o s m a Source #

(*⋅) :: Bind m => (a -> m b) -> m a -> m b Source #

(*$) :: Bind m => (a -> m b) -> m a -> m b infixr 0 Source #

(*∘) :: Bind m => (b -> m c) -> (a -> m b) -> a -> m c infixl 7 Source #

kreturn :: Return m => (a -> b) -> a -> m b Source #

extend :: Bind m => (a -> m b) -> m a -> m b Source #

(≫) :: Bind m => m a -> m b -> m b infixl 1 Source #

void :: Functor m => m a -> m () Source #

mjoin :: Bind m => m (m a) -> m a Source #

mmap :: Monad m => (a -> b) -> m a -> m b Source #

(⧆) :: Monad m => m a -> m b -> m (a ∧ b) infixl 6 Source #

(⊡) :: Monad m => m (a -> b) -> m a -> m b Source #

skip :: Return m => m () Source #

when :: Return m => 𝔹 -> (() -> m ()) -> m () Source #

whenM :: Monad m => m 𝔹 -> (() -> m ()) -> m () Source #

newtype ToHSM (m :: ★ -> ★) (a :: ★) Source #

Constructors

ToHSM
Fields unToHSM :: m a

Instances

Instances details

Monad m => Applicative (ToHSM m) Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods pure :: a -> ToHSM m a # (<>) :: ToHSM m (a -> b) -> ToHSM m a -> ToHSM m b # liftA2 :: (a -> b -> c) -> ToHSM m a -> ToHSM m b -> ToHSM m c # (>) :: ToHSM m a -> ToHSM m b -> ToHSM m b # (<*) :: ToHSM m a -> ToHSM m b -> ToHSM m a #
Functor t => Functor (ToHSM t) Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods fmap :: (a -> b) -> ToHSM t a -> ToHSM t b # (<$) :: a -> ToHSM t b -> ToHSM t a #
Monad m => Monad (ToHSM m) Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods (>>=) :: ToHSM m a -> (a -> ToHSM m b) -> ToHSM m b # (>>) :: ToHSM m a -> ToHSM m b -> ToHSM m b # return :: a -> ToHSM m a #

tohsMonad :: forall m. Monad m => W (Monad m) Source #

newtype FrHSM (m :: ★ -> ★) (a :: ★) Source #

Constructors

FrHSM
Fields unFrHSM :: m a

Instances

Instances details

Monad m => Bind (FrHSM m) Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods (≫=) :: FrHSM m a -> (a -> FrHSM m b) -> FrHSM m b Source #
Functor t => Functor (FrHSM t) Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods map :: (a -> b) -> FrHSM t a -> FrHSM t b Source #
Monad m => Monad (FrHSM m) Source #
Instance details Defined in UVMHS.Core.Classes.Functors
Monad m => Return (FrHSM m) Source #
Instance details Defined in UVMHS.Core.Classes.Functors Methods return :: a -> FrHSM m a Source #

frhsMonad :: forall m. Monad m => W (Monad m) Source #