The Scheme-inspired function callCC may support this to some extent, but the R man page on this function is very sketchy. Examples have been posted by the author of callCC, so you might want to search the archives.
Dominick On Sun, Apr 17, 2011 at 1:34 AM, Mohit Dayal <ken.sen...@gmail.com> wrote: > Dear R-programmers, > > I am trying to program a Newton-Raphson in R (yes, i will try GSL, not right > now), and it would be a real boon if R had tail call elimination, so that a > recursive program has a guarantee not to fail due to stack overflows, given > how slow loops in R are. I did look at the documentation, but could not find > a reason for it. > > Regards, > Mohit Dayal > Researcher > Applied Statistics & Computing Lab > ISB > > [[alternative HTML version deleted]] > > ______________________________________________ > R-devel@r-project.org mailing list > https://stat.ethz.ch/mailman/listinfo/r-devel > ______________________________________________ R-devel@r-project.org mailing list https://stat.ethz.ch/mailman/listinfo/r-devel
