Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| [Q:] tail calls and parameter passing reig@dcs.gla.ac.uk (Fermin Reig) (1998-11-19) |
| Re: [Q:] tail calls and parameter passing gary@wheel.tiac.net (1998-11-21) |
| Re: [Q:] tail calls and parameter passing ramsdell@linus.mitre.org (John D. Ramsdell) (1998-11-21) |
| Re: [Q:] tail calls and parameter passing monnier+comp/compilers/news/@tequila.cs.yale.edu (Stefan Monnier) (1998-11-24) |
| Re: [Q:] tail calls and parameter passing bijuthom@ibm.net (Biju Thomas) (1998-11-24) |
| From: | "John D. Ramsdell" <ramsdell@linus.mitre.org> |
| Newsgroups: | comp.compilers |
| Date: | 21 Nov 1998 12:05:23 -0500 |
| Organization: | The MITRE Corporation |
| References: | 98-11-090 |
| Keywords: | optimize |
I do not have a reference on tail call optimizations, however, I have
enclosed a reference to a paper which gives a technique for producing
properly tail recursive implementations of programming languages. For
some languages such as Scheme, treating tail calls specially is not an
optional optimization, but a correctness requirement. In addition to
looking at the referenced paper, I suggest you search using the
keywords "properly tail recursive".
http://www.neci.nj.nec.com/homepages/kelsey/
John
Return to the
comp.compilers page.
Search the
comp.compilers archives again.