Hoogle Search
Within LTS Haskell 24.39 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
data
Permutation (m :: Type -> Type) aparser-combinators Control.Applicative.Permutations An Applicative wrapper-type for constructing permutation parsers.
Postfix :: m (a -> a) -> Operator (m :: Type -> Type) aparser-combinators Control.Monad.Combinators.Expr Postfix
Prefix :: m (a -> a) -> Operator (m :: Type -> Type) aparser-combinators Control.Monad.Combinators.Expr Prefix
module Control.Monad.
Permutations This module specialized the interface to Monad for potential efficiency considerations, depending on the monad the permutations are run over. For a more general interface requiring only Applicative, and for more complete documentation, see the Control.Applicative.Permutations module.
data
Permutation (m :: Type -> Type) aparser-combinators Control.Monad.Permutations An Applicative wrapper-type for constructing permutation parsers.
class Alternative m =>
Parsing (m :: Type -> Type)parsers Text.Parser.Combinators Additional functionality needed to describe parsers independent of input type.
Postfix :: m (a -> a) -> Operator (m :: Type -> Type) aparsers Text.Parser.Expression No documentation available.
Prefix :: m (a -> a) -> Operator (m :: Type -> Type) aparsers Text.Parser.Expression No documentation available.
module Text.Parser.
Permutation This module implements permutation parsers. The algorithm is described in: Parsing Permutation Phrases, by Arthur Baars, Andres Loh and Doaitse Swierstra. Published as a functional pearl at the Haskell Workshop 2001.
data
Permutation (m :: Type -> Type) aparsers Text.Parser.Permutation The type Permutation m a denotes a permutation parser that, when converted by the permute function, parses using the base parsing monad m and returns a value of type a on success. Normally, a permutation parser is first build with special operators like (<||>) and than transformed into a normal parser using permute.