Determinization of Conditional Term Rewriting Systems for Program Generation

• 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.

収録刊行物

• 情報処理学会論文誌プログラミング（PRO）

  情報処理学会論文誌プログラミング（PRO） 4 (4), 42-42, 2011-09-22

キーワード

• 発表概要

詳細情報

• CRID: 1050564287854103936
• NII論文ID: 110008616711
• NII書誌ID: AA11464814
• ISSN: 18827802
• Web Site: http://id.nii.ac.jp/1001/00077598/
• 本文言語コード: en
• 資料種別: article
• データソース種別:
  • IRDB
  • CiNii Articles