CSC/ECE 517 Fall 2011/ch1 2a av: Difference between revisions
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
=Currying= | =Currying= | ||
Currying is a programming technique that transforms a function with multiple arguments into a series of single argument functions. | Currying is a programming technique that transforms a function with multiple arguments into a series of single argument functions. It is the ability to convert a single function with ''n'' arguments into ''n'' functions with single argument each. | ||
Currying is a basically a mathematical concept applied in several areas of computer science. | Currying is a basically a mathematical concept applied in several areas of computer science. | ||
Revision as of 01:02, 15 September 2011
Currying
Currying is a programming technique that transforms a function with multiple arguments into a series of single argument functions. It is the ability to convert a single function with n arguments into n functions with single argument each. Currying is a basically a mathematical concept applied in several areas of computer science.
Discovery and Naming
The currying technique was discovered by Moses Schönfinkel[1]. Is was rediscovered by mathematician Haskell Curry[2].
Christopher Strachey[3] coined the term "currying" in 1967, after Haskell Curry[4]. However, it has been proposed to call this technique "Schönfinkelisation", in reference to its original discoverer Moses Schönfinkel[5].