ログイン
言語:

WEKO3

  • トップ
  • コミュニティ
  • ランキング
AND
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "ff3c2170-d766-4830-9c96-0e0ee6fa02ad"}, "_deposit": {"id": "7561", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "7561"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00007561"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2001-10", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "187", "bibliographicPageStart": "176", "bibliographic_titles": [{"bibliographic_title": "The International Workshop on Rewriting in Proof and Computation"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "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.", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/9252"}]}, "item_10_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_text_14": {"attribute_name": "\u30d5\u30a9\u30fc\u30de\u30c3\u30c8", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Sakai, Masahiko"}], "nameIdentifiers": [{"nameIdentifier": "21299", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Kusakari, Keiichirou"}], "nameIdentifiers": [{"nameIdentifier": "21300", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-19"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "sakai_12.pdf", "filesize": [{"value": "242.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 242700.0, "url": {"label": "sakai_12.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/7561/files/sakai_12.pdf"}, "version_id": "b13bda68-bb99-4c80-a7b4-7e5241b03458"}]}, "item_language": {"attribute_name": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems"}]}, "item_type_id": "10", "owner": "1", "path": ["312/598/599"], "permalink_uri": "http://hdl.handle.net/2237/9252", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2008-01-07"}, "publish_date": "2008-01-07", "publish_status": "0", "recid": "7561", "relation": {}, "relation_version_is_last": true, "title": ["On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems"], "weko_shared_id": null}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500e 会議資料
  3. 国際会議

On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems

http://hdl.handle.net/2237/9252
7339b39c-01b3-447d-ac7e-8f139f5ca598
名前 / ファイル ライセンス アクション
sakai_12.pdf sakai_12.pdf (242.7 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2008-01-07
タイトル
タイトル On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
著者 Sakai, Masahiko

× Sakai, Masahiko

WEKO 21299

Sakai, Masahiko

Search repository
Kusakari, Keiichirou

× Kusakari, Keiichirou

WEKO 21300

Kusakari, Keiichirou

Search repository
抄録
内容記述 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.
内容記述タイプ Abstract
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
書誌情報 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
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 20:09:56.850216
Show All versions

Share

Mendeley CiteULike Twitter Facebook Print Addthis

Cite as

Export

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by CERN Data Centre & Invenio


Powered by CERN Data Centre & Invenio