Nishida, N.; Vidal Oriola, GF. (2014). Conversion to Tail Recursion in Term Rewriting. Journal of Logic and Algebraic Programming. 83(1):53-63. https://doi.org/10.1016/j.jlap.2013.07.001
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/47195
Title:
|
Conversion to Tail Recursion in Term Rewriting
|
Author:
|
Nishida, Naoki
Vidal Oriola, Germán Francisco
|
UPV Unit:
|
Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
|
Issued date:
|
|
Abstract:
|
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). ...[+]
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
[-]
|
Subjects:
|
Term rewriting
,
Program transformation
,
Tail recursion
|
Copyrigths:
|
Reserva de todos los derechos
|
Source:
|
Journal of Logic and Algebraic Programming. (issn:
1567-8326
)
|
DOI:
|
10.1016/j.jlap.2013.07.001
|
Publisher:
|
Elsevier
|
Publisher version:
|
http://dx.doi.org/10.1016/j.jlap.2013.07.001
|
Project ID:
|
info:eu-repo/grantAgreement/MICINN//TIN2008-06622-C03-02/ES/VERIFICACION Y DEPURACION AGILES ORIENTADAS A MEJORAR LA SEGURIDAD DEL SOFTWARE/
info:eu-repo/grantAgreement/GVA//PROMETEO%2F2011%2F052/ES/LOGICEXTREME: TECNOLOGIA LOGICA Y SOFTWARE SEGURO/
info:eu-repo/grantAgreement/MEXT//21700011/
|
Description:
|
NOTICE: this is the author’s version of a work that was accepted for publication in "Journal of Logic and Algebraic Programming". Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of Logic and Algebraic Programming , vol. 83 issue 1, 2014 DOI 10.1016/j.jlap.2013.07.001
|
Thanks:
|
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, ...[+]
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.
[-]
|
Type:
|
Artículo
|