Notes on recursion elimination
Richard S. Bird · Communications of the ACM · 1977
Various methods of recursion elimination are applied to the schematic recursive procedure: proc S ( x ); px then N ( x ); S (ƒ x ); S ( gx ); M ( x ) fi. Procedures with this general form arise in connection with tree traversal and sorting algorithms. Each method of recursion removal involves the use of one or more stacks, and the solutions are compared on the basis of their running time.
Cited by 34 works. doi:10.1145/359605.359630
Authors
References
- The Art of Computer Programming
- Structured Programming with go to Statements
- Fundamental Algorithms
- Mathematical Theory of Computation
- Comparative schematology
- Quicksort
- Introduction to Mathematical Theory of Computation
- A system which automatically improves programs
- Recursive Programming
- Translating recursion equations into flow charts