{"updated":"2025-01-22T16:47:15.267129+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00031110","sets":["1164:2386:2486:2499"]},"path":["2499"],"owner":"1","recid":"31110","title":["コンビネータとグラフ還元"],"pubdate":{"attribute_name":"公開日","attribute_value":"1988-02-12"},"_buckets":{"deposit":"bddb41b0-0a02-489a-adb5-60624dd3a212"},"_deposit":{"id":"31110","pid":{"type":"depid","value":"31110","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":"Combinators and Graph Reductions","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1988-02-12","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電子技術総合研究所ソフトウェア部言語処理研究室"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Language Processing Section, Computer Science Division, ELECTROTECHNICAL LABORATORY","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/31110/files/IPSJ-PRO87024003.pdf"},"date":[{"dateType":"Available","dateValue":"1990-02-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-PRO87024003.pdf","filesize":[{"value":"1.3 MB"}],"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":"7f93a41f-c558-437e-9bbd-5f1a67190c24","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1988 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":"Yoshio, Sugito","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":"組合せ論理の世界で演算子として登場するコンビネータは、その書き換え規則の連続的適用である還元という変換過程を通して、関数型言語プログラムの処理方式の一大勢力に寄与している。還元の実行形態としては共有構造を活用するグラフ還元が注目されている。本稿では、コンビネータおよび還元について概観したあと、組合せ論理の世界での還元系を用いて関数型言語プログラムをグラフ還元によりスタック等を用いずに”素朴に”実行する流儀を試みる。そして、この流儀を特に再帰プログラムに適用する場合を検討し、その方法と実験結果を示す。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Combinators, which behave as operators in the frame of Combinatory Logic, contribute to one of the most promising approaches for processing functional language programs by means of applying their rewriting rules successively to the programs. As for performing the transformation process, called a reduction, one of the most remarkable ones is so-called graph reduction because of its merits on sharing substructures. In this report, after reviewing briefly combinators and reductions, we try to do a way executing \"naively\" (i.e. without using any stacking mechanism) a functional language program via graph reduction in the Combinatory Logic world with the aid of a reduction system written in a graph manipulation language. And we especially concentrate out attention on applying the way to recursive programs, and show its method and the results.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"27","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告プログラミング（PRO）"}],"bibliographicPageStart":"19","bibliographicIssueDates":{"bibliographicIssueDate":"1988-02-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8(1987-PRO-024)","bibliographicVolumeNumber":"1988"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:00:32.057838+00:00","id":31110,"links":{}}