Tail recursion by using function generalization
ITiCSE '09 Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education, pp. 394-394, 2009.
declarative programmingtail recursiongeneralizationrecursionrecursive algorithm
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.
Full Text (Upload PDF)
PPT (Upload PPT)