| definition: |
(<$>) :: (a -> b) -> Parser a -> Parser b f <$> p = map (\(x, s) -> (f x, s)) . p |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Builds a parser that applies a function to the result of the original --- parser. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
infixl |
| iotype: |
{(_,_) |-> {.._#lambda508}}
|
| name: |
<$> |
| precedence: |
4 |
| result-values: |
{.._#lambda508}
|
| signature: |
(a -> b) -> (String -> [(a, String)]) -> String -> [(b, String)] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |