Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

  1. (:..>) :: forall (ts :: Stack) (b :: Type -> Type) c (t :: (Type -> Type) -> Type -> Type) . RunStackT ts b c -> (t (StackT ts b) c -> StackT ts b c) -> RunStackT (ts ':.|> t) b c

    deriving-trans Control.Monad.Trans.Compose.Stack

    run the next monad transformer on a stack

  2. (:.|>) :: Stack -> ((Type -> Type) -> Type -> Type) -> Stack

    deriving-trans Control.Monad.Trans.Compose.Stack

    add a monad transformer to a stack

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

    diff-loc DiffLoc.Interval

    No documentation available.

  4. 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)"

  5. (:->) :: Formula -> Formula -> Formula

    djinn-lib Djinn.LJTFormula

    No documentation available.

  6. 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

  7. 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.

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

    labels Labels

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

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

    labels Labels

    No documentation available.

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

    labels Labels.Internal

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

Page 71 of many | Previous | Next