> I'll quote from the abstract: > Function currying is the process of partially, or incrementally, > supplying arguments to a function. Curried functions are delayed > functions expecting the remainder of the arguments to be supplied. > Once all the arguments are supplied, the function evaluates normally. But there's a perfectly good term for that behavior: partial application, and what that note calls curried functions are really closures. If you use currying to refer to what I've just called partial application, what term do you use to refer to currying? I'm with Dave on this one: If you have a function f that takes two arguments, then currying f should yield a function with one argument that returns a function that takes one argument.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4