Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

1. (&) :: a -> (a -> b) -> b

   numhask	NumHask.Prelude

   & is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $. This is a version of flip id, where id is specialized from a -> a to (a -> b) -> (a -> b) which by the associativity of (->) is (a -> b) -> a -> b. flipping this yields a -> (a -> b) -> b which is the type signature of &

   Examples

   >>> 5 & (+1) & show
   "6"
   

   >>> sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)
   3.1406380562059946
   

2. (&) :: s -> (s -> t) -> t

   lens-family-core	Lens.Family

   A flipped version of ($).

3. (&) :: a -> (a -> b) -> b

   rebase	Rebase.Prelude

   & is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $. This is a version of flip id, where id is specialized from a -> a to (a -> b) -> (a -> b) which by the associativity of (->) is (a -> b) -> a -> b. flipping this yields a -> (a -> b) -> b which is the type signature of &

   Examples

   >>> 5 & (+1) & show
   "6"
   

   >>> sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)
   3.1406380562059946
   

4. (&) :: a -> (a -> b) -> b

   turtle	Turtle

   & is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $. This is a version of flip id, where id is specialized from a -> a to (a -> b) -> (a -> b) which by the associativity of (->) is (a -> b) -> a -> b. flipping this yields a -> (a -> b) -> b which is the type signature of &

   Examples

   >>> 5 & (+1) & show
   "6"
   

   >>> sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)
   3.1406380562059946
   

5. (&) :: a -> (a -> b) -> b

   ap-normalize	ApNormalize

   & is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $. This is a version of flip id, where id is specialized from a -> a to (a -> b) -> (a -> b) which by the associativity of (->) is (a -> b) -> a -> b. flipping this yields a -> (a -> b) -> b which is the type signature of &

   Examples

   >>> 5 & (+1) & show
   "6"
   

   >>> sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)
   3.1406380562059946
   

6. class (c a, d a) => ((c :: k -> Constraint) & (d :: k -> Constraint)) (a :: k)

   barbies	Barbies.Constraints

   No documentation available.

7. (&) :: a -> (a -> b) -> b

   base-prelude	BasePrelude

   & is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $. This is a version of flip id, where id is specialized from a -> a to (a -> b) -> (a -> b) which by the associativity of (->) is (a -> b) -> a -> b. flipping this yields a -> (a -> b) -> b which is the type signature of &

   Examples

   >>> 5 & (+1) & show
   "6"
   

   >>> sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)
   3.1406380562059946
   

8. (&) :: a -> (a -> b) -> b

   base-prelude	BasePrelude.Operators

   & is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $. This is a version of flip id, where id is specialized from a -> a to (a -> b) -> (a -> b) which by the associativity of (->) is (a -> b) -> a -> b. flipping this yields a -> (a -> b) -> b which is the type signature of &

   Examples

   >>> 5 & (+1) & show
   "6"
   

   >>> sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)
   3.1406380562059946
   

9. (&) :: LaTeXC l => l -> l -> l

   HaTeX	Text.LaTeX.Base.Commands

   Column separator.

10. (&) :: a -> (a -> b) -> b

    config-ini	Data.Ini.Config.Bidir

    & is a reverse application operator. This provides notational convenience. Its precedence is one higher than that of the forward application operator $, which allows & to be nested in $. This is a version of flip id, where id is specialized from a -> a to (a -> b) -> (a -> b) which by the associativity of (->) is (a -> b) -> a -> b. flipping this yields a -> (a -> b) -> b which is the type signature of &

    Examples

    >>> 5 & (+1) & show
    "6"
    

    >>> sqrt $ [1 / n^2 | n <- [1..1000]] & sum & (*6)
    3.1406380562059946
    

Page 3 of many | Previous | Next