🚀 go-pugleaf

>>>>> "Shriram" == Shriram Krishnamurthi <shriram@cs.rice.edu> writes:

Shriram> Tom Christiansen <tchrist@mox.perl.com> writes:
>> If you write a fibonacci program, full of deeply nested subroutine
>> calls, than scheme will run faster -- because perl hasn't optimized
>> the argument call stack yet.  But for many other things it's plenty
>> fast.  Don't listen to this "Perl is 10x slower than Scheme" drivel,
>> because it's simply not true.

Shriram> Perl and Scheme are *languages*.  It is virtually nonsensical
Shriram> to speak of one *language* to be faster than another.

Shriram> Mind you, I'm not directing this to you alone, but also to
Shriram> the people defending the Scheme (or any other) standpoint.

I agree that there needs to be less of this "Perl vs Scheme"
speed-test stuff.  The real answer is "it just depends".

But I also don't think that Perl is really a language.  That is, Perl
is a language and an implementation.  As I understand it, the language
is defined by the sole implementation.

Tom
--
tromey@cns.caltech.edu                Member, League for Programming Freedom
"Sadism and farce are always inexplicably linked"
	-- Alexander Theroux