Hoogle Search
Within LTS Haskell 24.28 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapTCMT :: (forall a1 . () => m a1 -> n a1) -> TCMT m a -> TCMT n aAgda Agda.TypeChecking.Monad.Base No documentation available.
mapClosure :: (MonadTCEnv m, ReadTCState m) => (a -> m b) -> Closure a -> m (Closure b)Agda Agda.TypeChecking.Monad.Closure No documentation available.
mapAwakeConstraints :: (Constraints -> Constraints) -> TCState -> TCStateAgda Agda.TypeChecking.Monad.Constraints No documentation available.
mapSleepingConstraints :: (Constraints -> Constraints) -> TCState -> TCStateAgda Agda.TypeChecking.Monad.Constraints No documentation available.
-
Agda Agda.TypeChecking.Monad.Context Map a monadic function on the thing under the abstraction, adding the abstracted variable to the context.
mapAbstraction_ :: (Subst a, Subst b, MonadAddContext m) => (a -> m b) -> Abs a -> m (Abs b)Agda Agda.TypeChecking.Monad.Context No documentation available.
mapLHSCores :: (LHSCore -> LHSCore) -> RHS -> RHSAgda Agda.TypeChecking.Rules.Def Modify all the LHSCore of the given RHS. (Used to insert patterns for rewrite or the inspect idiom)
mapKeysMonotonic :: (k -> k') -> AssocList k v -> AssocList k' vAgda Agda.Utils.AssocList O(n). Named in analogy to mapKeysMonotonic. To preserve the invariant, it is sufficient that the key transformation is injective (rather than monotonic).
mapWithKey :: (k -> v -> v) -> AssocList k v -> AssocList k vAgda Agda.Utils.AssocList O(n). Map over an association list, preserving the order.
mapWithKeyM :: Applicative m => (k -> v -> m v) -> AssocList k v -> m (AssocList k v)Agda Agda.Utils.AssocList O(n). If called with a effect-producing function, violation of the invariant could matter here (duplicating effects).