... it was that recursion in Perl is crazy inefficient, ...
Is it really? I mean, its certainly not as efficient as the equivalent iterative code. And I know that subroutine calls have a non-trivial overhead (setting up lexical scope and all), but being that perl does not tie itself to the C-stack like some other langauges do (*cough* Python *cough*) I would think that it wouldn't really be all that inefficient. Of course, I have never benchmarked it, so who knows.
... and to use it just because its "functional" is kind of silly ...
But if we can't get silly with Perl at 7 o'clock (EST) on a Friday night, then what kind of world is this! ;-P
about tail-recursion, which is an optimization that Perl doesn't support (for some reason, I honesetly don't have a clue why)
I don't know why either, I once looked into trying to "implement" it with the B:: modules. But once was all it took for me to to decide that wouldn't work.
In reply to Re^10: Specializing Functions with Currying
by stvn
in thread Specializing Functions with Currying
by FoxtrotUniform
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |