Anonymous user
Talk:Partial function application: Difference between revisions
→Proposal for new task description: re
(→Is D correct?: Make plain that D doesn't have it.) |
|||
Line 193:
:Hi Ruud, I would prefer keeping them separate as it seems it is hard enough getting results for Partial function application on its own. Extending the task would further complicate things. How about a separate Curry task written to emphasize the difference between it and Partial application? --[[User:Paddy3118|Paddy3118]] 20:42, 15 April 2011 (UTC)
:: Yes, but currying and partial application are quite closely related and often confused. It may be easier to understand them if they are both used together. Also, if I managed to implement the Ruby example below correctly, currying and partial application seems both to be implemented by Proc#curry. Finally, regarding the complications there seem to be with some of the language: I'm not yet convinced partial application (and currying) can be ''reasonably'' implemented in all languages (as papply and curry are higher-order functions returning a function, I assume you would at least need first-class functions/closures or go through the trouble of emulating those). I'll try to write this task in a few more languages to see if it can be done or not. —''[[User:Ruud Koot|Ruud]]'' 21:56, 15 April 2011 (UTC)
Here are samples in Haskell and Python:
| |||