{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:58Z","timestamp":1772164078436,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P25781"],"award-info":[{"award-number":["P25781"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837646","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"243-255","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["The complexity of interaction"],"prefix":"10.1145","author":[{"given":"St\u00e9phane","family":"Gimenez","sequence":"first","affiliation":[{"name":"University of Innsbruck, Austria"}]},{"given":"Georg","family":"Moser","sequence":"additional","affiliation":[{"name":"University of Innsbruck, Austria"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800001994"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"R. Atkey. Amortised resource analysis with separation logic. Logical Methods in Computer Science 7(2) 2011.  R. Atkey. Amortised resource analysis with separation logic. Logical Methods in Computer Science 7(2) 2011.","DOI":"10.2168\/LMCS-7(2:17)2011"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784753"},{"key":"e_1_3_2_1_4_1","series-title":"LIPIcs","first-page":"76","volume-title":"Proc. 21th CSL","author":"Baillot P.","year":"2012"},{"key":"e_1_3_2_1_5_1","volume-title":"Handbook of Theoretical Computer Science","author":"Emde Boas P.v.","year":"1990"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"155","volume-title":"Proc. 20th TACAS","author":"Brockschmidt M.","year":"2014"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.10.017"},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","first-page":"350","volume-title":"Proc. 23rd ESOP","author":"Ghica D.","year":"2014"},{"key":"e_1_3_2_1_9_1","unstructured":"S. Gimenez. Programmer calculer et raisonner avec les r\u00e9seaux de la logique lin\u00e9aire. PhD thesis 2009.  S. Gimenez. Programmer calculer et raisonner avec les r\u00e9seaux de la logique lin\u00e9aire. PhD thesis 2009."},{"key":"e_1_3_2_1_10_1","unstructured":"S. Gimenez and G. Moser. The complexity of interaction (long version). http:\/\/arxiv.org\/abs\/1511.01838.  S. Gimenez and G. Moser. The complexity of interaction (long version). http:\/\/arxiv.org\/abs\/1511.01838."},{"key":"e_1_3_2_1_11_1","series-title":"LIPIcs","first-page":"331","volume-title":"Proc. 22nd CSL","author":"Gimenez S.","year":"2013"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90386-T"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/143165.143172"},{"key":"e_1_3_2_1_14_1","first-page":"234","volume-title":"Proc. 7th LICS","author":"Gonthier G."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.03.035"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2362389.2362393"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46669-8_6"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96718"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2643"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555746.1555749"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2013.07.010"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96711"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"S. Lippi. Universal hard interaction for clockless computation: Dem Gl\u00fccklichen schl\u00e4gt keine Stunde! FI 91(2):357\u2013394 2009.   S. Lippi. Universal hard interaction for clockless computation: Dem Gl\u00fccklichen schl\u00e4gt keine Stunde! FI 91(2):357\u2013394 2009.","DOI":"10.3233\/FI-2009-0048"},{"key":"e_1_3_2_1_24_1","unstructured":"The linear logic wiki: Fragments. http:\/\/llwiki.ens-lyon.fr\/ mediawiki\/index.php\/Fragment.  The linear logic wiki: Fragments. http:\/\/llwiki.ens-lyon.fr\/ mediawiki\/index.php\/Fragment."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00198-5"},{"key":"e_1_3_2_1_26_1","series-title":"LNCS","first-page":"169","volume-title":"Proc. 15th RTA","author":"Mackie I.","year":"2004"},{"key":"e_1_3_2_1_27_1","unstructured":"D. Mazza. Interaction Nets: Semantics and Concurrent Extensions. PhD thesis 2006.  D. Mazza. Interaction Nets: Semantics and Concurrent Extensions. PhD thesis 2006."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603155"},{"key":"e_1_3_2_1_30_1","series-title":"LNCS","first-page":"356","volume-title":"12th RTA","author":"Pinto J. S.","year":"2001"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_50"},{"key":"e_1_3_2_1_32_1","volume-title":"University of St. Andrews","author":"Vasconcelos P.","year":"2008"},{"key":"e_1_3_2_1_33_1","unstructured":"L. Vaux. \u03bb-calcul diff\u00e9rentiel et logique classique: interactions combinatoires. PhD thesis 2007.  L. Vaux. \u03bb-calcul diff\u00e9rentiel et logique classique: interactions combinatoires. PhD thesis 2007."}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837646","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:38Z","timestamp":1750211018000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":33,"alternative-id":["10.1145\/2837614.2837646","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837646","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837646","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}