|Re: tail recursion, common sub-expressions, Sisa email@example.com (1994-10-12)|
|Re: tail recursion, common sub-expressions, Sisa firstname.lastname@example.org (1994-10-14)|
|From:||email@example.com (Bruno Ginoux)|
|Organization:||Electricite de France, Etudes et Recherches|
|Date:||Wed, 12 Oct 1994 10:22:21 GMT|
I can give you some information about your first query.
The basic article about tail recursion elimination is:
-McCarthy J. 1960: Recursive functions of symbolic expressions and
their computation by machine. ACM 3,4. April. pp 184,195.
You will also find a lot of things in :
- Burstall and Darlington 1976: A system which automatically improves
programs. Acta informatica 6. pp 41,60.
- Burstall and Darlington 1977: A transformation system for
developing recursive programs. J. ACM 24,1. January. pp44,67.
More recently, the problem of recursion removal has been described in
the book of Hemut Partsch: Specification and Transformation of
programs. Springer-Verlag. 1990.
I hope this will help.
bruno Ginoux (firstname.lastname@example.org)
Electricite de France, Etudes et Recherches
Return to the
Search the comp.compilers archives again.