Xref: utzoo gnu.emacs.lisp.manual:92 comp.emacs:6582
Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!ukma!tut.cis.ohio-state.edu!pt.cs.cmu.edu!f.gp.cs.cmu.edu!mleone
From: mleone@f.gp.cs.cmu.edu (Mark Leone)
Newsgroups: gnu.emacs.lisp.manual,comp.emacs
Subject: Tail recursion in elisp
Message-ID: <5724@pt.cs.cmu.edu>
Date: 1 Aug 89 21:25:50 GMT
Distribution: usa
Organization: Carnegie-Mellon University, CS/RI
Lines: 11


Does gnu-emacs lisp deal with tail recursion in a reasonable way?  In
particular, is it possible for a tail recursive function to cause a
stack overflow?  

How does the speed of a tail recursive function compare to a
corresponding iterative function?


Mark Leone
mleone@f.gp.cs.cmu.edu