Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^2: Higher Order Perl

by TimToady (Parson)
on Apr 20, 2005 at 05:11 UTC ( #449486=note: print w/ replies, xml ) Need Help??


in reply to Re: Higher Order Perl
in thread Higher Order Perl

I think most of the concepts will carry across, though some of the syntax will be a little different. For example, memoization is done in Perl 6 with "is cached", but the concept is the same. Tail recursion will hopefully be better supported in Perl 6, but that should be entirely transparent. It's a little easier to write closures in Perl 6, but they work very much like Perl 5's closures. It'll be a little easier to write arrays that extend themselves via generators, but they work on the same principle. And so on...

In short, I don't think it would be a waste of your money.


Comment on Re^2: Higher Order Perl
Download Code
Re^3: Higher Order Perl
by thor (Priest) on Apr 20, 2005 at 07:31 UTC
    Coming from you, that means a lot. Thanks!

    thor

    Feel the white light, the light within
    Be your own disciple, fan the sparks of will
    For all of us waiting, your kingdom will come

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (9)
As of 2014-09-23 22:06 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (241 votes), past polls