Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. ( #. ) :: (b % 1 -> c) -> (a % 1 -> b) -> a % 1 -> c

   linear-base	Simple.Pure

   No documentation available.

2. newtype ((f :: k2 -> Type) :.: (g :: k1 -> k2)) (x :: k1)

   linear-generics	Generics.Linear

   The composition operator for types. We use our own here because for many classes, it's possible to share generic deriving classes between GHC.Generics and Generics.Linear by just instantiating them for both composition operators (and MP1).

3. (<=.) :: x -> Double -> Inequality x

   linear-programming	Numeric.LinearProgramming.Common

   No documentation available.

4. (==.) :: x -> Double -> Inequality x

   linear-programming	Numeric.LinearProgramming.Common

   No documentation available.

5. (>=.) :: x -> Double -> Inequality x

   linear-programming	Numeric.LinearProgramming.Common

   No documentation available.

6. (>=<.) :: x -> (Double, Double) -> Inequality x

   linear-programming	Numeric.LinearProgramming.Common

   No documentation available.

7. (&.&) :: Pred -> Pred -> Pred

   liquid-fixpoint	Language.Fixpoint.Types.Refinements

   No documentation available.

8. (|.|) :: Pred -> Pred -> Pred

   liquid-fixpoint	Language.Fixpoint.Types.Refinements

   No documentation available.

9. (^.) :: a -> (a -> b) -> b

   sbv	Data.SBV.Tuple

   Field access, inspired by the lens library. This is merely reverse application, but allows us to write things like (1, 2)^._1 which is likely to be familiar to most Haskell programmers out there. Note that this is precisely equivalent to _1 (1, 2), but perhaps it reads a little nicer.

10. (<.>) :: Keyword -> Keyword -> Keyword

    sql-words	Language.SQL.Keyword.Concat

    Binary operator to create qualified name on SQL.

Page 136 of many | Previous | Next