Uncurrying (uncurry :: (a -> b -> c) -> (a,b) -> c)

Convert a curried function into one taking a tuple: uncurry f (x,y) = f x y. Conversely, curry f x y = f (x,y). The two conversions undo each other on total arguments. Uncurrying lets map apply a curried binary operation to each tuple in a zipped list.