RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación
Artículo científico (JournalArticle)
Conversion to Tail Recursion in Term Rewriting
Tail recursive functions are a special kind of recursive functions where the last action in
their body is the recursive call. Tail recursion is important for a number of reasons (e.g.,
they are usually more efficient). In this article, we introduce an automatic transformation
of first-order functions into tail recursive form. Functions are defined using a (first-order)
term rewrite system. We prove the correctness of the transformation for constructor-based
reduction over constructor systems (i.e., typical first-order functional programs).
© 2013 Elsevier Inc. All rights reserved, This work has been partially supported by the Spanish Ministerio de Ciencia e Innovacion (Secretaria de Estado de Investigation) under grant TIN2008-06622-C03-02, by the Generalitat Valenciana under grant PROMETEO/2011/052, and by MEXT KAKENHI #21700011.