Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
newtype
ReaderArrow r (a :: Type -> Type -> Type) b carrows Control.Arrow.Transformer.Reader An arrow type that augments an existing arrow with a read-only state (or environment). The ArrowReader class contains the operations on this state.
ReaderArrow :: a (b, r) c -> ReaderArrow r (a :: Type -> Type -> Type) b carrows Control.Arrow.Transformer.Reader No documentation available.
data
Reader (m :: Type -> Type)hledger-lib Hledger.Read.Common A hledger journal reader is a triple of storage format name, a detector of that format, and a parser from that format to Journal. The type variable m appears here so that rParserr can hold a journal parser, which depends on it.
-
hledger-lib Hledger.Read.Common No documentation available.
module Number.ResidueClass.
Reader No documentation available.
type
ReadS a = String -> [(a, String)]numeric-prelude NumericPrelude A parser for a type a, represented as a function that takes a String and returns a list of possible parses as (a,String) pairs. Note that this kind of backtracking parser is very inefficient; reading a large structure may be quite slow (cf ReadP).
type
ReadS a = String -> [(a, String)]numeric-prelude NumericPrelude.Base A parser for a type a, represented as a function that takes a String and returns a list of possible parses as (a,String) pairs. Note that this kind of backtracking parser is very inefficient; reading a large structure may be quite slow (cf ReadP).
type
ReadS a = String -> [(a, String)]numhask NumHask.Prelude A parser for a type a, represented as a function that takes a String and returns a list of possible parses as (a,String) pairs. Note that this kind of backtracking parser is very inefficient; reading a large structure may be quite slow (cf ReadP).
type
ReadS a = String -> [(a, String)]basic-prelude BasicPrelude A parser for a type a, represented as a function that takes a String and returns a list of possible parses as (a,String) pairs. Note that this kind of backtracking parser is very inefficient; reading a large structure may be quite slow (cf ReadP).
type
Reader r = ReaderT r Identityclassy-prelude ClassyPrelude The parameterizable reader monad. Computations are functions of a shared environment. The return function ignores the environment, while m >>= k passes the inherited environment to both subcomputations: