Copyright | (c) 2023-2024 Sayo Koyoneda (c) 2023 Casper Bach Poulsen and Cas van der Rest |
---|---|
License | MPL-2.0 (see the file LICENSE) |
Maintainer | ymdfield@outlook.jp |
Stability | experimental |
Portability | portable |
Safe Haskell | None |
Language | GHC2021 |
Data.Effect
Description
Documentation
newtype LiftFOE (ins :: EffectF) (f :: Type -> Type) a Source #
Lift first-order effects to higher-order effects.
Come from heft-lang/POPL2023/haskell/src/Elab.hs.
Instances
HFunctor (LiftFOE ins) Source # | |
SendFOE ins f => SendHOE (LiftFOE ins) f Source # | |
Defined in Control.Effect | |
Foldable ins => Foldable (LiftFOE ins f) Source # | |
Defined in Data.Effect Methods fold :: Monoid m => LiftFOE ins f m -> m # foldMap :: Monoid m => (a -> m) -> LiftFOE ins f a -> m # foldMap' :: Monoid m => (a -> m) -> LiftFOE ins f a -> m # foldr :: (a -> b -> b) -> b -> LiftFOE ins f a -> b # foldr' :: (a -> b -> b) -> b -> LiftFOE ins f a -> b # foldl :: (b -> a -> b) -> b -> LiftFOE ins f a -> b # foldl' :: (b -> a -> b) -> b -> LiftFOE ins f a -> b # foldr1 :: (a -> a -> a) -> LiftFOE ins f a -> a # foldl1 :: (a -> a -> a) -> LiftFOE ins f a -> a # toList :: LiftFOE ins f a -> [a] # null :: LiftFOE ins f a -> Bool # length :: LiftFOE ins f a -> Int # elem :: Eq a => a -> LiftFOE ins f a -> Bool # maximum :: Ord a => LiftFOE ins f a -> a # minimum :: Ord a => LiftFOE ins f a -> a # | |
Traversable ins => Traversable (LiftFOE ins f) Source # | |
Defined in Data.Effect Methods traverse :: Applicative f0 => (a -> f0 b) -> LiftFOE ins f a -> f0 (LiftFOE ins f b) # sequenceA :: Applicative f0 => LiftFOE ins f (f0 a) -> f0 (LiftFOE ins f a) # mapM :: Monad m => (a -> m b) -> LiftFOE ins f a -> m (LiftFOE ins f b) # sequence :: Monad m => LiftFOE ins f (m a) -> m (LiftFOE ins f a) # | |
Functor ins => Functor (LiftFOE ins f) Source # | |