ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "5a985006-48bd-4560-8b6b-ebdf1254bf02"}, "_deposit": {"id": "7859", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "7859"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00007859", "sets": ["314"]}, "author_link": ["22463", "22464"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2005-03", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "3", "bibliographicPageEnd": "593", "bibliographicPageStart": "583", "bibliographicVolumeNumber": "E88-D", "bibliographic_titles": [{"bibliographic_title": "IEICE Transactions on Information and Systems", "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. In the first order case, the termination of term rewriting systems are proved by showing the non-existence of an infinite R-chain of the dependency pairs. However, the termination and the non-existence of an infinite R-chain do not coincide in the higher-order case. We introduce a new notion of dependency forest that characterize infinite reductions and infinite R-chains, and show that the termination property of higher-order rewrite systems R can be checked by showing the non-existence of an infinite R-chain, if R is strongly linear or non-nested.", "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/9579"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "IEICE", "subitem_publisher_language": "ja"}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright 2005 IEICE 許諾番号 08RB0027号", "subitem_rights_language": "ja"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0916-8532", "subitem_source_identifier_type": "PISSN"}]}, "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": "22463", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "KUSAKARI, Keiichirou", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "22464", "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": "E88-D_n3_583-593.pdf", "filesize": [{"value": "1.2 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 1200000.0, "url": {"label": "E88-D_n3_583-593.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/7859/files/E88-D_n3_583-593.pdf"}, "version_id": "2f37d12d-0177-4d07-a25a-ee376261a6c7"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "termination", "subitem_subject_scheme": "Other"}, {"subitem_subject": "dependency pair", "subitem_subject_scheme": "Other"}, {"subitem_subject": "higher-order rewite system", "subitem_subject_scheme": "Other"}, {"subitem_subject": "dependency forest", "subitem_subject_scheme": "Other"}]}, "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 Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/9579", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2008-03-10"}, "publish_date": "2008-03-10", "publish_status": "0", "recid": "7859", "relation": {}, "relation_version_is_last": true, "title": ["On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems"], "weko_shared_id": -1}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500a 雑誌掲載論文
  3. 学術雑誌

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

http://hdl.handle.net/2237/9579
http://hdl.handle.net/2237/9579
0f297dd3-fe6b-4405-ac64-8e2591dbc231
名前 / ファイル ライセンス アクション
E88-D_n3_583-593.pdf E88-D_n3_583-593.pdf (1.2 MB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2008-03-10
タイトル
タイトル On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems
言語 en
著者 SAKAI, Masahiko

× SAKAI, Masahiko

WEKO 22463

en SAKAI, Masahiko

Search repository
KUSAKARI, Keiichirou

× KUSAKARI, Keiichirou

WEKO 22464

en KUSAKARI, Keiichirou

Search repository
アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
権利
言語 ja
権利情報 Copyright 2005 IEICE 許諾番号 08RB0027号
キーワード
主題Scheme Other
主題 termination
キーワード
主題Scheme Other
主題 dependency pair
キーワード
主題Scheme Other
主題 higher-order rewite system
キーワード
主題Scheme Other
主題 dependency forest
抄録
内容記述 This paper explores how to extend the dependency pair technique for proving termination of higher-order rewrite systems. In the first order case, the termination of term rewriting systems are proved by showing the non-existence of an infinite R-chain of the dependency pairs. However, the termination and the non-existence of an infinite R-chain do not coincide in the higher-order case. We introduce a new notion of dependency forest that characterize infinite reductions and infinite R-chains, and show that the termination property of higher-order rewrite systems R can be checked by showing the non-existence of an infinite R-chain, if R is strongly linear or non-nested.
言語 en
内容記述タイプ Abstract
出版者
言語 ja
出版者 IEICE
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
出版タイプ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
ISSN
収録物識別子タイプ PISSN
収録物識別子 0916-8532
書誌情報 en : IEICE Transactions on Information and Systems

巻 E88-D, 号 3, p. 583-593, 発行日 2005-03
フォーマット
application/pdf
著者版フラグ
値 publisher
URI
識別子 http://hdl.handle.net/2237/9579
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 20:06:47.245391
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