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.

  1. type (c :: Ctx k) ::> (a :: k) = c '::> a

    parameterized-utils Data.Parameterized.Ctx

    No documentation available.

  2. data (a :: k) :~: (b :: k)

    parameterized-utils Data.Parameterized.NatRepr

    Propositional equality. If a :~: b is inhabited by some terminating value, then the type a is the same as the type b. To use this equality in practice, pattern-match on the a :~: b to get out the Refl constructor; in the body of the pattern-match, the compiler knows that a ~ b.

  3. data (a :: k) :~: (b :: k)

    parameterized-utils Data.Parameterized.Peano

    Propositional equality. If a :~: b is inhabited by some terminating value, then the type a is the same as the type b. To use this equality in practice, pattern-match on the a :~: b to get out the Refl constructor; in the body of the pattern-match, the compiler knows that a ~ b.

  4. type a :-> t = a

    shake Development.Shake.Command

    A type annotation, equivalent to the first argument, but in variable argument contexts, gives a clue as to what return type is expected (not actually enforced).

  5. data u :-* v

    vector-space Data.LinearMap

    Linear map, represented as an optional memo-trie from basis to values, where Nothing means the zero map (an optimization).

  6. data a :> b

    vector-space Data.Maclaurin

    Tower of derivatives.

  7. type a :~> b = a -> a :> b

    vector-space Data.Maclaurin

    Infinitely differentiable functions

  8. type (a1 :: a -> Type) :~> (b1 :: b -> Type) = Lam a1 b1

    defun-core DeFun.Core

    An infix synonym for Lam

  9. (:-) :: forall x (xs1 :: [Type]) . x -> HVec xs1 -> HVec (x ': xs1)

    equational-reasoning Proof.Equational

    No documentation available.

  10. type a :/\: b = (a, b)

    equational-reasoning Proof.Equational

    No documentation available.

Page 23 of many | Previous | Next