Conversion to tail recursion in term rewriting

DOI10.1016/j.jlap.2013.07.001zbMath1283.68128OpenAlexW2109683171MaRDI QIDQ2436518

Naoki Nishida, Germán Vidal

Publication date: 25 February 2014

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2013.07.001

zbMATH Keywords

program transformationterm rewritingtail recursion

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Tail recursion transformation for invertible functions

Cites Work

• Unnamed Item
• Unnamed Item
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Fast narrowing-driven partial evaluation for inductively sequential programs
• Automated termination proofs for logic programs by term rewriting
• Continuation-Based Program Transformation Strategies
• Program Inversion for Tail Recursive Functions
• The narrowing-driven approach to functional logic program specialization

This page was built for publication: Conversion to tail recursion in term rewriting