{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:13:34Z","timestamp":1770290014877,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":66,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642041631","type":"print"},{"value":"9783642041648","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04164-8_17","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T12:10:48Z","timestamp":1252930248000},"page":"329-375","source":"Crossref","is-referenced-by-count":7,"title":["A Complete, Co-inductive Syntactic Theory of Sequential Control and State"],"prefix":"10.1007","author":[{"given":"Kristian","family":"St\u00f8vring","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soren B.","family":"Lassen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"65","volume-title":"Research Topics in Functional Programming","author":"S. Abramsky","year":"1990","unstructured":"Abramsky, S.: The lazy lambda calculus. In: Turner, D. (ed.) Research Topics in Functional Programming, pp. 65\u2013116. Addison-Wesley, Reading (1990)"},{"key":"17_CR2","first-page":"334","volume-title":"Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science","author":"S. Abramsky","year":"1998","unstructured":"Abramsky, S., Honda, K., McCusker, G.: A fully abstract game semantics for general references. In: Pratt, V. (ed.) Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, June 1998, pp. 334\u2013344. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"17_CR3","first-page":"340","volume-title":"Proceedings of the Thirty-Sixth Annual ACM Symposium on Principles of Programming Languages","author":"A. Ahmed","year":"2009","unstructured":"Ahmed, A., Dreyer, D., Rossberg, A.: State-dependent representation independence. In: Shao, Z., Pierce, B.C. (eds.) Proceedings of the Thirty-Sixth Annual ACM Symposium on Principles of Programming Languages, pp. 340\u2013353. ACM Press, New York (2009)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Ahmed, A.J.: Step-indexed syntactic logical relations for recursive and quantified types. In: Sestoft [56], pp. 69\u201383","DOI":"10.1007\/11693024_6"},{"issue":"5","key":"17_CR5","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1145\/504709.504712","volume":"23","author":"A.W. Appel","year":"2001","unstructured":"Appel, A.W., McAllester, D.A.: An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems\u00a023(5), 657\u2013683 (2001)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/3-540-45061-0_68","volume-title":"Automata, Languages and Programming","author":"Z.M. Ariola","year":"2003","unstructured":"Ariola, Z.M., Herbelin, H.: Minimal classical logic and control operators. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 871\u2013885. Springer, Heidelberg (2003)"},{"key":"17_CR7","series-title":"Studies in Logic and the Foundation of Mathematics","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundation of Mathematics, vol.\u00a0103. North-Holland, Amsterdam (1984) (revised edn.)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/BFb0055783","volume-title":"Mathematical Foundations of Computer Science 1998","author":"G.M. Bierman","year":"1998","unstructured":"Bierman, G.M.: A computational interpretation of the \u03bb\u03bc-calculus. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 336\u2013345. Springer, Heidelberg (1998)"},{"issue":"1\u20132","key":"17_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0304-3975(99)00302-3","volume":"234","author":"G. Boudol","year":"2000","unstructured":"Boudol, G.: On the semantics of the call-by-name CPS transform. Theoretical Computer Science\u00a0234(1\u20132), 309\u2013321 (2000)","journal-title":"Theoretical Computer Science"},{"key":"#cr-split#-17_CR10.1","doi-asserted-by":"crossref","unstructured":"Danvy, O., Nielsen, L.R.: Refocusing in reduction semantics. Research Report BRICS RS-04-26, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark (November 2004);","DOI":"10.7146\/brics.v11i26.21851"},{"key":"#cr-split#-17_CR10.2","unstructured":"A preliminary version appears in the informal proceedings of the Second International Workshop on Rule-Based Programming (RULE 2001), Electronic Notes in Theoretical Computer Science, vol. 59.4"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.2307\/2694930","volume":"66","author":"R. David","year":"2001","unstructured":"David, R., Py, W.: \u03bb\u03bc-calculus and B\u00f6hm\u2019s theorem. Journal of Symbolic Logic\u00a066(1), 407\u2013413 (2001)","journal-title":"Journal of Symbolic Logic"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-58216-9_27","volume-title":"Logic Programming and Automated Reasoning","author":"P. Groote de","year":"1994","unstructured":"de Groote, P.: On the relation between the lambda-mu-calculus and the syntactic theory of sequential control. In: Pfenning, F. (ed.) LPAR 1994. LNCS, vol.\u00a0822, pp. 31\u201343. Springer, Heidelberg (1994)"},{"issue":"2","key":"17_CR13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/FI-1992-16205","volume":"16","author":"L. Egidi","year":"1992","unstructured":"Egidi, L., Honsell, F., Ronchi della Rocca, S.: Operational, denotational and logical descriptions: a case study. Fundamenta Informaticae\u00a016(2), 149\u2013169 (1992)","journal-title":"Fundamenta Informaticae"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Felleisen, M.: \u03bb-v-CS: An extended \u03bb-calculus for scheme. In: Proceedings of the 1988 ACM Conference on LISP and Functional Programming, pp. 72\u201385 (1988)","DOI":"10.1145\/62678.62686"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M. Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science\u00a0103, 235\u2013271 (1992)","journal-title":"Theoretical Computer Science"},{"key":"17_CR16","first-page":"245","volume-title":"Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages","author":"D.P. Friedman","year":"1985","unstructured":"Friedman, D.P., Haynes, C.T.: Constraining control. In: Deusen, M.S.V., Galil, Z. (eds.) Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, January 1985, pp. 245\u2013254. ACM Press, New York (1985)"},{"issue":"1\u20132","key":"17_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0304-3975(98)00353-3","volume":"228","author":"A.D. Gordon","year":"1999","unstructured":"Gordon, A.D.: Bisimilarity as a theory of functional programming. Theoretical Computer Science\u00a0228(1\u20132), 5\u201347 (1999)","journal-title":"Theoretical Computer Science"},{"key":"17_CR18","unstructured":"Gordon, A.D., Pitts, A.M. (eds.): Higher Order Operational Techniques in Semantics. Publications of the Newton Institute, Cambridge University Press (1998)"},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D.J. Howe","year":"1996","unstructured":"Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Information and Computation\u00a0124(2), 103\u2013112 (1996)","journal-title":"Information and Computation"},{"key":"17_CR20","first-page":"222","volume":"62","author":"B. Jacobs","year":"1997","unstructured":"Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science\u00a062, 222\u2013259 (1997)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Jagadeesan, R., Pitcher, C., Riely, J.: Open bisimulation for aspects (2009) (Long version, to appear)","DOI":"10.1007\/978-3-642-02059-9_3"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1010051815785","volume":"11","author":"R. Kelsey","year":"1998","unstructured":"Kelsey, R., Clinger, W., Rees, J. (eds.): Revised5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation\u00a011(1), 7\u2013105 (1998)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Koutavas, V., Wand, M.: Bisimulations for untyped imperative objects. In: Sestoft [56], pp. 146\u2013161","DOI":"10.1007\/11693024_11"},{"key":"17_CR24","unstructured":"Koutavas, V., Wand, M.: Reasoning about class behavior. In: FOOL\/WOOD 2007 Workshop (January 2007)"},{"key":"17_CR25","series-title":"SIGPLAN Notices","first-page":"141","volume-title":"Proceedings of the Thirty-Third Annual ACM Symposium on Principles of Programming Languages","author":"V. Koutavas","year":"2006","unstructured":"Koutavas, V., Wand, M.: Small bisimulations for reasoning about higher-order imperative programs. In: Peyton Jones, S. (ed.) Proceedings of the Thirty-Third Annual ACM Symposium on Principles of Programming Languages, Charleston, South Carolina, January 2006. SIGPLAN Notices, vol.\u00a041(1), pp. 141\u2013152. ACM Press, New York (2006)"},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/LICS.1997.614931","volume-title":"Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science","author":"J. Laird","year":"1997","unstructured":"Laird, J.: Full abstraction for functional languages with control. In: Winskel, G. (ed.) Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 1997, pp. 58\u201367. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-540-73420-8_58","volume-title":"Automata, Languages and Programming","author":"J. Laird","year":"2007","unstructured":"Laird, J.: A fully abstract trace semantics for general references. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 667\u2013679. Springer, Heidelberg (2007)"},{"issue":"4","key":"17_CR28","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"Landin, P.J.: The mechanical evaluation of expressions. The Computer Journal\u00a06(4), 308\u2013320 (1964)","journal-title":"The Computer Journal"},{"key":"17_CR29","unstructured":"Lassen, S.B.: Bisimulation up to context for imperative lambda calculus. Unpublished note. Presented at The Semantic Challenge of Object-Oriented Programming, Schloss Dagstuhl (1998)"},{"key":"17_CR30","first-page":"345","volume-title":"Proceedings of the Twentieth Annual IEEE Symposium on Logic in Computer Science","author":"S.B. Lassen","year":"2005","unstructured":"Lassen, S.B.: Eager normal form bisimulation. In: Panangaden, P. (ed.) Proceedings of the Twentieth Annual IEEE Symposium on Logic in Computer Science, June 2005, pp. 345\u2013354. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"17_CR31","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"445","volume-title":"Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXI)","author":"S.B. Lassen","year":"2005","unstructured":"Lassen, S.B.: Normal form simulation for McCarty\u2019s amb. In: Escard\u00f3, M., Jung, A., Mislove, M. (eds.) Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXI), May 2005. Electronic Notes in Theoretical Computer Science, vol.\u00a0155, pp. 445\u2013465. Elsevier Science Publishers, Amsterdam (2005)"},{"key":"17_CR32","first-page":"297","volume-title":"Proceedings of the Twenty-First Annual IEEE Symposium on Logic in Computer Science","author":"S.B. Lassen","year":"2006","unstructured":"Lassen, S.B.: Head normal form bisimulation for pairs and the \u03bb\u03bc-calculus (extended abstract). In: Alur, R. (ed.) Proceedings of the Twenty-First Annual IEEE Symposium on Logic in Computer Science, August 2006, pp. 297\u2013306. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Lassen, S.B.: Relational reasoning about contexts. In: Gordon and Pitts [18], pp. 91\u2013135","DOI":"10.7146\/brics.v4i24.18950"},{"key":"17_CR34","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"346","volume-title":"Proceedings of the 15th Annual Conference on Mathematical Foundations of Programming Semantics","author":"S.B. Lassen","year":"1999","unstructured":"Lassen, S.B.: Bisimulation in untyped lambda calculus: B\u00f6hm trees and bisimulation up to context. In: Brookes, S., Jung, A., Mislove, M., Scedrov, A. (eds.) Proceedings of the 15th Annual Conference on Mathematical Foundations of Programming Semantics, April 1999. Electronic Notes in Theoretical Computer Science, vol.\u00a020, pp. 346\u2013374. Elsevier Science Publishers, Amsterdam (1999)"},{"key":"17_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-74915-8_23","volume-title":"Computer Science Logic","author":"S.B. Lassen","year":"2007","unstructured":"Lassen, S.B., Levy, P.B.: Typed normal form bisimulation. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 283\u2013297. Springer, Heidelberg (2007)"},{"key":"17_CR36","first-page":"341","volume-title":"Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science","author":"S.B. Lassen","year":"2008","unstructured":"Lassen, S.B., Levy, P.B.: Typed normal form bisimulation for parametric polymorphism. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, pp. 341\u2013352. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"17_CR37","unstructured":"Levy, P.B.: Game semantics using function inventories. Talk given at Geometry of Computation 2006, Marseille (2006)"},{"issue":"3","key":"17_CR38","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1017\/S0956796800000125","volume":"1","author":"I.A. Mason","year":"1991","unstructured":"Mason, I.A., Talcott, C.L.: Equivalence in functional languages with effects. Journal of Functional Programming\u00a01(3), 297\u2013327 (1991)","journal-title":"Journal of Functional Programming"},{"key":"17_CR39","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"307","volume-title":"Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXII)","author":"M. Merro","year":"2006","unstructured":"Merro, M., Biasi, C.: On the observational theory of the CPS-calculus (extended abstract). In: Brookes, S., Mislove, M. (eds.) Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXII), May 2006. Electronic Notes in Theoretical Computer Science, vol.\u00a0158, pp. 307\u2013330. Elsevier Science Publishers, Amsterdam (2006)"},{"key":"17_CR40","first-page":"157","volume-title":"Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages","author":"A.R. Meyer","year":"1988","unstructured":"Meyer, A.R., Sieber, K.: Towards fully abstract semantics for local variables: Preliminary report. In: Ferrante, J., Mager, P. (eds.) Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, January 1988, pp. 157\u2013169. ACM Press, New York (1988)"},{"key":"17_CR41","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The Definition of Standard ML (Revised)","author":"R. Milner","year":"1997","unstructured":"Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML (Revised). The MIT Press, Cambridge (1997)"},{"key":"17_CR42","first-page":"275","volume-title":"Visions of Computer Science, Proc. BCS International Academic Research Conference","author":"P.D. Mosses","year":"2008","unstructured":"Mosses, P.D.: Component-based description of programming languages. In: Visions of Computer Science, Proc. BCS International Academic Research Conference, pp. 275\u2013286. BCS, London (2008)"},{"key":"17_CR43","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569869","volume-title":"Action Semantics","author":"P.D. Mosses","year":"1992","unstructured":"Mosses, P.D.: Action Semantics. Cambridge Tracts in Theoretical Computer Science, vol.\u00a0(26). Cambridge University Press, Cambridge (1992)"},{"key":"17_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-61550-4_139","volume-title":"Mathematical Foundations of Computer Science 1996","author":"P.D. Mosses","year":"1996","unstructured":"Mosses, P.D.: Theory and practice of action semantics. In: Penczek, W., Sza\u0142as, A. (eds.) MFCS 1996. LNCS, vol.\u00a01113, pp. 37\u201361. Springer, Heidelberg (1996)"},{"key":"17_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: \u03bb\u03bc-calculus: an algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 190\u2013201. Springer, Heidelberg (1992)"},{"key":"17_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-54345-7_82","volume-title":"Mathematical Foundations of Computer Science 1991","author":"R.P. Perez","year":"1991","unstructured":"Perez, R.P.: An extensional partial combinatory algebra based on \u03bb-terms. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol.\u00a0520, pp. 387\u2013396. Springer, Heidelberg (1991)"},{"key":"17_CR47","first-page":"173","volume-title":"Algol-Like Languages, ch. 17","author":"A.M. Pitts","year":"1997","unstructured":"Pitts, A.M.: Reasoning about local variables with operationally-based logical relations. In: O\u2019Hearn, P.W., Tennent, R.D. (eds.) Algol-Like Languages, ch. 17, vol.\u00a02, pp. 173\u2013193. Birkhauser, Basel (1997); Reprinted from Proceedings Eleventh Annual IEEE Symposium on Logic in Computer Science, pp. 152\u2013163 (1996)"},{"key":"17_CR48","unstructured":"Pitts, A.M., Stark, I.D.B.: Operational reasoning for functions with local state. In: Gordon and Pitts [18], pp. 227\u2013273"},{"key":"17_CR49","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the \u03bb-calculus. Theoretical Computer Science\u00a01, 125\u2013159 (1975)","journal-title":"Theoretical Computer Science"},{"key":"17_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BFb0014067","volume-title":"Typed Lambda Calculi and Applications","author":"E. Ritter","year":"1995","unstructured":"Ritter, E., Pitts, A.M.: A fully abstract translation between a \u03bb-calculus with reference types and Standard ML. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, pp. 397\u2013413. Springer, Heidelberg (1995)"},{"key":"#cr-split#-17_CR51.1","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh (1992);"},{"key":"#cr-split#-17_CR51.2","unstructured":"LFCS report ECS-LFCS-93-266 (also published as CST-99-93)"},{"key":"17_CR52","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Informatica\u00a033, 69\u201397 (1996), ftp:\/\/ftp-sop.inria.fr\/mimosa\/personnel\/davides\/sub.ps.gz","journal-title":"Acta Informatica"},{"key":"17_CR53","doi-asserted-by":"crossref","first-page":"691","DOI":"10.7551\/mitpress\/5641.003.0033","volume-title":"Proof, language, and interaction: essays in honour of Robin Milner","author":"D. Sangiorgi","year":"2000","unstructured":"Sangiorgi, D.: Lazy functions and mobile processes. In: Proof, language, and interaction: essays in honour of Robin Milner, pp. 691\u2013720. MIT Press, Cambridge (2000)"},{"issue":"1","key":"17_CR54","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":"17_CR55","first-page":"293","volume-title":"Proceedings of the Twenty-Second Annual IEEE Symposium on Logic in Computer Science","author":"D. Sangiorgi","year":"2007","unstructured":"Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: Ong, C.L. (ed.) Proceedings of the Twenty-Second Annual IEEE Symposium on Logic in Computer Science, Wroclaw, Poland, July 2007, pp. 293\u2013302. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"17_CR56","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages and Systems","year":"2006","unstructured":"Sestoft, P. (ed.): ESOP 2006. LNCS, vol.\u00a03924. Springer, Heidelberg (2006)"},{"key":"17_CR57","unstructured":"St\u00f8vring, K.: On Reasoning Equationally: Lambda Calculi and Programs with Computational Effects. PhD thesis, BRICS PhD School, University of Aarhus, Aarhus, Denmark (August 2007)"},{"key":"17_CR58","series-title":"SIGPLAN Notices","first-page":"161","volume-title":"Proceedings of the Thirty-Fourth Annual ACM Symposium on Principles of Programming Languages","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: Felleisen, M. (ed.) Proceedings of the Thirty-Fourth Annual ACM Symposium on Principles of Programming Languages, Nice, France, January 2007. SIGPLAN Notices, vol.\u00a042(1), pp. 161\u2013172. ACM Press, New York (2007)"},{"key":"17_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-642-00590-9_18","volume-title":"ESOP 2009","author":"E. Sumii","year":"2009","unstructured":"Sumii, E.: A theory of non-monotone memory (or: Contexts for free). In: Castagna, G. (ed.) ESOP 2009. LNCS, vol.\u00a05502, pp. 237\u2013251. Springer, Heidelberg (2009)"},{"key":"17_CR60","doi-asserted-by":"crossref","unstructured":"Sumii, E.: A complete characterization of observational equivalence in polymorphic lambda-calculus with general references (manuscript) (January 2009)","DOI":"10.1007\/978-3-642-04027-6_33"},{"key":"17_CR61","series-title":"SIGPLAN Notices","first-page":"63","volume-title":"Proceedings of the Thirty-Second Annual ACM Symposium on Principles of Programming Languages","author":"E. Sumii","year":"2005","unstructured":"Sumii, E., Pierce, B.C.: A bisimulation for type abstraction and recursion. In: Abad\u00ed, M. (ed.) Proceedings of the Thirty-Second Annual ACM Symposium on Principles of Programming Languages, Long Beach, California, January 2005. SIGPLAN Notices, vol.\u00a040(1), pp. 63\u201374. ACM Press, New York (2005)"},{"key":"17_CR62","unstructured":"Talcott, C.: Reasoning about functions with effects. In: Gordon and Pitts [18], pp. 347\u2013390"},{"key":"17_CR63","unstructured":"Vytiniotis, D., Koutavas, V.: Relating step-indexed logical relations and bisimulations. Technical Report MSR-TR-2009-25, Microsoft Research, Cambridge (March 2009)"},{"key":"17_CR64","first-page":"386","volume-title":"Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Programming Languages","author":"M. Wand","year":"1997","unstructured":"Wand, M., Sullivan, G.T.: Denotational semantics using an operationally-based term model. In: Jones, N.D. (ed.) Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Programming Languages, France, January 1997, pp. 386\u2013399. ACM Press, New York (1997)"}],"container-title":["Lecture Notes in Computer Science","Semantics and Algebraic Specification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04164-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T09:38:48Z","timestamp":1710581928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04164-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041631","9783642041648"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04164-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}