4 ms·
Recursion also takes a while getting used to if you don't have a math background. Another issue is the frequent use of abbreviations in functional languages as
by felixmar 18y ago
Recursion also takes a while getting used to if you don't have a math background. Another issue is the frequent use of abbreviations in functional languages as seen in the Erlang example. A bit more verbosity in function and variable naming is useful to make the true abstractions more clear.
On the other hand swombat's Ruby examples which use mapping, filtering etc. would be more elegant in many functional languages.
- eru 18y agoYes. You do not see naked recursion very often in, say, Haskell. Most of the time you use the built-in combinators or roll your own.