Dan Sugalski <[EMAIL PROTECTED]> writes:
> At 11:45 PM +0100 4/5/02, Piers Cawley wrote:
>>So, here I am working on a Scheme interpreter in Perl 6, and I'm
>>trying to write it in a (for want of a better description)
>>'Scheme-like' fashion with lots of recursion.
>>
>>The trouble is, unless Perl
=?iso-8859-1?q?Jonathan=20E.=20Paton?= writes:
: Anything that touches string evaluation (Perl5's eval"") could harbour
: caller(), this wouldn't matter unless there was a way to proprogate
: exceptions out of an eval"" - and I bet someone already has the
: appropriate RPC written.
Well, eval pes
=?iso-8859-1?q?Jonathan=20E.=20Paton?= writes:
: > : Piers Cawley writes:
: > :
: > : So, here I am working on a Scheme interpreter in Perl 6, and I'm
: > : trying to write it in a (for want of a better description)
: > : 'Scheme-like' fashion with lots of recursion.
: > :
: > : The trouble is,
At 11:45 PM +0100 4/5/02, Piers Cawley wrote:
>So, here I am working on a Scheme interpreter in Perl 6, and I'm
>trying to write it in a (for want of a better description)
>'Scheme-like' fashion with lots of recursion.
>
>The trouble is, unless Perl6 is going to be guaranteed to do
>optimization o
> >> : Piers Cawley writes:
> >> : ...
> >> : The trouble is, unless Perl6 is going to be guaranteed to do
> >> : optimization of tail calls, this is going to lead to horribly slow
> >> : code. So, do I bite the bullet and recast some of the functions in an
> >> : iterative vein, or do I trust t
"Jonathan E. Paton" <[EMAIL PROTECTED]> writes:
>> : Piers Cawley writes:
>> :
>> : So, here I am working on a Scheme interpreter in Perl 6, and I'm
>> : trying to write it in a (for want of a better description)
>> : 'Scheme-like' fashion with lots of recursion.
>> :
>> : The trouble is, unles
> : Piers Cawley writes:
> :
> : So, here I am working on a Scheme interpreter in Perl 6, and I'm
> : trying to write it in a (for want of a better description)
> : 'Scheme-like' fashion with lots of recursion.
> :
> : The trouble is, unless Perl6 is going to be guaranteed to do
> : optimization
Piers Cawley writes:
: So, here I am working on a Scheme interpreter in Perl 6, and I'm
: trying to write it in a (for want of a better description)
: 'Scheme-like' fashion with lots of recursion.
:
: The trouble is, unless Perl6 is going to be guaranteed to do
: optimization of tail calls, this
