{"created":"2025-01-18T22:47:45.058123+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00013744","sets":["581:742:754"]},"path":["754"],"owner":"11","recid":"13744","title":["無制限の寿命を持つ単一呼出継続"],"pubdate":{"attribute_name":"公開日","attribute_value":"1996-01-15"},"_buckets":{"deposit":"df2644b5-7342-47ae-bfcf-dae63ffc9664"},"_deposit":{"id":"13744","pid":{"type":"depid","value":"13744","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"無制限の寿命を持つ単一呼出継続","author_link":["361565","361568","361566","361567"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"無制限の寿命を持つ単一呼出継続"},{"subitem_title":"Indefinite One - time Continuation","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文（論文賞受賞）","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1996-01-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"豊橋技術科学大学情報工学系"},{"subitem_text_value":"豊橋技術科学大学情報工学系"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Informartion and Computer Sciences, Toyohashi University of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Informartion and Computer Sciences, Toyohashi University of Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/13744/files/IPSJ-JNL3701010.pdf","label":"IPSJ-JNL3701010"},"date":[{"dateType":"Available","dateValue":"1998-01-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL3701010.pdf","filesize":[{"value":"943.2 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f48a8692-33c4-4197-a115-be71bd24a712","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1996 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小宮, 常康"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"湯淺, 太一"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tsuneyasu, Komiya","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Taiichi, Yuasa","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","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_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"継続とはある時点以降の残りの計算を表したものである。Lispの一方言であるSchemeでは、継続を生成する関数が用意されており、継続をデータとして扱うことができる。これによって、非局所的脱出やコルーチン、マルチタスクなど様々な制御構造を実現することができる。スタックを用いた標準的なScheme処理系ではスタックの内容をヒープに退避することによって継続を生成し、呼び出し時にはそれをスタックに復元する。そのため、継続の生成と呼び出しの処理は重い。そこで本論文では、ほとんどの継続の便用法において、その呼び出しは一度に限られることに注目し、呼び出しは一度に限るが、いつどこからでも呼び出すことができる継続を提案する。この継続を用いることにより、継続を用いて実現されるほとんどのプログラムに対して、性能を改善することができる。","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A continuation represents the rest of computation from a given point. Scheme, a dialect of Lisp, provides a function to generate a continuation as a first-class object. Using Scheme continuation, we can express various control structures such as non-local exits, coroutines and multitasks. In stack-based Scheme implementations, continuations are implemented by saving the contents of the control stack into the heap when a continuation is captured and by restoring the control stack from the heap when the continuation is invoked. Therefore, the operation of capturing and invoking continuations is heavy. In this paper, based on the fact that each continuation is invoked only once in most applications, we propose indefinite one-time continuations which can be invoked only once but which can be invoked at any time. Using these continuations, we can improve performance of application programs of Scheme continuations.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"100","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"92","bibliographicIssueDates":{"bibliographicIssueDate":"1996-01-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"37"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"プログラミング技術"}]},"weko_creator_id":"11"},"id":13744,"updated":"2025-01-20T06:32:47.868597+00:00","links":{}}