CurryInfo: dimacs-3.0.0 / DetParser.<*

definition:
(<*) :: Parser token a -> Parser token b -> Parser token a
a <* b = const <$> a <*> b
demand:
no demanded arguments
deterministic:
deterministic operation
documentation:
--- Combine parsers with resulting representation of first one.
failfree:
(_, _)
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_,_) |-> {<*>._#lambda1}}
name:
<*
precedence:
no precedence defined
result-values:
{<*>._#lambda1}
signature:
([a] -> Prelude.Either String ([a], b)) -> ([a]
-> Prelude.Either String ([a], c)) -> [a] -> Prelude.Either String ([a], b)
solution-complete:
operation might suspend on free variables
terminating:
yes
totally-defined:
reducible on all ground data terms