Partial application isn't currying; partially applying a function f to a first argument x is equivalent to currying f, applying the resulting unary function to x, and uncurrying the function that results from that application.
So, partial application can be defined in terms of currying, application, and uncurrying, but its not the same as currying.
Again, your description refers to "partial application", which is different from currying. I think that many people are comfortable with "currying" only because they think it's the same as partial application. The fact that this is incorrect is good reason to revisit the term.
> I think that many people are comfortable with "currying" only because they think it's the same as partial application.
If currying was the same as partial application, I'd say we don't need the name "currying" and can just use "partial application". So I guess you could say that I am comfortable with currying only because I don't think it is the same as partial application.
Good point. It's a bit of a wonder why so many people think of them as equivalent (perhaps they thought currying was a convenient shorthand for partial application). I'm comfortable with a simple campaign to clarify the difference, and I think my suggested terms would be helpful to accomplish that (so rather than replacements, simply informal descriptions of the term).
