{"created":"2021-03-01T06:26:30.684446+00:00","id":19052,"links":{},"metadata":{"_buckets":{"deposit":"1755eb2d-4559-49d2-bac7-6b996df9e7e4"},"_deposit":{"id":"19052","owners":[],"pid":{"revision_id":0,"type":"depid","value":"19052"},"status":"published"},"_oai":{"id":"oai:nagoya.repo.nii.ac.jp:00019052","sets":["312:313:314"]},"author_link":["55631","55632","55633","55634"],"item_10_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2009-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"2015","bibliographicPageStart":"2007","bibliographicVolumeNumber":"E92D","bibliographic_titles":[{"bibliographic_title":"IEICE transactions on information and systems","bibliographic_titleLang":"en"}]}]},"item_10_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful method, the static dependency pair method, which is based on the notion of strong computability, in order to prove termination in STRSs. In this paper, we extend the method to HRSs. Since HRSs include λ-abstraction but STRSs do not, we restructure the static dependency pair method to allow λ-abstraction, and show that the static dependency pair method also works well on HRSs without new restrictions.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10_identifier_60":{"attribute_name":"URI","attribute_value_mlt":[{"subitem_identifier_type":"URI","subitem_identifier_uri":"https://search.ieice.org/"},{"subitem_identifier_type":"HDL","subitem_identifier_uri":"http://hdl.handle.net/2237/21158"}]},"item_10_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"一般社団法人電子情報通信学会","subitem_publisher_language":"ja"}]},"item_10_relation_43":{"attribute_name":"関連情報","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"https://search.ieice.org/","subitem_relation_type_select":"URI"}}]},"item_10_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"(c)一般社団法人電子情報通信学会。本文データは学協会の許諾に基づきCiNiiから複製したものである","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_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":"55631","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"ISOGAI, Yasuo","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"55632","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"SAKAI, Masahiko","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"55633","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"BLANQUI, Frédéric","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"55634","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-02-21"}],"displaytype":"detail","filename":"e92-d_10_2007.pdf","filesize":[{"value":"279.7 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"e92-d_10_2007.pdf","objectType":"fulltext","url":"https://nagoya.repo.nii.ac.jp/record/19052/files/e92-d_10_2007.pdf"},"version_id":"44841d40-dfa3-4156-ba67-b78789eeaf61"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"higher-order rewrite system","subitem_subject_scheme":"Other"},{"subitem_subject":"termination","subitem_subject_scheme":"Other"},{"subitem_subject":"static dependency pair","subitem_subject_scheme":"Other"},{"subitem_subject":"plain function-passing","subitem_subject_scheme":"Other"},{"subitem_subject":"strong computability","subitem_subject_scheme":"Other"},{"subitem_subject":"subterm criterion","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":"Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems","subitem_title_language":"en"}]},"item_type_id":"10","owner":"1","path":["314"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2015-01-29"},"publish_date":"2015-01-29","publish_status":"0","recid":"19052","relation_version_is_last":true,"title":["Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-16T04:32:29.223644+00:00"}