|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b11. 会議発表論文・発表資料等 >
b11-1. 会議発表論文・発表資料 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/10287
|
| タイトル: | Natural Inductive Theorems for Higher-Order Rewriting |
| 著者: | Aoto, Takahito
Yamada, Toshiyuki
Chiba, Yuki |
| キーワード: | Inductive Theorems
Higher-Order Equational Logic
Simply-Typed S- Expression Rewriting Systems
Term Rewriting Systems |
| 発行日: | 2011-04-26 |
| 出版者: | Schloss Dagstuhl |
| 誌名: | Proceedings of the 22nd International Conference on Rewriting Techniques and Applications (RTA'11) |
| 巻: | 10 |
| 開始ページ: | 107 |
| 終了ページ: | 121 |
| DOI: | 10.4230/LIPIcs.RTA.2011.107 |
| 抄録: | The notion of inductive theorems is well-established in first-order term rewriting. In higher-order term rewriting, in contrast, it is not straightforward to extend this notion because of extensionality (Meinke, 1992). When extending the term rewriting based program transformation of Chiba et al. (2005) to higher-order term rewriting, we need extensibility, a property stating that inductive theorems are preserved by adding new functions via macros. In this paper, we propose and study a new notion of inductive theorems for higher-order rewriting, natural inductive theorems. This allows to incorporate properties such as extensionality and extensibility, based on simply typed S-expression rewriting (Yamada, 2001). |
| Rights: | ⓒTakahito Aoto, Toshiyuki Yamada and Yuki Chiba; licensed under Creative Commons License NC-ND. 22nd International Conference on Rewriting Techniques and Applications. Editor: M. Schmidt-Schauß; pp. 107–121. |
| URI: | http://hdl.handle.net/10119/10287 |
| 資料タイプ: | publisher |
| 出現コレクション: | b11-1. 会議発表論文・発表資料 (Conference Papers)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 17154.pdf | | 518Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
