CurryInfo: base-3.4.0 / Prelude.uncurry
definition: 
|
uncurry :: (a -> b -> c) -> (a, b) -> c uncurry f (a, b) = f a b |
|
demand:
|
arguments 1 2 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
| Converts an curried function to a function on pairs. |
|
failfree:
|
(_, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,{(,)}) |-> _}
|
|
name:
|
uncurry |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
(a -> b -> c) -> (a, b) -> c |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |