CurryInfo: array-3.0.0 / Data.Array.combineSimilar

definition:
combineSimilar :: (a -> a -> a) -> Array a -> Array a -> Array a
combineSimilar f (Array def a1) (Array _ a2) =  Array def (combSim f a1 a2)
demand:
arguments 2 3
deterministic:
deterministic operation
failfree:
(_, _, _)
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_,{Array},{Array}) |-> {Array}}
name:
combineSimilar
precedence:
no precedence defined
result-values:
{Array}
signature:
(a -> a -> a) -> Array a -> Array a -> Array a
solution-complete:
operation might suspend on free variables
terminating:
yes
totally-defined:
reducible on all ground data terms