in reply to Re: Perl6 and Extreme Programming
in thread Perl6 and Extreme Programming

Higher-order functions sound much more like functional programming (lambda calculus) than extreme programming (do only the important things all of the time).

I'd expect an answer more like, "It will be much easier to write a refactoring engine in Perl 6 -- and here's why.

Replies are listed 'Best First'.
Re: Re: Re: Perl6 and Extreme Programming
by TheDamian (Vicar) on May 25, 2002 at 22:32 UTC
    It will be much easier to write a refactoring engine in Perl 6 -- and here's why...

    You'll be able to grab the parse-tree from the compiler before it's converted to op-codes. Or after it's been converted, but before it's been reduced, if you prefer. Once you have a structured representation of the code, refactoring is "merely" the application of standard mathematical tree/graph factoring and optimization techniques.

[reply]
      Or even after it's been reduced, if you really want. :)

      Courtesy of the Ruby folk, I've been getting some exposure to some of the niftier bits of Smalltalk, including the browser setups they have. I really, really want some of that for Parrot and hence perl 6.

[reply]

In Section Meditations