Program Inversion for Tail Recursive Functions

DOI10.4230/LIPIcs.RTA.2011.283zbMath1236.68144OpenAlexW2113926649MaRDI QIDQ5389087

Naoki Nishida, Germán Vidal

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_9cb1.html

zbMATH Keywords

program transformationterminationterm rewriting

Mathematics Subject Classification ID

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

Related Items (10)

Determinization of conditional term rewriting systems ⋮ Semi-inversion of Conditional Constructor Term Rewriting Systems ⋮ Reversible computation in term rewriting ⋮ Tail recursion transformation for invertible functions ⋮ \textsc{Synbit}: synthesizing bidirectional programs using unidirectional sketches ⋮ Conversion to tail recursion in term rewriting ⋮ Inverse Unfold Problem and Its Heuristic Solving ⋮ Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems ⋮ Determinization of inverted grammar programs via context-free expressions ⋮ Polynomial-time inverse computation for accumulative functions with multiple data traversals

Uses Software

• VMTL
• InvX

This page was built for publication: Program Inversion for Tail Recursive Functions