WEKO3
アイテム
On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
http://hdl.handle.net/2237/9252
http://hdl.handle.net/2237/92527339b39c-01b3-447d-ac7e-8f139f5ca598
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2008-01-07 | |||||
タイトル | ||||||
タイトル | On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems | |||||
言語 | en | |||||
著者 |
Sakai, Masahiko
× Sakai, Masahiko× Kusakari, Keiichirou |
|||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
抄録 | ||||||
内容記述 | This paper explores how to extend the dependency pair technique for proving termination of higher-order rewrite systems. We introduced a new notion of dependency forest and show that the termination property of higher-order rewrite systems R can be checked by the non-existence of an infinite R-chain, if R is non-duplicating or non-nested. One benefit is we can exclude any term whose top symbol is higher order variable from the second item of dependency pair. | |||||
言語 | en | |||||
内容記述タイプ | Abstract | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプresource | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
出版タイプ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
書誌情報 |
en : The International Workshop on Rewriting in Proof and Computation p. 176-187, 発行日 2001-10 |
|||||
フォーマット | ||||||
application/pdf | ||||||
著者版フラグ | ||||||
値 | publisher | |||||
URI | ||||||
識別子 | http://hdl.handle.net/2237/9252 | |||||
識別子タイプ | HDL |