optimization mechanism to improve tail-recursion running time?

[OptimusPrime]

hey,
ive been reading alot about this subject and still no good mechanism was found, what do u think will improve the run-time performance of a tail recursion?
maybe creating a command that will turn a tail-recursion to a while loop?
whats your opinion?
thanks

[AndreB]

use haskell, lisp or scheme if you are really into recursion... not java :-)
why do you want to optimize recursion? it is "easy" to understand and implement and sometimes it will be faster then the iterative variant (wiki). And there are some examples that are very comlicated to formulate with iterative method not using a stack (see "See Also" examples from the wiki article) .

[OptimusPrime]

thanks,
anyone else?