WEKO3
アイテム
On Proving Termination of Term Rewriting Systems with Higher - Order Variables
https://ipsj.ixsq.nii.ac.jp/records/16864
https://ipsj.ixsq.nii.ac.jp/records/1686483be5b01-88b7-40bd-ab0b-84e5975e2a40
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-TPRO4207004.pdf (199.6 kB)
|
Copyright (c) 2001 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Trans(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2001-07-15 | |||||||
| タイトル | ||||||||
| タイトル | On Proving Termination of Term Rewriting Systems with Higher - Order Variables | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | On Proving Termination of Term Rewriting Systems with Higher - Order Variables | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 通常論文 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Research Institute of Electrical Communication Tohoku University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Research Institute of Electrical Communication, Tohoku University | ||||||||
| 著者名 |
Keiichirou, Kusakari
× Keiichirou, Kusakari
|
|||||||
| 著者名(英) |
Keiichirou, Kusakari
× Keiichirou, Kusakari
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | We define term rewriting systems with higher-order variables which are defined without a meta-language like the $ｴlambda$-calculus. On the other hand our systems express actual functional programming languages like ML and Haskell. In this paper we extend the recursive path order the dependency pair and the argument filtering method to our systems. In a different framework Nipkow also introduced higher-order rewriting systems (HRSs). However it is more complicated and restricted to extend the recursive path order and the dependency pair method to HRSs. Moreover the argument filtering method cannot be designed essentially in HRSs. These fact proves a usefulness of our systems. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA11464814 | |||||||
| 書誌情報 |
情報処理学会論文誌プログラミング（PRO） 巻 42, 号 SIG07(PRO11), p. 35-45, 発行日 2001-07-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7802 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
