ログイン
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "78ef501d-63b1-44af-8c06-36f6c36dc7e5"}, "_deposit": {"id": "13078", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "13078"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00013078", "sets": ["314"]}, "author_link": ["41160"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2004-02-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "2", "bibliographicPageEnd": "359", "bibliographicPageStart": "352", "bibliographicVolumeNumber": "E87-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": "Simply-typed term rewriting systems (STRSs) are an extension of term rewriting systems. STRSs can be naturally handle higher order functions, which are widely used in existing functional programming languages. In this paper we design recursive and lexicographic path orders, which can efficiently prove the termination of STRSs. Moreover we discuss an application to the dependency pair and the argument filtering methods, which are very effective and efficient support methods for proving termination.", "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/14973"}, {"subitem_identifier_type": "URI", "subitem_identifier_uri": "http://www.ieice.org/jpn/trans_online/index.html"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Institute of Electronics, Information and Communication Engineers", "subitem_publisher_language": "en"}]}, "item_10_relation_43": {"attribute_name": "関連情報", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://www.ieice.org/jpn/trans_online/index.html", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright (C) 2004 IEICE", "subitem_rights_language": "en"}]}, "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_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": "KUSAKARI, Keiichirou", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "41160", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "400.pdf", "filesize": [{"value": "208.9 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 208900.0, "url": {"label": "400.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/13078/files/400.pdf"}, "version_id": "ed13d92b-2f31-46cd-884a-6f2473a41ac2"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "simply-typed term rewriting system", "subitem_subject_scheme": "Other"}, {"subitem_subject": "termination", "subitem_subject_scheme": "Other"}, {"subitem_subject": "path order", "subitem_subject_scheme": "Other"}, {"subitem_subject": "computability", "subitem_subject_scheme": "Other"}, {"subitem_subject": "dependency pair", "subitem_subject_scheme": "Other"}, {"subitem_subject": "argument filtering method", "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": "Higher-Order Path Orders Based on Computability", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Higher-Order Path Orders Based on Computability", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/14973", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2011-06-29"}, "publish_date": "2011-06-29", "publish_status": "0", "recid": "13078", "relation": {}, "relation_version_is_last": true, "title": ["Higher-Order Path Orders Based on Computability"], "weko_shared_id": -1}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500a 雑誌掲載論文
  3. 学術雑誌

Higher-Order Path Orders Based on Computability

http://hdl.handle.net/2237/14973
http://hdl.handle.net/2237/14973
8ca3a82a-808c-4314-b27b-11f8e31bb792
名前 / ファイル ライセンス アクション
400.pdf 400.pdf (208.9 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2011-06-29
タイトル
タイトル Higher-Order Path Orders Based on Computability
言語 en
著者 KUSAKARI, Keiichirou

× KUSAKARI, Keiichirou

WEKO 41160

en KUSAKARI, Keiichirou

Search repository
アクセス権
アクセス権 open access
アクセス権URI http://purl.org/coar/access_right/c_abf2
権利
言語 en
権利情報 Copyright (C) 2004 IEICE
キーワード
主題Scheme Other
主題 simply-typed term rewriting system
キーワード
主題Scheme Other
主題 termination
キーワード
主題Scheme Other
主題 path order
キーワード
主題Scheme Other
主題 computability
キーワード
主題Scheme Other
主題 dependency pair
キーワード
主題Scheme Other
主題 argument filtering method
抄録
内容記述 Simply-typed term rewriting systems (STRSs) are an extension of term rewriting systems. STRSs can be naturally handle higher order functions, which are widely used in existing functional programming languages. In this paper we design recursive and lexicographic path orders, which can efficiently prove the termination of STRSs. Moreover we discuss an application to the dependency pair and the argument filtering methods, which are very effective and efficient support methods for proving termination.
言語 en
内容記述タイプ Abstract
出版者
言語 en
出版者 Institute of Electronics, Information and Communication Engineers
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
出版タイプ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
関連情報
関連タイプ isVersionOf
識別子タイプ URI
関連識別子 http://www.ieice.org/jpn/trans_online/index.html
ISSN
収録物識別子タイプ PISSN
収録物識別子 0916-8532
書誌情報 en : IEICE transactions on information and systems

巻 E87-D, 号 2, p. 352-359, 発行日 2004-02-01
著者版フラグ
値 publisher
URI
識別子 http://hdl.handle.net/2237/14973
識別子タイプ HDL
URI
識別子 http://www.ieice.org/jpn/trans_online/index.html
識別子タイプ URI
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 18:39:41.402315
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