Mostrar el registro sencillo del ítem
dc.contributor.author | Nishida, Naoki | es_ES |
dc.contributor.author | Vidal Oriola, Germán Francisco | es_ES |
dc.date.accessioned | 2015-02-17T12:42:33Z | |
dc.date.available | 2015-02-17T12:42:33Z | |
dc.date.issued | 2014-01 | |
dc.identifier.issn | 1567-8326 | |
dc.identifier.uri | http://hdl.handle.net/10251/47195 | |
dc.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 | es_ES |
dc.description.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). 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 | es_ES |
dc.description.sponsorship | 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. | en_EN |
dc.language | Inglés | es_ES |
dc.publisher | Elsevier | es_ES |
dc.relation.ispartof | Journal of Logic and Algebraic Programming | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | Term rewriting | es_ES |
dc.subject | Program transformation | es_ES |
dc.subject | Tail recursion | es_ES |
dc.subject.classification | LENGUAJES Y SISTEMAS INFORMATICOS | es_ES |
dc.title | Conversion to Tail Recursion in Term Rewriting | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1016/j.jlap.2013.07.001 | |
dc.relation.projectID | info:eu-repo/grantAgreement/MICINN//TIN2008-06622-C03-02/ES/VERIFICACION Y DEPURACION AGILES ORIENTADAS A MEJORAR LA SEGURIDAD DEL SOFTWARE/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/GVA//PROMETEO%2F2011%2F052/ES/LOGICEXTREME: TECNOLOGIA LOGICA Y SOFTWARE SEGURO/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/MEXT//21700011/ | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació | es_ES |
dc.description.bibliographicCitation | 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 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | http://dx.doi.org/10.1016/j.jlap.2013.07.001 | es_ES |
dc.description.upvformatpinicio | 53 | es_ES |
dc.description.upvformatpfin | 63 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 83 | es_ES |
dc.description.issue | 1 | es_ES |
dc.relation.senia | 279289 | |
dc.contributor.funder | Ministerio de Ciencia e Innovación | es_ES |
dc.contributor.funder | Generalitat Valenciana | es_ES |
dc.contributor.funder | Ministry of Education, Culture, Sports, Science and Technology, Japón | es_ES |