{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:43:46Z","timestamp":1726083826168},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030471460"},{"type":"electronic","value":"9783030471477"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-47147-7_3","type":"book-chapter","created":{"date-parts":[[2020,5,10]],"date-time":"2020-05-10T23:02:55Z","timestamp":1589151775000},"page":"38-57","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Verifying Selective CPS Transformation for Shift and Reset"],"prefix":"10.1007","author":[{"given":"Chiaki","family":"Ishio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenichi","family":"Asai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,11]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-48168-0_32","volume-title":"Computer Science Logic","author":"T Altenkirch","year":"1999","unstructured":"Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Flum, J., Rodriguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 453\u2013468. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48168-0_32"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Asai, K., Uehara, C.: Selective CPS transformation for shift and reset. In: Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM 2018), pp. 40\u201352 (2018)","DOI":"10.1145\/3175493.3162069"},{"issue":"1","key":"3_CR3","first-page":"1","volume":"14","author":"D Biernacki","year":"2018","unstructured":"Biernacki, D., Polesiuk, P.: Logical relations for coherence of effect subtyping. Log. Methods Comput. Sci. 14(1), 1\u201328 (2018)","journal-title":"Log. Methods Comput. Sci."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Chlipala, A.: Parametric higher-order abstract syntax for mechanized semantics. In: Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP 2008), pp. 143\u2013156, September 2008","DOI":"10.1145\/1411203.1411226"},{"key":"3_CR5","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9153.001.0001","volume-title":"Certified Programming with Dependent Types","author":"A Chlipala","year":"2013","unstructured":"Chlipala, A.: Certified Programming with Dependent Types. MIT Press, Cambridge (2013)"},{"key":"3_CR6","unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. Technical report 89\/12, DIKU, University of Copenhagen, July 1989"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: Proceedings of the ACM Conference on LISP and Functional Programming (LFP 1990), pp. 151\u2013160 (1990)","DOI":"10.1145\/91556.91622"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0960129500001535","volume":"2","author":"O Danvy","year":"1992","unstructured":"Danvy, O., Filinski, A.: Representing control: a study of the CPS transformation. Math. Struct. Comput. Sci. 2(4), 361\u2013391 (1992)","journal-title":"Math. Struct. Comput. Sci."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-75560-9_17","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"Z Dargaye","year":"2007","unstructured":"Dargaye, Z., Leroy, X.: Mechanized verification of CPS transformations. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 211\u2013225. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-75560-9_17"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Filinski, A.: Representing monads. In: Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 446\u2013457. ACM (1994)","DOI":"10.1145\/174675.178047"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Kameyama, Y., Hasegawa, M.: A sound and complete axiomatization of delimited continuations. In: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming (ICFP 2003), pp. 177\u2013188 (2003)","DOI":"10.1145\/944746.944722"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Kim, J., Yi, K., Danvy, O.: Assessing the overhead of ML exceptions by selective CPS transformation. In: Proceedings of the 1998 ACM SIGPLAN Workshop on ML, pp. 103\u2013114 (1998)","DOI":"10.7146\/brics.v5i15.19287"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Lawall, J.L., Danvy, O.: Continuation-based partial evaluation. In: Proceedings of the 1994 ACM Conference on LISP and Functional Programming (LFP 1994), pp. 227\u2013238 (1994)","DOI":"10.1145\/182590.182483"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Materzok, M., Biernacki, D.: Subtyping delimited continuations. In: Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP 2011), pp. 81\u201393, September 2011","DOI":"10.1145\/2034574.2034786"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Minamide, Y., Okuma, K.: Verifying CPS transformations in Isabelle\/HOL. In: Proceedings of the 2003 ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding (MERLIN 2003), pp. 1\u20138 (2003)","DOI":"10.1145\/976571.976576"},{"key":"3_CR16","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. Ph.D. thesis, Chalmers University of Technology, SE-412 96, G\u00f6teborg, Sweden, September 2007"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Rompf, T., Maier, I., Odersky, M.: Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform. In: Proceedings of the 2009 ACM SIGPLAN International Conference on Functional Programming (ICFP 2009), pp. 317\u2013328. ACM (2009)","DOI":"10.1145\/1631687.1596596"},{"key":"3_CR18","unstructured":"Tian, Y.H.: Mechanically verifying correctness of CPS compilation. In: Proceeding of the Twelfth Computing: The Australasian Theory Symposium (CATS 2006), vol. 51, pp. 41\u201351 (2006)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Yamada, U., Asai, K.: Certifying CPS transformation of let-polymorphic calculus using PHOAS. In: Proceedings of the 16th Asian Symposium on Programming Languages and Systems (APLAS 2018), pp. 375\u2013393 (2018)","DOI":"10.1007\/978-3-030-02768-1_20"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-47147-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,10]],"date-time":"2020-05-10T23:10:59Z","timestamp":1589152259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-47147-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030471460","9783030471477"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-47147-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.tfp2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}