{"created":"2025-01-18T22:49:50.764398+00:00","updated":"2025-01-22T23:46:05.062064+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00016626","sets":["934:935:954:957"]},"path":["957"],"owner":"1","recid":"16626","title":["項書き換えシステムにおける可簡約演算子とその応用"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-04-15"},"_buckets":{"deposit":"3646f96c-05a0-4bc7-a4f5-40226ce26688"},"_deposit":{"id":"16626","pid":{"type":"depid","value":"16626","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"項書き換えシステムにおける可簡約演算子とその応用","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"項書き換えシステムにおける可簡約演算子とその応用"},{"subitem_title":"Reducible Operation Symbols for the Term Rewriting System and Their Applications","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"通常論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2005-04-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"北陸先端科学技術大学院大学"},{"subitem_text_value":"北陸先端科学技術大学院大学 NEC ソフトウェア北陸"},{"subitem_text_value":"北陸先端科学技術大学院大学"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Japan Advanced Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Japan Advanced Institute of Science and Technology,NEC Software Hokuriku, Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Japan Advanced Institute of Science and Technology","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/16626/files/IPSJ-TPRO4606005.pdf"},"date":[{"dateType":"Available","dateValue":"2007-04-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TPRO4606005.pdf","filesize":[{"value":"227.6 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":"3f26c759-8b96-424c-b8e2-34cb57501df4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"中村, 正樹"},{"creatorName":"緒方, 和博"},{"creatorName":"二木, 厚吉"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masaki, Nakamura","creatorNameLang":"en"},{"creatorName":"Kazuhiro, Ogata","creatorNameLang":"en"},{"creatorName":"Kokichi, Futatsugi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464814","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7802","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"項書き換えシステムにおける演算子は，その意味から関数としての役割を持つ演算子と台集合の要素を構成する構成子としての演算子の2 つに分けられる．このとき項書き換えシステムには，任意の正規形が構成子からのみなるという性質が期待される．我々はそのような性質を持つ演算子として可簡約演算子の概念を提案する．すなわち可簡約演算子を含む任意の項は正規形ではない．通常の項，基底項（変数を含まない項），あるソートに属する項をそれぞれ簡約対象とした場合の可簡約演算子の定義を与え，その性質を示す．これらの可簡約演算子は，単に演算子が正規形に現れないという性質を持つのみでなく，効率的な書き換え関係を得る助けにもなる．また代数仕様への応用として，振舞仕様における重要な性質であるコヒーレント性の十分条件を与える．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In a term rewriting system, operation symbols can be classified into two divisions from its denotational semantics: the operation symbols as functions and the operation symbols as constructors. Each term constructed by constructors corresponds to an element of the carrier set. Then the term rewriting system is expected to have the property that each normal form is constructed by only constructors. We propose the notion of the reducible operation symbols as any term having a reducible function symbol is not a normalform. We discuss about reducible operation symbols for ordinary terms, ground terms and terms of some sorts. Not only the reducible operation symbol has the property that it does not appear in each normal form but also it gives us an efficient rewrite relation. Moreover as an application to algebraic specifications we show a sufficient condition for the behavioral coherence, which is one of the most important properties of the behavioral specification.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"59","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌プログラミング（PRO）"}],"bibliographicPageStart":"47","bibliographicIssueDates":{"bibliographicIssueDate":"2005-04-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG6(PRO25)","bibliographicVolumeNumber":"46"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":16626,"links":{}}