Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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

  1. (:..) :: p -> !Trans p -> Interval p

    diff-loc DiffLoc.Interval

    No documentation available.

  2. newtype (f :: Type -> Type) :$: x

    diff-loc DiffLoc.Starter

    A trick to reduce noise by hiding newtype wrapper constructors. This makes the documentation more palatable. 

    >>> show (NoShow (Plain 3) :: Plain :$: Int)
"3"

>>> show (Colline 4 2 :.. Vallee (offset 3) (offset 3) :: Interval (Colline N N))
"Colline 4 2 :.. Vallee (offset 3) (offset 3)"

  3. (:->) :: Formula -> Formula -> Formula

    djinn-lib Djinn.LJTFormula

    No documentation available.

  4. newtype (a :: k) := (b :: k)

    eq Data.Eq.Type

    Leibnizian equality states that two things are equal if you can substitute one for the other in all contexts

  5. newtype (a :: j) :== (b :: k)

    eq Data.Eq.Type.Hetero

    Heterogeneous Leibnizian equality. Leibnizian equality states that two things are equal if you can substitute one for the other in all contexts.

  6. data (label :: Symbol) := value

    labels Labels

    Field named l labels value of type t. Example: (#name := "Chris") :: ("name" := String)

  7. (:=) :: Proxy label -> value -> (:=) (label :: Symbol) value

    labels Labels

    No documentation available.

  8. data (label :: Symbol) := value

    labels Labels.Internal

    Field named l labels value of type t. Example: (#name := "Chris") :: ("name" := String)

  9. (:=) :: Proxy label -> value -> (:=) (label :: Symbol) value

    labels Labels.Internal

    No documentation available.

  10. (:>) :: k -> v -> Assoc k v

    membership Type.Membership

    No documentation available.

Page 71 of many | Previous | Next