Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: How A Function Becomes Higher Order

by jkva (Chaplain)
on Sep 16, 2005 at 17:09 UTC ( #492680=note: print w/ replies, xml ) Need Help??


in reply to How A Function Becomes Higher Order

Brilliant. Simply brilliant.

This has propelled me into a flurry of thoughts about the things I can do with Perl. Higher Order indeed.
The code is here and there somewhat complicated but the added comments have clarified it somewhat and confirmed suspected code meanings.
It explains a way of using flexibility in your code - I'm not too good in explaining this I'm afraid. But it's one of those reads that make you 'get' things. At least for me.

I'm looking forward to the sequel - maybe a tutorial explaining callbacks, closures and factories? Or who knows, self-modifying code ;)


Comment on Re: How A Function Becomes Higher Order

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (8)
As of 2015-07-07 10:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (88 votes), past polls