Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. sSequenceA_ :: forall (t1 :: Type -> Type) (f :: Type -> Type) a (t2 :: t1 (f a)) . (SFoldable t1, SApplicative f) => Sing t2 -> Sing (Apply (SequenceA_Sym0 :: TyFun (t1 (f a)) (f ()) -> Type) t2)

   singletons-base	Data.Foldable.Singletons

   No documentation available.

2. sSequence_ :: forall (t1 :: Type -> Type) (m :: Type -> Type) a (t2 :: t1 (m a)) . (SFoldable t1, SMonad m) => Sing t2 -> Sing (Apply (Sequence_Sym0 :: TyFun (t1 (m a)) (m ()) -> Type) t2)

   singletons-base	Data.Foldable.Singletons

   No documentation available.

3. type family Subsequences (a1 :: [a]) :: [[a]]

   singletons-base	Data.List.Singletons

   No documentation available.

4. data SubsequencesSym0 (a1 :: TyFun [a] [[a]])

   singletons-base	Data.List.Singletons

   No documentation available.

5. type family SubsequencesSym1 (a6989586621679827874 :: [a]) :: [[a]]

   singletons-base	Data.List.Singletons

   No documentation available.

6. sSubsequences :: forall a (t :: [a]) . Sing t -> Sing (Apply (SubsequencesSym0 :: TyFun [a] [[a]] -> Type) t)

   singletons-base	Data.List.Singletons

   No documentation available.

7. sSequence :: forall (m :: Type -> Type) a (t1 :: t (m a)) . (STraversable t, SMonad m) => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) t1)

   singletons-base	Data.Singletons.Base.TH

   No documentation available.

8. sSequenceA :: forall (f :: Type -> Type) a (t1 :: t (f a)) . (STraversable t, SApplicative f) => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) t1)

   singletons-base	Data.Singletons.Base.TH

   No documentation available.

9. sSequence :: forall (m :: Type -> Type) a (t1 :: t (m a)) . (STraversable t, SMonad m) => Sing t1 -> Sing (Apply (SequenceSym0 :: TyFun (t (m a)) (m (t a)) -> Type) t1)

   singletons-base	Data.Traversable.Singletons

   No documentation available.

10. sSequenceA :: forall (f :: Type -> Type) a (t1 :: t (f a)) . (STraversable t, SApplicative f) => Sing t1 -> Sing (Apply (SequenceASym0 :: TyFun (t (f a)) (f (t a)) -> Type) t1)

    singletons-base	Data.Traversable.Singletons

    No documentation available.

Page 56 of many | Previous | Next