Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?
 
PerlMonks  

Re^10: Near-free function currying in Perl

by tilly (Archbishop)
on Nov 18, 2004 at 17:23 UTC ( [id://408818]=note: print w/replies, xml ) Need Help??


in reply to Re^9: Near-free function currying in Perl
in thread Near-free function currying in Perl

I think you're missing the point - 90% of all Perl programmers will never know that you can take a reference to a subroutine. To them, currying is a very advanced technique.

If you apply Sturgeon's law, 90% of all Perl programmers are crud. Coincidence? You decide!

More seriously I'd estimate that over 50% of all Perl programmers have vague plans to learn something about this OO stuff sometime, so to them OO is an advanced technique. It is all a question of perspective. And if you personally are willing to put some energy in, your perspective bears no relationship to what most people experience.

My perspective is that currying is pretty simple, and it isn't even very hard to teach. Sure, showing a realistic example induces brain lock the first time. But that is temporary and clears up on its own. Since I have no problem taking the energy to spread the knowledge, I have no problem with using it in reasonable doses.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://408818]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others taking refuge in the Monastery: (4)
As of 2024-03-19 11:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found