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. data Step s a

    unicode-data Unicode.Internal.Unfold

    A stream is a succession of Steps.

  2. data Step

    HaTeX Text.LaTeX.Packages.TikZ.Syntax

    No documentation available.

  3. Step :: a -> Next a

    alfred-margaret Data.Text.AhoCorasick.Automaton

    No documentation available.

  4. Step :: a -> Next a

    alfred-margaret Data.Text.BoyerMoore.Automaton

    No documentation available.

  5. Step :: a -> Next a

    alfred-margaret Data.Text.BoyerMooreCI.Automaton

    No documentation available.

  6. Step :: step -> Progress step fail done -> Progress step fail done

    cabal-install-solver Distribution.Solver.Types.Progress

    No documentation available.

  7. module Control.Applicative.Step

    This module provides functor combinators that are the fixed points of applications of :+: and These1. They are useful for their Interpret instances, along with their relationship to the Monoidal instances of :+: and These1.

  8. data Step (f :: k -> Type) (a :: k)

    functor-combinators Control.Applicative.Step

    An f a, along with a Natural index.

    Step f a ~ (Natural, f a)
    Step f   ~ ((,) Natural) :.: f       -- functor composition
    
    It is the fixed point of infinite applications of :+: (functor sums). Intuitively, in an infinite f :+: f :+: f :+: f ..., you have exactly one f somewhere. A Step f a has that f, with a Natural giving you "where" the f is in the long chain. Can be useful for using with the Monoidal instance of :+:. interpreting it requires no constraint on the target context. Note that this type and its instances equivalent to EnvT (Sum Natural).

  9. Step :: Natural -> f a -> Step (f :: k -> Type) (a :: k)

    functor-combinators Control.Applicative.Step

    No documentation available.

  10. data Step (f :: k -> Type) (a :: k)

    functor-combinators Data.Functor.Combinator

    An f a, along with a Natural index.

    Step f a ~ (Natural, f a)
    Step f   ~ ((,) Natural) :.: f       -- functor composition
    
    It is the fixed point of infinite applications of :+: (functor sums). Intuitively, in an infinite f :+: f :+: f :+: f ..., you have exactly one f somewhere. A Step f a has that f, with a Natural giving you "where" the f is in the long chain. Can be useful for using with the Monoidal instance of :+:. interpreting it requires no constraint on the target context. Note that this type and its instances equivalent to EnvT (Sum Natural).

Page 8 of many | Previous | Next