{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:46:19Z","timestamp":1764251179732},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_23","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"283-297","source":"Crossref","is-referenced-by-count":18,"title":["Typed Normal Form Bisimulation"],"prefix":"10.1007","author":[{"given":"Soren B.","family":"Lassen","sequence":"first","affiliation":[]},{"given":"Paul Blain","family":"Levy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1006\/inco.1994.1042","volume":"111","author":"D. Sangiorgi","year":"1994","unstructured":"Sangiorgi, D.: The lazy lambda calculus in a concurrency scenario. Information and Computation\u00a0111(1), 120\u2013153 (1994)","journal-title":"Information and Computation"},{"key":"23_CR2","first-page":"209","volume-title":"Intl. Conf. on Aspect-Oriented Software Development","author":"R. Jagadeesan","year":"2007","unstructured":"Jagadeesan, R., Pitcher, C., Riely, J.: Open bisimulation for aspects. In: Intl. Conf. on Aspect-Oriented Software Development, pp. 209\u2013224. ACM Press, New York (2007)"},{"key":"23_CR3","series-title":"ENTCS","first-page":"346","volume-title":"MFPS XV","author":"S.B. Lassen","year":"1999","unstructured":"Lassen, S.B.: Bisimulation in untyped lambda calculus: B\u00f6hm trees and bisimulation up to context. In: MFPS XV. ENTCS, vol.\u00a020, pp. 346\u2013374. Elsevier, Amsterdam (1999)"},{"key":"23_CR4","first-page":"345","volume-title":"20th LICS","author":"S.B. Lassen","year":"2005","unstructured":"Lassen, S.B.: Eager normal form bisimulation. In: 20th LICS, pp. 345\u2013354. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"23_CR5","series-title":"ENTCS","first-page":"445","volume-title":"MFPS XXI","author":"S.B. Lassen","year":"2005","unstructured":"Lassen, S.B.: Normal form simulation for McCarty\u2019s amb. In: MFPS XXI. ENTCS, vol.\u00a0155, pp. 445\u2013465. Elsevier, Amsterdam (2005)"},{"key":"23_CR6","first-page":"297","volume-title":"21st LICS","author":"S.B. Lassen","year":"2006","unstructured":"Lassen, S.B.: Head normal form bisimulation for pairs and the \u03bb\u03bc-calculus (extended abstract). In: 21st LICS, pp. 297\u2013306. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"23_CR7","first-page":"63","volume-title":"34th POPL","author":"K. St\u00f8vring","year":"2007","unstructured":"St\u00f8vring, K., Lassen, S.B.: A complete, co-inductive syntactic theory of sequential control and state. In: 34th POPL, pp. 63\u201374. ACM Press, New York (2007)"},{"key":"23_CR8","first-page":"65","volume-title":"Research Topics in Functional Programming","author":"S. Abramsky","year":"1990","unstructured":"Abramsky, S.: The lazy \u03bb-calculus. In: Turner, D. (ed.) Research Topics in Functional Programming, pp. 65\u2013116. Addison-Wesley, Reading (1990)"},{"key":"23_CR9","unstructured":"Gordon, A.D.: Functional Programming and Input\/Output. CUP (1994)"},{"key":"23_CR10","volume-title":"Semantic Struct. in Computation","author":"P.B. Levy","year":"2004","unstructured":"Levy, P.B.: Call-By-Push-Value. A Functional\/Imperative Synthesis. In: Semantic Struct. in Computation, Springer, Heidelberg (2004)"},{"issue":"5","key":"23_CR11","first-page":"75","volume":"14","author":"P.B. Levy","year":"2005","unstructured":"Levy, P.B.: Adjunction models for call-by-push-value with stacks. Theory and Applications of Categories\u00a014(5), 75\u2013110 (2005)","journal-title":"Theory and Applications of Categories"},{"key":"23_CR12","series-title":"ENTCS","first-page":"307","volume-title":"MFPS XXII","author":"M. Merro","year":"2006","unstructured":"Merro, M., Biasi, C.: On the observational theory of the CPS calculus. In: MFPS XXII. ENTCS, vol.\u00a0158, pp. 307\u2013330. Elsevier, Amsterdam (2006)"},{"issue":"2","key":"23_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J.M.E. Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.H.L.: On full abstraction for PCF: I, II, and III. Information and Computation\u00a0163(2), 285\u2013408 (2000)","journal-title":"Information and Computation"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0028004","volume-title":"Computer Science Logic","author":"S. Abramsky","year":"1998","unstructured":"Abramsky, S., McCusker, G.: Call-by-value games. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414, pp. 1\u201317. Springer, Heidelberg (1998)"},{"key":"23_CR15","first-page":"334","volume-title":"13th LICS","author":"S. Abramsky","year":"1998","unstructured":"Abramsky, S., Honda, K., McCusker, G.: A fully abstract game semantics for general references. In: 13th LICS, pp. 334\u2013344. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"23_CR16","first-page":"58","volume-title":"12th LICS","author":"J. Laird","year":"1997","unstructured":"Laird, J.: Full abstraction for functional languages with control. In: 12th LICS, pp. 58\u201367. IEEE Computer Society Press, Los Alamitos (1997)"},{"issue":"1-2","key":"23_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(00)00353-4","volume":"272","author":"A.D. Ker","year":"2002","unstructured":"Ker, A.D., Nickau, H., Ong, C.H.L.: Innocent game models of untyped lambda-calculus. Theoretical Computer Science\u00a0272(1-2), 247\u2013292 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"23_CR18","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0304-3975(02)00849-6","volume":"308","author":"A.D. Ker","year":"2003","unstructured":"Ker, A.D., Nickau, H., Ong, C.H.L.: Adapting innocent game models for the B\u00f6hm tree \u03bb-theory. Theoretical Computer Science\u00a0308(1-3), 333\u2013366 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"23_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(03)00405-5","volume":"312","author":"C.H.L. Ong","year":"2004","unstructured":"Ong, C.H.L., Gianantonio, P.D.: Games characterizing L\u00e9vy-Longo trees. Theoretical Computer Science\u00a0312(1), 121\u2013142 (2004)","journal-title":"Theoretical Computer Science"},{"key":"23_CR20","series-title":"ENTCS","volume-title":"9th Conference on Category Theory and Computer Science","author":"J. Laird","year":"2003","unstructured":"Laird, J.: A categorical semantics of higher-order store. In: 9th Conference on Category Theory and Computer Science. ENTCS, vol.\u00a069, Elsevier, Amsterdam (2003)"},{"key":"23_CR21","unstructured":"Curien, P.L., Herbelin, H.: Computing with abstract B\u00f6hm trees. In: Fuji International Symposium on Functional and Logic Programming, pp. 20\u201339 (1998)"},{"key":"23_CR22","first-page":"394","volume-title":"11th LICS","author":"V. Danos","year":"1996","unstructured":"Danos, V., Herbelin, H., Regnier, L.: Game semantics and abstract machines. In: 11th LICS, pp. 394\u2013405. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"23_CR23","series-title":"ENTCS","first-page":"467","volume-title":"MFPS XXI","author":"P.B. Levy","year":"2006","unstructured":"Levy, P.B.: Infinite trace equivalence. In: MFPS XXI. ENTCS, vol.\u00a0155, pp. 467\u2013496. Elsevier, Amsterdam (2006)"},{"key":"23_CR24","unstructured":"Levy, P.B.: Game semantics using function inventories.Talk given at Geometry of Computation 2006, Marseille (2006)"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"34th ICALP","author":"J. Laird","year":"2007","unstructured":"Laird, J.: A fully abstract trace semantics for general references. In: 34th ICALP. LNCS, vol.\u00a04596, Springer, Heidelberg (2007)"},{"key":"23_CR26","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/224164.224189","volume-title":"7th FPCA","author":"J.M.E. Hyland","year":"1995","unstructured":"Hyland, J.M.E., Ong, C.H.L.: Pi-calculus, dialogue games and PCF. In: 7th FPCA, pp. 96\u2013107. ACM Press, New York (1995)"},{"key":"23_CR27","first-page":"345","volume-title":"13th LICS","author":"M.P. Fiore","year":"1998","unstructured":"Fiore, M.P., Honda, K.: Recursive types in games: Axiomatics and process representation. In: 13th LICS, pp. 345\u2013356. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"23_CR28","unstructured":"Thielecke, H.: Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh (1997)"},{"key":"23_CR29","unstructured":"Thielecke, H.: Contrasting exceptions and continuations, October 2001 (unpublished)"},{"key":"23_CR30","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. Revised edn., North-Holland, Amsterdam (1984)"},{"key":"23_CR31","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/inco.1996.0052","volume":"127","author":"A.M. Pitts","year":"1996","unstructured":"Pitts, A.M.: Relational properties of domains. Information and Computation\u00a0127, 66\u201390 (1996)","journal-title":"Information and Computation"},{"key":"23_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014563","volume-title":"Theoretical Aspects of Computer Software","author":"L. Birkedal","year":"1997","unstructured":"Birkedal, L., Harper, R.: Operational interpretations of recursive types in an operational setting (summary). In: Ito, T., Abadi, M. (eds.) TACS 1997. LNCS, vol.\u00a01281, Springer, Heidelberg (1997)"},{"key":"23_CR33","unstructured":"Lassen, S.B.: Relational reasoning about contexts. In: Gordon, A.D., Pitts, A.M. (eds.) Higher Order Operational Techniques in Semantics.CUP, pp. 91\u2013135 (1998)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:45:48Z","timestamp":1619520348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}