{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:23Z","timestamp":1772164043558,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"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":[[2013,1,23]]},"DOI":"10.1145\/2429069.2429089","type":"proceedings-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T10:29:29Z","timestamp":1358850569000},"page":"155-166","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Lambda Lambda-Bar calculus"],"prefix":"10.1145","author":[{"given":"Alexis","family":"Goyet","sequence":"first","affiliation":[{"name":"Univ Paris Diderot, Sorbonne Paris Cit\u00e9, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/788020.788891"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2930"},{"key":"e_1_3_2_2_3_1","volume-title":"Citeseer","author":"Abramsky S.","year":"1997","unstructured":"S. Abramsky and G. McCusker . Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions. In Algol-like languages . Citeseer , 1997 . S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions. In Algol-like languages. Citeseer, 1997."},{"key":"e_1_3_2_2_4_1","volume-title":"The lambda calculus: its syntax and semantics","author":"Barendregt H.P.","year":"1984","unstructured":"H.P. Barendregt . The lambda calculus: its syntax and semantics , volume 103 . North Holland , 1984 . H.P. Barendregt. The lambda calculus: its syntax and semantics, volume 103. North Holland, 1984."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.46"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-642-15205-4_19","volume-title":"Computer Science Logic","author":"Churchill M.","year":"2010","unstructured":"M. Churchill and J. Laird . A logic of sequentiality . In Computer Science Logic , pages 215 -- 229 . Springer , 2010 . M. Churchill and J. Laird. A logic of sequentiality. In Computer Science Logic, pages 215--229. Springer, 2010."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.19"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/357766.351262"},{"key":"e_1_3_2_2_9_1","volume-title":"Abstract machines for dialogue games. Arxiv preprint arXiv:0706.2544","author":"Curien P.L.","year":"2007","unstructured":"P.L. Curien and H. Herbelin . Abstract machines for dialogue games. Arxiv preprint arXiv:0706.2544 , 2007 . P.L. Curien and H. Herbelin. Abstract machines for dialogue games. Arxiv preprint arXiv:0706.2544, 2007."},{"key":"e_1_3_2_2_10_1","unstructured":"A. Goyet. The \u0142lbc implementation manual. http:\/\/www.pps.univ-paris-diderot.fr\/ agoyet\/llbc.  A. Goyet. The \u0142lbc implementation manual. http:\/\/www.pps.univ-paris-diderot.fr\/ agoyet\/llbc."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.14"},{"key":"e_1_3_2_2_12_1","unstructured":"Russ Harmer. Cellular strategies and innocent interaction. Draft.  Russ Harmer. Cellular strategies and innocent interaction. Draft."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645893.671613"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2917"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/788019.788859"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.07.087"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28644-8_29"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2009.07.018"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645681.664284"},{"key":"e_1_3_2_2_20_1","unstructured":"Vincent Padovani. Decidability of All Minimal Models. http:\/\/hal.archives-ouvertes.fr\/hal-00741219 2012.  Vincent Padovani. Decidability of All Minimal Models. http:\/\/hal.archives-ouvertes.fr\/hal-00741219 2012."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/788020.788899"}],"event":{"name":"POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Rome Italy","acronym":"POPL '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429089","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429069.2429089","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:35Z","timestamp":1750221335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429089"}},"subtitle":["a dual calculus for unconstrained strategies"],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":21,"alternative-id":["10.1145\/2429069.2429089","10.1145\/2429069"],"URL":"https:\/\/doi.org\/10.1145\/2429069.2429089","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2480359.2429089","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,1,23]]},"assertion":[{"value":"2013-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}