{"created":"2025-01-18T22:59:55.416198+00:00","updated":"2025-01-22T17:08:30.951805+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00030285","sets":["1164:2386:2397:2398"]},"path":["2398"],"owner":"1","recid":"30285","title":["逐次性v.s.ストリクト性　－非線形項書換え系の最適戦略にむけて－　（コンパイル技術および一般）"],"pubdate":{"attribute_name":"公開日","attribute_value":"1996-10-31"},"_buckets":{"deposit":"a0485fa6-746b-42c6-b398-972610a6c0b4"},"_deposit":{"id":"30285","pid":{"type":"depid","value":"30285","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"逐次性v.s.ストリクト性　－非線形項書換え系の最適戦略にむけて－　（コンパイル技術および一般）","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"逐次性v.s.ストリクト性　－非線形項書換え系の最適戦略にむけて－　（コンパイル技術および一般）"},{"subitem_title":"Sequentiality v.s. Strictness Towards an optimal strategy for nonlinear TRSs","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1996-10-31","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTT基礎研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Basic Research laboratories","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/30285/files/IPSJ-PRO96010012.pdf"},"date":[{"dateType":"Available","dateValue":"1998-10-31"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-PRO96010012.pdf","filesize":[{"value":"565.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"b9ef0c57-fe6b-4641-976c-83b6da2683af","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1996 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小川, 瑞史"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Mizuhito, Ogawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10485570","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本稿では，メンバーシップ条件付き非線形項書換え系の最適書換え戦略について，逐次性とストリクト性の観点力から考察し，その二つを比較する．(）逐次性については，正規形の集合によるメンバーシップ条件付き項書換え系が，・制限付き非線形かつ無曖昧ならば，正規形でない項は必須リデックスを持つ．・制限付き非線形ならばNV?逐次性は決定可能であり，さらに無曖昧ならば指標書換え戦略は計算可能である．を示す．(）ストリクト性については，構成子基底の集合によるメンバーシップ条件付き構成子項書換え系が，・制限付き非線形かつ無曖昧ならば，正規形でない項はストリクトリデックスを持つ．を示し，さらに項書換え系に対するストリクト性解析を新たに提案する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper investigates an optimal reduction strategy for a nonlinear term rewriting system (TRS) from sequentiality and strictness viewpoints, and these two are compared. Main results are: (1) For a TRS with membership conditions wrt normal forms, ・if restricted-nonlinear and nonoverlapping, a term not in normal forms has a needed redex. ・ if restricted-nonlinear, NV-suquentiality is decidable. Furthermore, if restricted-nonlinear and nonoverlapping, the index reduction is computable. (2) For a TRS with membership conditions wrt ground constructor terms, ・ If restricted-nonlinear and nonoverlapping, a term not in normal forms has a strict redex. ・ Strictness analysis in the reduction framework is newly proposed.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"72","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告プログラミング（PRO）"}],"bibliographicPageStart":"67","bibliographicIssueDates":{"bibliographicIssueDate":"1996-10-31","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"107(1996-PRO-010)","bibliographicVolumeNumber":"1996"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":30285,"links":{}}