{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:26Z","timestamp":1725489146065},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002253"},{"type":"electronic","value":"9783540362067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36206-1_2","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:23:08Z","timestamp":1187248988000},"page":"2-17","source":"Crossref","is-referenced-by-count":2,"title":["From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple"],"prefix":"10.1007","author":[{"given":"Harry G.","family":"Mairson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Information and Computation, 163(2):409\u2013470, Dec. 2000.","journal-title":"Information and Computation"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"S. Abramsky and G. McCusker. Game semantics. In H. Schwichtenberg and U. Berger, editors, Theoretical Foundations of Computer Graphics and CAD, volume 165 of NATO ASI, pages 307\u2013325. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-642-58622-4_1"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/FI-1995-22121","volume":"22","author":"A. Asperti","year":"1995","unstructured":"A. Asperti. Linear logic, comonads and optimal reductions. Fundamentae Informaticae, 22:3\u201322, 1995.","journal-title":"Fundamentae Informaticae"},{"key":"2_CR4","unstructured":"A. Asperti and S. Guerrini. The Optimal Implementation of Functional Programming Languages. Cambridge University Press, 1998."},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(94)00279-7","volume":"142","author":"A. Asperti","year":"1995","unstructured":"A. Asperti and C. Laneve. Paths, computations and labels in the \u03bb-calculus. Theoretical Computer Science, 142(2):277\u2013297, 15 May 1995.","journal-title":"Theoretical Computer Science"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1006\/inco.2001.2869","volume":"170","author":"A. Asperti","year":"2001","unstructured":"A. Asperti and H. G. Mairson. Parallel beta reduction is not elementary recursive. Information and Computation, 170:49\u201380, 2001.","journal-title":"Information and Computation"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Geometry of interaction I: Interpretation of system F. In C. Bonotto, R. Ferro, S. Valentini, and A. Zanardo, editors, Logic Colloquium\u2019 88, pages 221\u2013260. North-Holland, 1989.","DOI":"10.1016\/S0049-237X(08)70271-4"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"G. Gonthier, M. Abadi, and J.-J. L\u00e9vy. The geometry of optimal lambda reduction. In Conference record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: papers presented at the symposium, Albuquerque, New Mexico, January 19\u201322, 1992, pages 15\u201326, New York, NY, USA, 1992. ACM Press.","DOI":"10.1145\/143165.143172"},{"key":"2_CR10","first-page":"223","volume-title":"Proceedings 7th Annual IEEE Symp. on Logic in Computer Science, LICS\u201992","author":"G. Gonthier","year":"1992","unstructured":"G. Gonthier, M. Abadi, and J.-J. L\u00e9vy. Linear logic without boxes. In Proceedings 7th Annual IEEE Symp. on Logic in Computer Science, LICS\u201992, Santa Cruz, CA, USA, 22\u201325 June 1992, pages 223\u201334. IEEE Computer Society Press, Los Alamitos, CA, 1992."},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J. M. E. Hyland","year":"2000","unstructured":"J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II, and III. Information and Computation, 163(2):285\u2013408, Dec. 2000.","journal-title":"Information and Computation"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"J. Lamping. An algorithm for optimal lambda calculus reduction. In POPL\u2019 90. Proceedings of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, January 17\u201319, 1990, San Francisco, CA, pages 16\u201330, New York, NY, USA, 1990. ACM Press.","DOI":"10.1145\/96709.96711"},{"key":"2_CR13","unstructured":"J.-J. L\u00e9vy. R\u00e9ductions correctes et optimales dans le lambda-calcul. PhD thesis, Universit\u00e9 Paris 7, 1978. Th\u00e8se d\u2019Etat."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"P. Wadler. The essence of functional programming. In Conference record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: papers presented at the symposium, Albuquerque, New Mexico, January 19\u201322, 1992, pages 1\u201314, New York, NY, USA, 1992. ACM Press.","DOI":"10.1145\/143165.143169"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36206-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T22:32:52Z","timestamp":1587853972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36206-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002253","9783540362067"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-36206-1_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}