CurryInfo: base-3.4.0 / Prelude.<$>
definition: 
|
(<$>) :: Functor f => (a -> b) -> f a -> f b (<$>) = fmap |
|
demand:
|
argument 1 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
| Apply a function of type `(a -> b)`, given as the left argument, to a value of type `f a`, where `f` is a functor, to get a value of type `f b`. Basically, this is an infix operator version of `fmap`. |
|
failfree:
|
_ |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
infixl |
|
iotype:
|
{(_) |-> _}
|
|
name:
|
<$> |
|
precedence:
|
4 |
|
result-values:
|
_ |
|
signature:
|
Functor c => (a -> b) -> c a -> c b |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |