eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2014-07-13
27
38
10.4230/OASIcs.WPTE.2014.27
article
Inverse Unfold Problem and Its Heuristic Solving
Nagashima, Masanori
Kato, Tomofumi
Sakai, Masahiko
Nishida, Naoki
Unfold/fold transformations have been widely studied in various programming paradigms and are used in program transformations, theorem proving, and so on. This paper, by using an example, show that
restoring an one-step unfolding is not easy, i.e., a challenging task, since some rules used by unfolding may be lost. We formalize this problem by regarding one-step program transformation as a relation. Next we discuss some issues on a specific framework, called pure-constructor systems, which constitute a subclass of conditional term rewriting systems. We show that the inverse of T preserves rewrite relations if T preserves rewrite relations and the signature. We propose a heuristic procedure to solve the problem, and show its successful examples. We improve the procedure, and show examples for which the improvement takes effect.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol040-wpte2014/OASIcs.WPTE.2014.27/OASIcs.WPTE.2014.27.pdf
program transformation
unfolding
conditional term rewriting system