uncurrying

uncurrying

(programming)
Transforming a curried function of the form f x y z = ... to one of the form f (x,y,z) = ... , i.e. all arguments are passed as one tuple.
References in periodicals archive ?
The law (L4) is central in the implementation of uncurrying (e.
In practice, much of this overhead can be removed by uncurrying, but this optimization is not always possible for functions passed as arguments.
Uncurrying and related optimizations can be expressed based on the reduction rules of grabs and (L2).