Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

  1. type a :*: b = (a, b)

    data-has Data.Has

    Infix version of tuple(right associative).

  2. pattern (:*:) :: a -> b -> (a, b)

    data-has Data.Has

    Infix pattern alias for tuple(right associative).

  3. (:/:) :: LinearForm t -> LinearForm t -> RationalForm t

    exp-pairs Math.ExpPairs

    No documentation available.

  4. (:/:) :: LinearForm t -> LinearForm t -> RationalForm t

    exp-pairs Math.ExpPairs.LinearForm

    No documentation available.

  5. (:$) :: Expr -> Expr -> Expr

    extrapolate Test.Extrapolate

    function application between expressions

  6. data a :-> b

    falsify Test.Falsify.Generator

    No documentation available.

  7. class (c1 a, c2 a) => ((c1 :: k -> Constraint) :&&: (c2 :: k -> Constraint)) (a :: k)

    fixed-vector-hetero Data.Vector.HFixed.Class

    Type class for combining two constraint constructors. Those are required for ArityC type class.

  8. data ((f :: k -> Type) :+: (g :: k -> Type)) (e :: k)

    free-alacarte Free.AlaCarte

    No documentation available.

  9. class (Functor sub, Functor sup) => (sub :: Type -> Type) :<: (sup :: Type -> Type)

    free-alacarte Free.AlaCarte

    No documentation available.

  10. data a ::: p

    gdp Data.Refined

    Given a type a and a proposition p, the type (a ::: p) represents a value of type a, with an attached "ghost proof" of p. Values of the type (a ::: p) have the same run-time representation as values of the normal type a; the proposition p does not carry a run-time space or time cost.

Page 53 of many | Previous | Next