{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:21:54Z","timestamp":1751660514656,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Kakenhi Grants 15H05706, 16K160004"],"award-info":[{"award-number":["Kakenhi Grants 15H05706, 16K160004"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M023974\/1"],"award-info":[{"award-number":["EP\/M023974\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,5]]},"DOI":"10.1145\/2933575.2934553","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:34:47Z","timestamp":1476452087000},"page":"237-246","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Plays as Resource Terms via Non-idempotent Intersection Types"],"prefix":"10.1145","author":[{"given":"Takeshi","family":"Tsukada","sequence":"first","affiliation":[{"name":"University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.-H. Luke","family":"Ong","sequence":"additional","affiliation":[{"name":"University of Oxford"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275407"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00047-X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/788021.788969"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2930"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 11th International Workshop on Computer Science Logic (CSL 97)","author":"Baillot P.","year":"1997","unstructured":"P. Baillot , V. Danos , T. Ehrhard , and L. Regnier . Timeless games . In Proceedings of the 11th International Workshop on Computer Science Logic (CSL 97) , 56--77, 1997 . P. Baillot, V. Danos, T. Ehrhard, and L. Regnier. Timeless games. In Proceedings of the 11th International Workshop on Computer Science Logic (CSL 97), 56--77, 1997."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129506005676"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_24"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02273-9_7"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic (CSL 13)","author":"Boudes P.","year":"2013","unstructured":"P. Boudes , F. He , and M. Pagani . A characterization of the Taylor expansion of lambda-terms . In Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic (CSL 13) , 101--115, 2013 . P. Boudes, F. He, and M. Pagani. A characterization of the Taylor expansion of lambda-terms. In Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic (CSL 13), 101--115, 2013."},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Full abstraction for the resource lambda calculus with tests, through taylor expansion","volume":"8","author":"Bucciarelli A.","year":"2012","unstructured":"A. Bucciarelli , A. Carraro , T. Ehrhard , and G. Manzonetto . Full abstraction for the resource lambda calculus with tests, through taylor expansion . LMCS , 8 : 1 -- 44 , Oct. 2012 . A. Bucciarelli, A. Carraro, T. Ehrhard, and G. Manzonetto. Full abstraction for the resource lambda calculus with tests, through taylor expansion. LMCS, 8:1--44, Oct. 2012.","journal-title":"LMCS"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.08.014"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129598002631"},{"key":"e_1_3_2_1_13_1","volume-title":"Notes on game semantics","author":"Curien P.-L.","year":"2006","unstructured":"P.-L. Curien . Notes on game semantics . 2006 . P.-L. Curien. Notes on game semantics. 2006."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/507382.507385"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01622878"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/788018.788795"},{"key":"e_1_3_2_1_17_1","volume-title":"Execution time of lambda-terms via denotational semantics and intersection types. arXiv, preprent page 36","author":"de Carvalho D.","year":"2009","unstructured":"D. de Carvalho . Execution time of lambda-terms via denotational semantics and intersection types. arXiv, preprent page 36 , 2009 . D. de Carvalho. Execution time of lambda-terms via denotational semantics and intersection types. arXiv, preprent page 36, 2009."},{"key":"e_1_3_2_1_18_1","volume-title":"The relational model is injective for multiplicative exponential linear logic. arXiv, preprint, 163(9):1210--1236","author":"de Carvalho D.","year":"2015","unstructured":"D. de Carvalho . The relational model is injective for multiplicative exponential linear logic. arXiv, preprint, 163(9):1210--1236 , 2015 . D. de Carvalho. The relational model is injective for multiplicative exponential linear logic. arXiv, preprint, 163(9):1210--1236, 2015."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2012.01.004"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic (CSL 13)","author":"Di Gianantonio P.","year":"2013","unstructured":"P. Di Gianantonio and M. Lenisa . Innocent game semantics via intersection type assignment systems . In Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic (CSL 13) , 231--247, 2013 . P. Di Gianantonio and M. Lenisa. Innocent game semantics via intersection type assignment systems. In Proceedings of the 22nd EACSL Annual Conference on Computer Science Logic (CSL 13), 231--247, 2013."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.38"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392200.2392225"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.06.001"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(4:3)2012"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2917"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/10.3.411"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_8"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.10.015"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.012"},{"key":"e_1_3_2_1_31_1","volume-title":"Morphisms between plays. GaLoP lecture Slides","author":"Levy P.","year":"2013","unstructured":"P. Levy . Morphisms between plays. GaLoP lecture Slides , 2013 . P.Levy. Morphisms between plays. GaLoP lecture Slides, 2013."},{"key":"e_1_3_2_1_32_1","volume-title":"Asynchronous games 1: Uniformity by group invariance","author":"Mellies P.-A.","year":"2003","unstructured":"P.-A. Mellies . Asynchronous games 1: Uniformity by group invariance . 2003 . P.-A. Mellies. Asynchronous games 1: Uniformity by group invariance. 2003."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.015"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.6"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.01.016"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_31"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.30"}],"event":{"name":"LICS '16: 31st Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"New York NY USA","acronym":"LICS '16"},"container-title":["Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934553","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2934553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:53Z","timestamp":1750222493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":37,"alternative-id":["10.1145\/2933575.2934553","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2934553","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}