Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. Flip :: t b a -> Flip (t :: Type -> Type -> Type) a b

   type-flip	Data.Type.Flip

   No documentation available.

2. module Rebase.Data.Bifunctor.Flip

   No documentation available.

3. newtype Flip (b :: k -> k1 -> Type) (l :: k1) (r :: k)

   barbies	Barbies.Bi

   Convert a FunctorB into a FunctorT and vice-versa.

4. Flip :: b r l -> Flip (b :: k -> k1 -> Type) (l :: k1) (r :: k)

   barbies	Barbies.Bi

   No documentation available.

5. newtype Flip (g :: k -> Type) (a :: k1) (f :: k1 -> k)

   rank2classes	Rank2

   A nested parametric type represented as a rank-2 type

6. Flip :: g (f a) -> Flip (g :: k -> Type) (a :: k1) (f :: k1 -> k)

   rank2classes	Rank2

   No documentation available.

7. Flip :: forall p b a . Grammar p b a -> Grammar p a b

   invertible-grammar	Data.InvertibleGrammar.Base

   Flip forward and backward passes of an underlying grammar.

8. module Data.Function.Flip

   No documentation available.

9. Flip :: Symbol n

   diagrams-contrib	Diagrams.TwoD.Path.LSystem

   No documentation available.

10. flipped :: forall a b c a' b' c' p f . (Profunctor p, Functor f) => p (b -> a -> c) (f (b' -> a' -> c')) -> p (a -> b -> c) (f (a' -> b' -> c'))

    lens	Control.Lens.Combinators

    The isomorphism for flipping a function.

    >>> ((,)^.flipped) 1 2
    (2,1)
    

Page 7 of many | Previous | Next