A Grammar-Based Approach to Invertible Programs

DOI10.1007/978-3-642-11957-6_24zbMath1260.68106OpenAlexW2136677980MaRDI QIDQ3558241

Kazutaka Matsuda, Shin-Cheng Mu, Masato Takeichi, Zhenjiang Hu

Publication date: 4 May 2010

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11957-6_24

Mathematics Subject Classification ID

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

Related Items (5)

Tail recursion transformation for invertible functions ⋮ \textsc{Synbit}: synthesizing bidirectional programs using unidirectional sketches ⋮ Manipulating accumulative functions by swapping call-time and return-time computations ⋮ Determinization of inverted grammar programs via context-free expressions ⋮ Polynomial-time inverse computation for accumulative functions with multiple data traversals

Uses Software

• XDuce

This page was built for publication: A Grammar-Based Approach to Invertible Programs