Tail recursion transformation for invertible functions

DOI10.1007/978-3-031-38100-3_6arXiv2302.10049MaRDI QIDQ6148109

Robin Kaarsgaard, Michael Kirkedal Thomsen, Joachim Tilsted Kristensen

Publication date: 11 January 2024

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.10049

zbMATH Keywords

program transformationtail recursionprogram inversionCPS transformation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Cites Work

• Unnamed Item
• The universal resolving algorithm and its correctness: Inverse computation in a functional language
• \(\mathsf{CoreFun}\): a typed functional reversible core language
• From reversible programming languages to reversible metalanguages
• Conversion to tail recursion in term rewriting
• Towards a Reversible Functional Language
• Automata Studies. (AM-34)
• Reversible Flowchart Languages and the Structured Reversible Program Theorem
• A Grammar-Based Approach to Invertible Programs
• A categorical foundation for structured reversible flowchart languages: Soundness and adequacy
• Functional and Logic Programming
• Program Inversion for Tail Recursive Functions
• Programming Languages and Systems

This page was built for publication: Tail recursion transformation for invertible functions