CurryInfo: base-3.3.0 / Control.Applicative.liftA

definition:
 
liftA :: Applicative f => (a -> b) -> f a -> f b
liftA f a = pure f <*> a
demand:
 argument 1
deterministic:
 deterministic operation
documentation:
 
Lift a function to actions.
This function may be used as a value for `fmap` in a `Functor` instance.
failfree:
 (_, _, _)
indeterministic:
 referentially transparent operation
infix:
 no fixity defined
iotype:
 {(_,_,_) |-> _}
name:
 liftA
precedence:
 no precedence defined
result-values:
 _
signature:
 Prelude.Applicative 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