In my last post I’ve tried to explain the differences between partial function application and function currying.
The post was more generally addressed to JavaScript developers (as an accompanying material to a presentation I’m working on) so I’ve tried to keep the text as practical as possible in the context of JavaScript programming.
But as I remarked on, the post wasn’t academically correct, more precisely the examples I’ve used had a specific purpose of incorrectness
. Skipping that part for now, let’s just see what exactly currying means to its true definition.
In mathematics and computer science, currying is the technique of transforming a function that takes multiple arguments (or an n-tuple of arguments) in such a way that it can be called as a chain of one argument functions.