3 ms·
What on earth are you talking about? The definition of "lambda" is "anonymous function." Naming is orthogonal to closures, yes, but it's the entire difference b
by cwyers 10y ago
What on earth are you talking about? The definition of "lambda" is "anonymous function." Naming is orthogonal to closures, yes, but it's the entire difference between a lambda and any other kind of function. A lambda can close over state or not, it doesn't matter. It just needs to not have a name. So if naming is orthogonal to closures, then lambdas are orthogonal to closures, and then it makes no sense to compare them.
- kibwen 10y ago> The definition of "lambda" is "anonymous function." > A lambda can close over state or not, it doesn't matter. I've never heard of any definition of "function" that allows closing over state, that's the demarcation that we use to distinguish a function from a closure. What taxonomy are you trying to propose? And going back to my original question, what is the practical intent of trying to make a lambda a semantically-distinct concept from a closure?
- cwyers 10y agohttps://wiki.haskell.org/Anonymous_function https://wiki.haskell.org/Anonymous_function https://wiki.haskell.org/Closure https://wiki.haskell.org/Closure
- Dylan16807 10y agoIn the phrase "anonymous function", "function" means anything that you can call. This includes closures. I'm very surprised you've never heard of the word "function" being used that way.