http://swrc.ontoware.org/ontology#Article
Determinization of Conditional Term Rewriting Systems for Program Generation
en
発表概要
Graduate School of Information Science, Nagoya University
Graduate School of Information Science, Nagoya University
Graduate School of Information Science, Nagoya University
Masanori Nagashima
Masahiko Sakai
Toshiki Sakabe
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.
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.
AA11464814
情報処理学会論文誌プログラミング（PRO）
4
4
42-42
2011-09-22
1882-7802