As it exists in Haskell, yes, that's what partial application is — the result of applying a curried function to less than the full number of arguments. Some oth

As it exists in Haskell, yes, that's what partial application is — the result of applying a curried function to less than the full number of arguments. Some other languages have a more general form of partial application where you can partially apply arguments in non-sequential order, which isn't related to currying and instead just means creating a wrapper function that calls the original function with certain arguments filled in.