How do you call a convention by which any binary operator is an unary one returning another unary operator?
$F(x,y)\equiv (F(x))(y)$
This convention is used in functional programming languages. I want to know what is the name of this convention and may be after which scientist it is named if it did.