Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. forceEtaExpandRecord :: (HasConstInfo m, MonadDebug m, ReadTCState m, MonadError TCErr m) => QName -> Args -> Term -> m (Telescope, Args)

   Agda	Agda.TypeChecking.Records

   Eta expand a record regardless of whether it's an eta-record or not.

2. forceSort :: Type -> TCM Sort

   Agda	Agda.TypeChecking.Rules.Data

   Ensure that the type is a sort. If it is not directly a sort, compare it to a newSortMetaBelowInf.

3. forA :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)

   Agda	Agda.Utils.Applicative

   Better name for for.

4. forMaybe :: [a] -> (a -> Maybe b) -> [b]

   Agda	Agda.Utils.Maybe

   Version of mapMaybe with different argument ordering.

5. forMaybe :: [a] -> (a -> Maybe b) -> [b]

   Agda	Agda.Utils.Maybe.Strict

   Version of mapMaybe with different argument ordering.

6. forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b)

   Agda	Agda.Utils.Monad

   forM is mapM with its arguments flipped. For a version that ignores the results see forM_.

7. forM' :: (Foldable t, Applicative m, Monoid b) => t a -> (a -> m b) -> m b

   Agda	Agda.Utils.Monad

   Generalized version of for_ :: Applicative m => [a] -> (a -> m ()) -> m ()

8. forMM :: (Traversable t, Monad m) => m (t a) -> (a -> m b) -> m (t b)

   Agda	Agda.Utils.Monad

   No documentation available.

9. forMM_ :: (Foldable t, Monad m) => m (t a) -> (a -> m ()) -> m ()

   Agda	Agda.Utils.Monad

   No documentation available.

10. forM_ :: (Foldable t, Monad m) => t a -> (a -> m b) -> m ()

    Agda	Agda.Utils.Monad

    forM_ is mapM_ with its arguments flipped. For a version that doesn't ignore the results see forM. forM_ is just like for_, but specialised to monadic actions.

Page 150 of many | Previous | Next