{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:24Z","timestamp":1725484644574},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-44802-0_14","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:15:38Z","timestamp":1180671338000},"page":"188-202","source":"Crossref","is-referenced-by-count":8,"title":["The Anatomy of Innocence"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Danos","sequence":"first","affiliation":[]},{"given":"Russell","family":"Harmer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Samson Abramsky, Kohei Honda, and Guy McCusker. A fully abstract game semantics for general references. In Proceedings, Thirteenth Annual IEEE Symposium on Logic in Computer Science, pages 334\u2013344, 1998.","DOI":"10.1109\/LICS.1998.705669"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Samson Abramsky and Guy McCusker. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In P. W. O\u2019Hearn and R. D. Tennent, editors, Algol-like languages. Birkha\u00fcser, 1997.","DOI":"10.1007\/978-1-4612-4118-8"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Vincent Danos and Russell Harmer. Probabilistic games semantics. In Proceedings of the 15 th Symposium on Logic in Computer Science, Santa Barbara, 2000. IEEE.","DOI":"10.1109\/LICS.2000.855770"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Vincent Danos, Hugo Herbelin, and Laurent Regnier. Games semantics and abstract machines. In Proceedings of the 11 th Symposium on Logic in Computer Science, pages 394\u2013405, New Brunswick, 1996. IEEE.","DOI":"10.1109\/LICS.1996.561456"},{"key":"14_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of TLCA\u201997","author":"H. Herbelin","year":"1997","unstructured":"Hugo Herbelin. Games and weak head reduction for classical PCF. In ?, editor, Proceedings of TLCA\u201997, number 1210 in Lecture Notes in Computer Science, pages ?-?, ?, 1997. Springer Verlag."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"R. S. Harmer and G. A. McCusker. A fully abstract game semantics for finite nondeterminism. In Proceedings, Fourteenth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1999.","DOI":"10.1109\/LICS.1999.782637"},{"key":"14_CR7","unstructured":"J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II and III. To appear in Information and Computation, 200?, 1994."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"J. Laird. Full abstraction for functional languages with control. In Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1997.","DOI":"10.1109\/LICS.1997.614931"},{"key":"14_CR9","unstructured":"Olivier Laurent. Polarized proof nets and \u03bb\u03bc-calculus. Submitted to Theoretical Computer Science, 1999."},{"key":"14_CR10","unstructured":"P. B. Levy. Game semantics as continuation passing (extended abstract). unpublished, 1998."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Guy McCusker. Games and full abstraction for FPC. In Proceedings, Eleventh Annual IEEE Symposium on Logic in Computer Science, pages 174\u2013183. IEEE Computer Society Press, 1996.","DOI":"10.1109\/LICS.1996.561316"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Guy McCusker. Games and Full Abstraction for a Functional Metalanguage with Recursive Types. Distinguished Dissertations in Computer Science. Springer-Verlag, 1998.","DOI":"10.1007\/978-1-4471-0615-9"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"P. Malacaria and C. Hankin. Non-deterministic games and program analysis: An application to security. In Proceedings, Fourteenth Annual IEEE Symposium on Logic in Computer Science IEEE Computer Society Press, 1999.","DOI":"10.1109\/LICS.1999.782639"},{"key":"14_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings, Logical Foundations of Computer Science","author":"H. Nickau","year":"1994","unstructured":"Hanno Nickau. Hereditarily sequential functionals. In Proceedings, Logical Foundations of Computer Science, volume 813 of Lecture Notes in Computer Science. Springer-Verlag, 1994."},{"key":"14_CR15","unstructured":"Peter Selinger. Control categories and duality: on the categorical semantics of the \u03bb\u03bc-calculus. To appear, 1999."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44802-0_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:47Z","timestamp":1605647207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44802-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540425540"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44802-0_14","relation":{},"subject":[]}}