You don't actually need the second lambda since all Haskell functions take one argument, so you can just do
f = \x y -> x + y
and you'll have an implicit lambda before the y. f = \x y -> x + y
and you'll have an implicit lambda before the y. (X, y) -> x+y
It also has a subtly different performance characteristic in GHC, it turns out. Same semantics though. f = (+) f x y = x + y