Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
asList :: ([WellFormedSExpr t] -> Either String a) -> WellFormedSExpr t -> Either String as-cargot Data.SCargot.Repr.WellFormed Parse an arbitrary-length list using the provided function.
>>> let go xs = concat <$> mapM fromAtom xs >>> asList go (L [A "el", A "eph", A "ant"]) Right "elephant" >>> asList go (A "pachyderm") Left "asList: expected list; found atom"
fromList :: (WellFormedSExpr t -> Either String a) -> WellFormedSExpr t -> Either String [a]s-cargot Data.SCargot.Repr.WellFormed Utility function for parsing a list of things.
>>> fromList fromAtom (L [A "this", A "that", A "the-other"]) Right ["this","that","the-other"] >>> fromList fromAtom (A "pachyderm") Left "asList: expected proper list; found dotted list"
-
sbv Data.SBV No documentation available.
-
sbv Data.SBV A symbolic list of items. Note that a symbolic list is not a list of symbolic items, that is, it is not the case that SList a = [a], unlike what one might expect following haskell lists/sequences. An SList is a symbolic value of its own, of possibly arbitrary but finite length, and internally processed as one unit as opposed to a fixed-length list of items. Note that lists can be nested, i.e., we do allow lists of lists of ... items.
isList :: HasKind a => a -> Boolsbv Data.SBV No documentation available.
sList :: SymVal a => String -> Symbolic (SList a)sbv Data.SBV Declare a named SList NB. For a version which generalizes over the underlying monad, see sList
sList_ :: SymVal a => Symbolic (SList a)sbv Data.SBV Declare an unnamed SList NB. For a version which generalizes over the underlying monad, see sList_
sLists :: SymVal a => [String] -> Symbolic [SList a]sbv Data.SBV Declare a list of SLists NB. For a version which generalizes over the underlying monad, see sLists
-
sbv Data.SBV.Dynamic List
-
sbv Data.SBV.Dynamic No documentation available.