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