ログイン
言語:

WEKO3

  • トップ
  • ランキング
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", "sets": ["599"]}, "author_link": ["21299", "21300"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "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", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "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_language": "en", "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": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_text_14": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Sakai, Masahiko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "21299", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Kusakari, Keiichirou", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "21300", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "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_note", "mimetype": "application/pdf", "size": 242700.0, "url": {"label": "sakai_12.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/7561/files/sakai_12.pdf"}, "version_id": "b13bda68-bb99-4c80-a7b4-7e5241b03458"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "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": "タイトル", "attribute_value_mlt": [{"subitem_title": "On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["599"], "permalink_uri": "http://hdl.handle.net/2237/9252", "pubdate": {"attribute_name": "PubDate", "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": -1}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500e 会議資料
  3. 国際会議

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

http://hdl.handle.net/2237/9252
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
言語 en
著者 Sakai, Masahiko

× Sakai, Masahiko

WEKO 21299

en Sakai, Masahiko

Search repository
Kusakari, Keiichirou

× Kusakari, Keiichirou

WEKO 21300

en Kusakari, Keiichirou

Search repository
アクセス権
アクセス権 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
戻る
0
views
See details
Views

Versions

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

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

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

Confirm


Powered by WEKO3


Powered by WEKO3