Re: Threaded Perl bytecode (was: Re: stackless python)

2000-10-23 Thread Adam Turoff
On Mon, Oct 23, 2000 at 11:03:12AM -0400, Chaim Frenkel wrote: > > "AT" == Adam Turoff <[EMAIL PROTECTED]> writes: > AT> It would also mean that if anything was overriden anywhere, no > AT> module code could be read in as bytecode, since it may need to be > AT> rethreaded to incorporate overr

Re: Threaded Perl bytecode (was: Re: stackless python)

2000-10-23 Thread Dan Sugalski
At 08:45 AM 10/23/00 -0700, Larry Wall wrote: >Adam Turoff writes: >: If Perl bytecode were to become threaded, it would be rather troublesome. > >Wasn't actually suggesting it, though similar issues also arise for >compiling down to efficient C, JVM, or C# IL. Optimizing for Least >Surprise mean

Re: Threaded Perl bytecode (was: Re: stackless python)

2000-10-23 Thread Larry Wall
Adam Turoff writes: : If Perl bytecode were to become threaded, it would be rather troublesome. Wasn't actually suggesting it, though similar issues also arise for compiling down to efficient C, JVM, or C# IL. Optimizing for Least Surprise means different things in different contexts, but I'd ha

Re: Threaded Perl bytecode (was: Re: stackless python)

2000-10-23 Thread Chaim Frenkel
> "AT" == Adam Turoff <[EMAIL PROTECTED]> writes: AT> If Perl bytecode were to become threaded, it would be rather troublesome. AT> It would probably require some attribute or early compile time AT> declaration (in main::BEGIN) to tag specific subs/builtins to be AT> overridden at runtime.