WEKO3
アイテム
{"_buckets": {"deposit": "7affc22b-14ba-45ea-9130-e2e4d09b691a"}, "_deposit": {"id": "7557", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "7557"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00007557", "sets": ["599"]}, "author_link": ["21289", "21290", "21291"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2003-06", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "88", "bibliographicPageStart": "79", "bibliographic_titles": [{"bibliographic_title": "Proceedings of 3rd International Workshop on Reduction Strategies in Rewriting and Programming", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "A strategy of TRSs is said to be complete if all normal forms of a given term are reachable from the term. We show the innermost strategy is complete for terminating, right-linear and overlay TRSs. This strategy is fairly efficient to calculate all normal forms of a given term by searching reduction trees. We also discuss the possibilities for weakening the conditions.", "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/9248"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Elsevier", "subitem_publisher_language": "en"}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "This is the author\u0027s version of a work accepted for publication by Elsevier. Changes resulting from the publishing process, including peer review, editing, corrections, structural formatting and other quality control mechanisms, may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic Notes in Theoretical Computer Science, [VOL 86, ISSUE 4], 2003.", "subitem_rights_language": "en"}]}, "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": "21289", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Okamoto, Kouji", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "21290", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakabe, Toshiki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "21291", "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_9.pdf", "filesize": [{"value": "191.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 191700.0, "url": {"label": "sakai_9.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/7557/files/sakai_9.pdf"}, "version_id": "b61dd2e2-a97f-4a27-bade-406a311e86b4"}]}, "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": "Innermost Reductions Find All Normal Forms on Right-Linear Terminating Overlay TRSs", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Innermost Reductions Find All Normal Forms on Right-Linear Terminating Overlay TRSs", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["599"], "permalink_uri": "http://hdl.handle.net/2237/9248", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2008-01-07"}, "publish_date": "2008-01-07", "publish_status": "0", "recid": "7557", "relation": {}, "relation_version_is_last": true, "title": ["Innermost Reductions Find All Normal Forms on Right-Linear Terminating Overlay TRSs"], "weko_shared_id": -1}
Innermost Reductions Find All Normal Forms on Right-Linear Terminating Overlay TRSs
http://hdl.handle.net/2237/9248
http://hdl.handle.net/2237/9248cb397580-0f64-4afe-a0f3-c6baa76177ca
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2008-01-07 | |||||
タイトル | ||||||
タイトル | Innermost Reductions Find All Normal Forms on Right-Linear Terminating Overlay TRSs | |||||
言語 | en | |||||
著者 |
Sakai, Masahiko
× Sakai, Masahiko× Okamoto, Kouji× Sakabe, Toshiki |
|||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
権利 | ||||||
言語 | en | |||||
権利情報 | This is the author's version of a work accepted for publication by Elsevier. Changes resulting from the publishing process, including peer review, editing, corrections, structural formatting and other quality control mechanisms, may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic Notes in Theoretical Computer Science, [VOL 86, ISSUE 4], 2003. | |||||
抄録 | ||||||
内容記述 | A strategy of TRSs is said to be complete if all normal forms of a given term are reachable from the term. We show the innermost strategy is complete for terminating, right-linear and overlay TRSs. This strategy is fairly efficient to calculate all normal forms of a given term by searching reduction trees. We also discuss the possibilities for weakening the conditions. | |||||
言語 | en | |||||
内容記述タイプ | Abstract | |||||
出版者 | ||||||
言語 | en | |||||
出版者 | Elsevier | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプresource | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
出版タイプ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
書誌情報 |
en : Proceedings of 3rd International Workshop on Reduction Strategies in Rewriting and Programming p. 79-88, 発行日 2003-06 |
|||||
フォーマット | ||||||
application/pdf | ||||||
著者版フラグ | ||||||
値 | publisher | |||||
URI | ||||||
識別子 | http://hdl.handle.net/2237/9248 | |||||
識別子タイプ | HDL |