|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/15732
|
| タイトル: | Infinite Runs in Abstract Completion |
| 著者: | Hirokawa, Nao
Middeldorp, Aart
Sternagel, Christian
Winkler, Sarah |
| キーワード: | term rewriting
abstract completion
ordered completion
canonicity
Isabelle/HOL |
| 発行日: | 2017 |
| 出版者: | Schloss Dagstuhl |
| 誌名: | 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017) |
| 巻: | 84 |
| 開始ページ: | 19:1 |
| 終了ページ: | 19:16 |
| DOI: | 10.4230/LIPIcs.FSCD.2017.19 |
| 抄録: | Completion is one of the first and most studied techniques in term rewriting and fundamental to automated reasoning with equalities. In an earlier paper we presented a new and formalized correctness proof of abstract completion for finite runs. In this paper we extend our analysis and our formalization to infinite runs, resulting in a new proof that fair infinite runs produce complete presentations of the initial equations. We further consider ordered completion - an important extension of completion that aims to produce ground-complete presentations of the initial equations. Moreover, we revisit and extend results of Métivier concerning canonicity of rewrite systems. All proofs presented in the paper have been formalized in Isabelle/HOL. |
| Rights: | © Nao Hirokawa and Aart Middeldorp and Christian Sternagel and Sarah Winkler; licensed under Creative Commons License CC-BY. 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017). Editor: Dale Miller; Article No. 19; pp. 19:1–19:16 |
| URI: | http://hdl.handle.net/10119/15732 |
| 資料タイプ: | publisher |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 24373.pdf | | 603Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
