Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. recursiveEq' :: (Recursive (->) t f, Steppable (->) u f, Functor f, Foldable f) => (f () -> f () -> Bool) -> t -> u -> Bool

   yaya	Yaya.Fold

   Like recursiveEq, but allows you to provide a custom comparator for f.

2. seqEither :: Functor f => Coalgebra (->) f a -> DistributiveLaw (->) (Either a) f

   yaya	Yaya.Fold

   No documentation available.

3. seqIdentity :: forall (f :: Type -> Type) . Functor f => DistributiveLaw (->) Identity f

   yaya	Yaya.Fold

   A less-constrained sequenceA for Identity.

4. binarySequence :: (a -> b -> c) -> (a, b) -> (a, (b, c))

   yaya	Yaya.Fold.Common

   No documentation available.

5. lucasSequence' :: Num n => n -> n -> (n, n) -> (n, (n, n))

   yaya	Yaya.Fold.Common

   No documentation available.

6. ternarySequence :: (a -> b -> c -> d) -> (a, b, c) -> (a, (b, c, d))

   yaya	Yaya.Fold.Common

   No documentation available.

7. unarySequence :: (a -> b) -> a -> (a, b)

   yaya	Yaya.Fold.Common

   No documentation available.

8. recursiveEq :: forall t (f :: Type -> Type) u . (Recursive (->) t f, Steppable (->) u f, Functor f, Foldable f, Eq1 f) => t -> u -> Bool

   yaya	Yaya.Retrofit

   An implementation of == for any Recursive instance. Note that this is actually more general than Eq’s ==, as it can compare between different fixed-point representations of the same functor. NB: Use recursiveEq' if you need to use a custom comparator for f.

9. recursiveEq' :: (Recursive (->) t f, Steppable (->) u f, Functor f, Foldable f) => (f () -> f () -> Bool) -> t -> u -> Bool

   yaya	Yaya.Retrofit

   Like recursiveEq, but allows you to provide a custom comparator for f.

10. frequency' :: [(Int, MakeResult a)] -> MakeResult a

    ChasingBottoms	Test.ChasingBottoms.ContinuousFunctions

    Lifting of frequency.

Page 435 of many | Previous | Next