{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:15Z","timestamp":1750308615769,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,2,26]],"date-time":"2017-02-26T00:00:00Z","timestamp":1488067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,2,26]]},"DOI":"10.1145\/3056662.3056693","type":"proceedings-article","created":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T15:09:30Z","timestamp":1493651370000},"page":"28-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Linear lambda calculus with non-linear first-class continuations"],"prefix":"10.1145","author":[{"given":"Shin-Ya","family":"Nishizaki","sequence":"first","affiliation":[{"name":"Tokyo Institute of Technology, Tokyo, JAPAN"}]}],"member":"320","published-online":{"date-parts":[[2017,2,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-37621-7_5"},{"key":"e_1_3_2_1_2_1","volume-title":"Declarative continuations and categorical duality","author":"Filinski A.","year":"1989","unstructured":"A. Filinski . Declarative continuations and categorical duality , 1989 . A. Filinski. Declarative continuations and categorical duality, 1989."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_3_2_1_4_1","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Proof and types","author":"Girard J.-Y.","year":"1989","unstructured":"J.-Y. Girard and Y. Lafont . Proof and types , volume 7 of Cambridge Tracts in Theoretical Computer Science . Cambridge University Press , 1989 . J.-Y. Girard and Y. Lafont. Proof and types, volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989."},{"key":"e_1_3_2_1_5_1","series-title":"Cambridge Tracts in Computer Science","volume-title":"Proofs and Types","author":"Girard J.-Y.","year":"1989","unstructured":"J.-Y. Girard , P. Taylor , and Y. Lafont . Proofs and Types , volume 7 of Cambridge Tracts in Computer Science . Cambridge University Press , 1989 . J.-Y. Girard, P. Taylor, and Y. Lafont. Proofs and Types, volume 7 of Cambridge Tracts in Computer Science. Cambridge University Press, 1989."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.2316\/Journal.202.2011.4.202-3068"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2390\/biecoll-jib-2013-216"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.06.017"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-54106-6_13"},{"key":"e_1_3_2_1_10_1","volume-title":"The linear abstract machine. Theoretical computer science, 59(1--2):157--180","author":"Lafont Y.","year":"1988","unstructured":"Y. Lafont . The linear abstract machine. Theoretical computer science, 59(1--2):157--180 , 1988 . Y. Lafont. The linear abstract machine. Theoretical computer science, 59(1--2):157--180, 1988."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-54436-4_3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1991.151634"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25462-8_28"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(93)90005-A"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010010314528"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-53932-9_23"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34528-9_4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.17706\/jsw.11.2.220--229"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E96.D.2187"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-37621-7_2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"P.\n      Wadler\n    .\n  Call-by-Value Is Dual to Call-by-Name --- Reloaded\n  . Volume \n  3467\n   of \n  Lecture Notes in Computer Science pages \n  185\n  --\n  203\n  . \n  Springer Berlin Heidelberg 2005\n  .  P. Wadler. Call-by-Value Is Dual to Call-by-Name --- Reloaded. Volume 3467 of Lecture Notes in Computer Science pages 185--203. Springer Berlin Heidelberg 2005.","DOI":"10.1007\/978-3-540-32033-3_15"}],"event":{"name":"ICSCA 2017: 2017 6th International Conference on Software and Computer Applications","acronym":"ICSCA 2017","location":"Bangkok Thailand"},"container-title":["Proceedings of the 6th International Conference on Software and Computer Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3056662.3056693","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3056662.3056693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:31Z","timestamp":1750273651000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3056662.3056693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,26]]},"references-count":21,"alternative-id":["10.1145\/3056662.3056693","10.1145\/3056662"],"URL":"https:\/\/doi.org\/10.1145\/3056662.3056693","relation":{},"subject":[],"published":{"date-parts":[[2017,2,26]]},"assertion":[{"value":"2017-02-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}