CurryInfo: det-parse-3.0.0 / DetParse.*>=

definition:
(*>=) :: Parser a -> (a -> Parser b) -> Parser b
p *>= f = \s -> [ (y, s2) | (x, s1) <- p s,
                            (y, s2) <- (f x) s1 ]
demand:
no demanded arguments
deterministic:
deterministic operation
failfree:
(_, _)
indeterministic:
referentially transparent operation
infix:
infixl
iotype:
{(_,_) |-> {*>=._#lambda21}}
name:
*>=
precedence:
1
result-values:
{*>=._#lambda21}
signature:
(String -> [(a, String)]) -> (a -> String -> [(b, String)]) -> String
-> [(b, String)]
solution-complete:
operation might suspend on free variables
terminating:
yes
totally-defined:
reducible on all ground data terms