Determinization of Conditional Term Rewriting Systems for Program Generation

スポンサーリンク

概要

• 論文の詳細を見る

• Functional programs can be represented as deterministic conditional term rewriting systems (deterministic CTRSs, for short), where "deterministic" means that the values of extra variables of rewrite rules are determined when evaluating the conditional parts. On the other hand, non-deterministic CTRSs are also useful as a specification framework of functional programs. In this presentation, we propose a rule-based approach to transform a non-deterministic CTRS into a deterministic one that simulates rewrite sequences of the original one. For this purpose, we give several transformation rules and prove their simulation-completeness. It means the transformation rules can be used for program generation. We also show some transformation examples.

• 2011-09-22

著者

• Masahiko Sakai

  Graduate School of Information Science, Nagoya University

• Masahiko Sakai

  Graduate School Of Information Science Nagoya University

• Toshiki Sakabe

  Graduate School Of Information Science Nagoya University

• Masanori Nagashima

  Graduate School Of Information Science Nagoya University

関連論文

• Recognizability of Redexes for Higher-Order Rewrite Systems
• Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes
• Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems
• Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems
• Determinization of Conditional Term Rewriting Systems for Program Generation

スポンサーリンク