Subject: Re: Problem with a named let. From: Erik Naggum <firstname.lastname@example.org> Date: Wed, 18 Jul 2001 20:50:33 GMT Newsgroups: comp.lang.lisp Message-ID: <email@example.com> * Tim Bradshaw <firstname.lastname@example.org> > So long as you don't mind your code blowing up in exciting ways when > you port it, I guess. Is there a portable way to determine whether you have a tail-recursive function or one that allocates a new stack frame for each recursion? Or is this intended to be a true, i.e., completely transparent, optimization that is only semi-determinable by crashes? It would be nice if there were a portably implemented at best, portably interfaced at least, function that would return the set of optimize declarations that would cause a class of function calls that are statically and portably determinable to merit tail-recursive calls. Allegro CL's features is known as compiler:tail-call-self-merge-switch and it is easy to see when it is true. #:Erik -- Travel is a meat thing.