{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:03:04Z","timestamp":1760079784947,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"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":["26730004, JSPS, 24680001, JSPS"],"award-info":[{"award-number":["26730004, JSPS, 24680001, JSPS"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603124","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Memoryful geometry of interaction"],"prefix":"10.1145","author":[{"given":"Naohiko","family":"Hoshino","sequence":"first","affiliation":[{"name":"RIMS, Kyoto University"}]},{"given":"Koko","family":"Muroya","sequence":"additional","affiliation":[{"name":"University of Tokyo"}]},{"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[{"name":"University of Tokyo"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"1","volume-title":"CONCUR '96: Concurrency Theory","author":"Abramsky S.","year":"1996","unstructured":"S. Abramsky . Retracing some paths in process algebra . In CONCUR '96: Concurrency Theory , volume 1119 of LNCS , pages 1 -- 17 . Springer Berlin Heidelberg , 1996 . S. Abramsky. Retracing some paths in process algebra. In CONCUR '96: Concurrency Theory, volume 1119 of LNCS, pages 1--17. Springer Berlin Heidelberg, 1996."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129502003730"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482830-9\/50021-7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.10.008"},{"issue":"8","key":"e_1_3_2_1_5_1","first-page":"891","article-title":"Towards a calculus of state-based software components","volume":"9","author":"Barbosa L. S.","year":"2003","unstructured":"L. S. Barbosa . Towards a calculus of state-based software components . Journal of Universal Computer Science , 9 ( 8 ): 891 -- 909 , 2003 . L. S. Barbosa. Towards a calculus of state-based software components. Journal of Universal Computer Science, 9(8):891--909, 2003.","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_12"},{"issue":"0","key":"e_1_3_2_1_7_1","first-page":"40","article-title":"Reversible, irreversible and optimal \u03bb-machines: Extended abstract","volume":"3","author":"Danos V.","year":"1996","unstructured":"V. Danos and L. Regnier . Reversible, irreversible and optimal \u03bb-machines: Extended abstract . ENTCS , 3 ( 0 ): 40 -- 60 , 1996 . V. Danos and L. Regnier. Reversible, irreversible and optimal \u03bb-machines: Extended abstract. ENTCS, 3(0):40--60, 1996.","journal-title":"ENTCS"},{"key":"e_1_3_2_1_8_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-642-41157-1_3","volume-title":"Trustworthy Global Computing","author":"Fredriksson O.","year":"2013","unstructured":"O. Fredriksson and D. R. Ghica . Seamless distributed computing from the geometry of interaction . In C. Palamidessi and M. D. Ryan, editors, Trustworthy Global Computing , volume 8191 of Lecture Notes in Computer Science , pages 34 -- 48 . Springer Berlin Heidelberg , 2013 . O. Fredriksson and D. R. Ghica. Seamless distributed computing from the geometry of interaction. In C. Palamidessi and M. D. Ryan, editors, Trustworthy Global Computing, volume 8191 of Lecture Notes in Computer Science, pages 34--48. Springer Berlin Heidelberg, 2013."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190269"},{"key":"e_1_3_2_1_10_1","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0049-237X(08)70271-4","volume-title":"Logic Colloquium '88 Proceedings of the Colloquium held in Padova","author":"Girard J.-Y.","year":"1989","unstructured":"J.-Y. Girard . Geometry of interaction 1: Interpretation of system F . In S. V. R. Ferro, C. Bonotto and A. Zanardo, editors, Logic Colloquium '88 Proceedings of the Colloquium held in Padova , volume 127 of Studies in Logic and the Foundations of Mathematics , pages 221 -- 260 . Elsevier , 1989 . J.-Y. Girard. Geometry of interaction 1: Interpretation of system F. In S. V. R. Ferro, C. Bonotto and A. Zanardo, editors, Logic Colloquium '88 Proceedings of the Colloquium held in Padova, volume 127 of Studies in Logic and the Foundations of Mathematics, pages 221--260. Elsevier, 1989."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/143165.143172"},{"issue":"0","key":"e_1_3_2_1_12_1","first-page":"137","article-title":"The uniformity principle on traced monoidal categories","volume":"69","author":"Hasegawa M.","year":"2003","unstructured":"M. Hasegawa . The uniformity principle on traced monoidal categories . ENTCS , 69 ( 0 ): 137 -- 155 , 2003 . CTCS'02. M. Hasegawa. The uniformity principle on traced monoidal categories. ENTCS, 69(0):137--155, 2003. CTCS'02.","journal-title":"ENTCS"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129508007184"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.26"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129510000551"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"N.\n      Hoshino\n    .\n  A modified GoI interpretation for a linear functional programming language and its adequacy\n  . In M. Hofmann editor FOSSACS volume \n  6604\n   of \n  Lecture Notes in Computer Science pages \n  320\n  --\n  334\n  . \n  Springer 2011\n  .   N. Hoshino. A modified GoI interpretation for a linear functional programming language and its adequacy. In M. Hofmann editor FOSSACS volume 6604 of Lecture Notes in Computer Science pages 320--334. Springer 2011.","DOI":"10.1007\/978-3-642-19805-2_22"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.07.017"},{"key":"e_1_3_2_1_18_1","volume-title":"Version 2.0","author":"Jacobs B.","year":"2012","unstructured":"B. Jacobs . Introduction to coalgebra. towards mathematics of states and observations , Version 2.0 2012 . B. Jacobs. Introduction to coalgebra. towards mathematics of states and observations, Version 2.0 2012."},{"key":"e_1_3_2_1_19_1","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Categorical Logic and Type Theory","author":"Jacobs B.","year":"1999","unstructured":"B. Jacobs , editor. Categorical Logic and Type Theory , volume 141 of Studies in Logic and the Foundations of Mathematics . Elsevier , 1999 9. B. Jacobs, editor. Categorical Logic and Type Theory, volume 141 of Studies in Logic and the Foundations of Mathematics. Elsevier, 19999."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100074338"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2007.10.006"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2643"},{"key":"e_1_3_2_1_23_1","first-page":"283","volume-title":"TLCA","author":"Laurent O.","year":"2001","unstructured":"O. Laurent . A token machine for full geometry of interaction . In TLCA , pages 283 -- 297 , 2001 . O. Laurent. A token machine for full geometry of interaction. In TLCA, pages 283--297, 2001."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199483"},{"key":"e_1_3_2_1_27_1","volume-title":"Compiling effectful terms to transducers: Prototype implementation of memoryful geometry of interaction. Submitted","author":"Muroya K.","year":"2014","unstructured":"K. Muroya , T. Kataoka , I. Hasuo , and N. Hoshino . Compiling effectful terms to transducers: Prototype implementation of memoryful geometry of interaction. Submitted , 2014 . K. Muroya, T. Kataoka, I. Hasuo, and N. Hoshino. Compiling effectful terms to transducers: Prototype implementation of memoryful geometry of interaction. Submitted, 2014."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023064908962"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129597002375"},{"key":"e_1_3_2_1_30_1","series-title":"LNCS","first-page":"205","volume-title":"TLCA","author":"Sch\u00f6pp U.","year":"2013","unstructured":"U. Sch\u00f6pp . On interaction, continuations and defunctionalization . In TLCA , volume 7941 of LNCS , pages 205 -- 220 . Springer Berlin Heidelberg , 2013 . U. Sch\u00f6pp. On interaction, continuations and defunctionalization. In TLCA, volume 7941 of LNCS, pages 205--220. Springer Berlin Heidelberg, 2013."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32033-3_17"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/788019.788864"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_20"}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vienna Austria","acronym":"CSL-LICS '14"},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603124","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:34Z","timestamp":1750278154000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603124"}},"subtitle":["from coalgebraic components to algebraic effects"],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":31,"alternative-id":["10.1145\/2603088.2603124","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603124","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}