I believe that this concept is called "Currying" : en.wikipedia.org/wiki/Currying
FP 101 - Currying vs. Partial application
Currying is converting one function of arity n into n functions of arity one.
There is no requirement that partial application be bound to a particular arity (one, in the case of currying), it simply states that if you call a function with only some of the arguments - you get back another function "binds" or "fixes" the arguments that you passed in, as demonstrated by the author here. It's a very prevalent concept in FP languages like Haskell.
Thanks for clarifying this! I did do my research before deciding what keyword to use. I also thought curry is the same as partial function application. It's great someone could verify my word choice! :D
We're a place where coders share, stay up-to-date and grow their careers.
We strive for transparency and don't collect excess data.