Manuel Rubio-Sánchez
J. Ángel Velázquez-Iturbide
ABSTRACT
The design of tail recursive algorithms may require thinking about iteration rather than recursion. This paper provides a methodology for deriving tail recursive functions that is based on declarative programming and the concept of function generalization, which allow to avoid iterative thinking.
- R. Sooriamurthi. Problems in comprehending recursion and suggested solutions. SIGCSE Bull. 33(3), pages 25--28. ACM, 2001. Google Scholar
Digital Library
Index Terms
- Tail recursion by using function generalization
Recommendations
Tail recursion by using function generalization
ITiCSE '09The design of tail recursive algorithms may require thinking about iteration rather than recursion. This paper provides a methodology for deriving tail recursive functions that is based on declarative programming and the concept of function ...
Tail recursive programming by applying generalization
ITiCSE '10: Proceedings of the fifteenth annual conference on Innovation and technology in computer science educationThe design of many tail recursive algorithms can involve thinking about the status of variables and parameters, and how these change with execution flow. In other words, tail recursion is closely related to iteration and imperative programming. However, ...
A Difference in Complexity Between Recursion and Tail Recursion
There are several ways to understand computability over first-order structures. We may admit functions given by arbitrary recursive definitions, or we may restrict ourselves to "iterative," or tail recursive, functions computable by nothing more ...
Comments