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.
class Arrow a =>
ArrowIO (a :: Type -> Type -> Type)hxt Control.Arrow.ArrowIO the interface for converting an IO action into an arrow
class (Arrow a, ArrowIO a) =>
ArrowIOIf (a :: Type -> Type -> Type)hxt Control.Arrow.ArrowIO the interface for converting an IO predicate into a list arrow
-
Conditionals for List Arrows This module defines conditional combinators for list arrows. The empty list as result represents False, none empty lists True.
class ArrowList a =>
ArrowIf (a :: Type -> Type -> Type)hxt Control.Arrow.ArrowIf The interface for arrows as conditionals. Requires list arrows because False is represented as empty list, True as none empty lists. Only ifA and orElse don't have default implementations
module Control.Arrow.
ArrowList The list arrow class This module defines the interface for list arrows. A list arrow is a function that gives a list of results for a given argument. A single element result represents a normal function. An empty list often indicates that the function is undefined for the given argument. The empty list may also represent False, non-empty lists True. A list with more than one element gives all results for a so called nondeterministic function.
class (Arrow a, ArrowPlus a, ArrowZero a, ArrowApply a) =>
ArrowList (a :: Type -> Type -> Type)hxt Control.Arrow.ArrowList The interface for list arrows Only mkA, isA (>>.) don't have default implementations
-
Arrows for evaluation of normal form results
class Arrow a =>
ArrowNF (a :: Type -> Type -> Type)hxt Control.Arrow.ArrowNF No documentation available.
class (Arrow a, ArrowList a) =>
ArrowWNF (a :: Type -> Type -> Type)hxt Control.Arrow.ArrowNF partial evaluation of an arrow result using FlatSeq There are two arrows with force the partial evaluation. By convention the 2. should be less lazy than the 1. These arrows are sometimes useful for preventing space leaks, especially when parsing complex data structures. In many cases the evaluated AST is more space efficient than the unevaluaded with a lot of closures.
module Control.Arrow.
ArrowNavigatableTree List arrows for navigatable trees Trees that implement the Data.Tree.NavigatableTree.Class interface, can be processed with these arrows.