Beefy Boxes and Bandwidth Generously Provided by pair Networks Cowboy Neal with Hat
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^4: How A Function Becomes Higher Order

by adrianh (Chancellor)
on Sep 22, 2005 at 04:56 UTC ( [id://494044]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Re^3: How A Function Becomes Higher Order
in thread How A Function Becomes Higher Order

And that's essentially my complaint about this technique: it's nearly impossible to build large, extensible frameworks with. In my experience, functional programming works great at small levels of granularity; for anything larger, OO is far more useful. (Of course, the FP purists will disagree, and I'm not saying they're wrong.)

I certainly wouldn't describe myself as an FP purist, and I spend most of my time with OO languages these days, but I've found both FP and OO equally useful "in the large". Different techniques certainly, but both equally useful.

  • Comment on Re^4: How A Function Becomes Higher Order

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://494044]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.