{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:53Z","timestamp":1776316913955,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T00:00:00Z","timestamp":1168992000000},"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":[[2007,1,17]]},"DOI":"10.1145\/1190216.1190244","type":"proceedings-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T15:41:00Z","timestamp":1175787660000},"page":"161-172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["A complete, co-inductive syntactic theory of sequential control and state"],"prefix":"10.1145","author":[{"given":"Kristian","family":"St\u00f8vring","sequence":"first","affiliation":[{"name":"University of Aarhus"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soren B.","family":"Lassen","sequence":"additional","affiliation":[{"name":"Google, Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,1,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/119830.119834"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/788020.788891"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759295"},{"key":"e_1_3_2_1_4_1","volume-title":"The Lambda Calculus: Its Syntax and Semantics. Number 103 in Studies in Logic and the Foundations of Mathematics. North-Holland, revised edition","author":"Barendregt H. P.","year":"1984","unstructured":"H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. Number 103 in Studies in Logic and the Foundations of Mathematics. North-Holland, revised edition, 1984."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645727.667521"},{"key":"e_1_3_2_1_6_1","volume-title":"\u03bb\u03bc-calculus and B\u00f6hm's theorem. Journal of Symbolic Logic, 66(1):407--413","author":"David R.","year":"2001","unstructured":"R. David and W. Py. \u03bb\u03bc-calculus and B\u00f6hm's theorem. Journal of Symbolic Logic, 66(1):407--413, 2001."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/161643.161646"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90014-7"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/318593.318654"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00353-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/309656"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645708.664169"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111050"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/788019.788859"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"e_1_3_2_1_16_1","volume-title":"Schloss Dagstuhl","author":"Lassen S. B.","year":"1998","unstructured":"S. B. Lassen. Bisimulation up to context for imperative lambda calculus. Unpublished note. Presented at emphThe Semantic Challenge of Object-Oriented Programming, Schloss Dagstuhl, 1998."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/309656.309665"},{"key":"e_1_3_2_1_18_1","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"346","volume-title":"MFPS XV","author":"Lassen S. B.","year":"1999","unstructured":"S. B. Lassen. Bisimulation in untyped lambda calculus: B\u00f6hm trees and bisimulation up to context. In MFPS XV, volume 20 of Electronic Notes in Theoretical Computer Science, pages 346--374. Elsevier, 1999."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.15"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.11.068"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.29"},{"key":"e_1_3_2_1_22_1","volume-title":"Talk given at emphGeometry of Computation","author":"Levy P. B.","year":"2006","unstructured":"P. B. Levy. Game semantics using function inventories. Talk given at emphGeometry of Computation 2006, Marseille, 2006."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000125"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. 22nd Conference on Mathematical Foundations of Programming Semantics","volume":"158","author":"Merro M.","year":"2006","unstructured":"M. Merro and C. Biasi. On the observational theory of the CPS-calculus (extended abstract). In Proc. 22nd Conference on Mathematical Foundations of Programming Semantics, volume 158 of Electronic Notes in Theoretical Computer Science, pages 307--330. Elsevier, 2006."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73577"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645706.663989"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54345-7_82"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/788018.788828"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/309656.309671"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/645892.671596"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1042"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040311"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/309656.309676"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263755"}],"event":{"name":"POPL07: The 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Nice France","acronym":"POPL07","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1190216.1190244","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1190216.1190244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:47:42Z","timestamp":1750243662000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1190216.1190244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,17]]},"references-count":34,"alternative-id":["10.1145\/1190216.1190244","10.1145\/1190216"],"URL":"https:\/\/doi.org\/10.1145\/1190216.1190244","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1190215.1190244","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,1,17]]},"assertion":[{"value":"2007-01-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}