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 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 that Perl6 will do tail call optimization?
Larry?
--
Piers
"It is a truth universally acknowledged that a language in
possession of a rich syntax must be in need of a rewrite."
-- Jane Austen?
