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

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.

Replies are listed 'Best First'.
Re^3: Higher Order Perl
by thor (Priest) on Apr 20, 2005 at 07:31 UTC
    Coming from you, that means a lot. Thanks!


    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?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://449486]
[Corion]: Hi marto!
[Corion]: I just found out that in $current_top_prior ity_project , the part I am in is not even in the top three worries. That's somewhat bad, not because I'm happy with being a top worry but because that means that I don't even know how bad the rest ...
[Corion]: ... of the situation is :-)
[marto]: it's good to know that things can always get worse :P
[hippo]: Ignorance can be bliss

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (9)
As of 2017-07-26 08:11 GMT
Find Nodes?
    Voting Booth?
    I came, I saw, I ...

    Results (385 votes). Check out past polls.