{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:26Z","timestamp":1761611186187},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648963"},{"type":"electronic","value":"9783540684558"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055628","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T03:31:00Z","timestamp":1153971060000},"page":"269-284","source":"Crossref","is-referenced-by-count":16,"title":["From rewrite to bisimulation congruences"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sewell","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"17_CR1","first-page":"36","volume-title":"A calculus for cryptographic protocols: The spi calculus","author":"M. Abadi","year":"1997","unstructured":"Mart\u00edn Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security, Z\u00fcrich, pages 36\u201347. ACM Press, April 1997."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"S. Abramsky and L. Ong. Full abstraction in the lazy lambda calculus. Information and Computation, 105:159\u2013267, 1993.","journal-title":"Information and Computation"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"G\u00e9rard Berry and G\u00e9rard Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217\u2013248, 1992.","journal-title":"Theoretical Computer Science"},{"key":"17_CR4","unstructured":"Karen L. Bernstein. A congruence theorem for structured operational semantics of higher-order languages. In Proceedings of LICS 98, 1998."},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232\u2013268, January 1995.","journal-title":"Journal of the ACM"},{"key":"17_CR6","unstructured":"Jean-Pierre Ban\u00e2tre and Daniel Le M\u00e9tayer. A new computational model and its discipline of programming. Technical Report 566, INRIA, 1986."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"G\u00e9rard Boudol. The \u03c0-calculus in direct style. In Proceedings of the 24th POPL, pages 228\u2013241, 15\u201317 January 1997.","DOI":"10.1145\/263699.263726"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Luca Cardelli and Andrew D. Gordon. Mobile ambients. In Proc. of Foundations of Software Science and Computation Structures (FoSSaCS), ETAPS'98, March 1998.","DOI":"10.1007\/BFb0053547"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"R. de Simone. Higher-level synchronising devices in Meije-SCCS. Theoretical Computer Science, 37:245\u2013267, 1985.","journal-title":"Theoretical Computer Science"},{"key":"17_CR11","volume-title":"Technical Report DAIMI PB-208","author":"U. Engberg","year":"1986","unstructured":"U. Engberg and M. Nielsen. A calculus of communicating systems with labelpassing. Technical Report DAIMI PB-208, Comp. Sc. Department, Univ. of Aarhus, Denmark, 1986."},{"key":"17_CR12","unstructured":"M. Felleisen and D. P. Friedman. Control operators, the SECD-machine and the \u03bb-calculus. In Formal Description of Programming Concepts III, pages 193\u2013217. North Holland, 1986."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"C\u00e9dric Fournet and Georges Gonthier. The reflexive CHAM and the join-calculus. In Proceedings of the 23rd POPL, pages 372\u2013385. ACM press, January 1996.","DOI":"10.1145\/237721.237805"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"William Ferreira, Matthew Hennessy, and Alan Jeffrey. A theory of weak bisimulation for core CML. In Proc. ACM SIGPLAN Int. Conf. Functional Programming. ACM Press, 1996.","DOI":"10.1145\/232627.232649"},{"key":"17_CR15","first-page":"278","volume":"458","author":"R. J. Glabbeek van","year":"1990","unstructured":"R. J. van Glabbeek. The linear time \u2014 branching time spectrum. In Proceedings of CONCUR '90, LNCS 458, pages 278\u2013297, 1990.","journal-title":"LNCS"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"R. J. van Glabbeek. The linear time \u2014 branching time spectrum II; the semantics of sequential systems with silent moves. In Proceedings of CONCUR'93, LNCS 715, pages 66\u201381, 1993.","DOI":"10.1007\/3-540-57208-2_6"},{"key":"17_CR17","unstructured":"Fabio Gadducci and Ugo Montanari. The tile model. In Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 1998. To appear."},{"key":"17_CR18","series-title":"minicourse. Number NS-95-3 in the BRICS Notes Series","volume-title":"Bisimilarity as a theory of functional programming","author":"A. D. Gordon","year":"1995","unstructured":"Andrew D. Gordon. Bisimilarity as a theory of functional programming. minicourse. Number NS-95-3 in the BRICS Notes Series, Computer Science Department, Aarhus, 1995."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Andrew D. Gordon and Gareth D. Rees. Bisimilarity for a first-order calculus of objects with subtyping. In Proceedings of the 23rd POPL, pages 386\u2013395, 1996.","DOI":"10.1145\/237721.237807"},{"issue":"2","key":"17_CR20","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202\u2013260, 1992.","journal-title":"Information and Computation"},{"key":"17_CR21","unstructured":"Douglas J. Howe. Equality in lazy computation systems. In Proceedings of LICS '89, pages 193\u2013203, 1989."},{"issue":"2","key":"17_CR22","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"152","author":"K. Honda","year":"1995","unstructured":"Kohei Honda and Nobuko Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437\u2013486, 1995.","journal-title":"Theoretical Computer Science"},{"key":"17_CR23","unstructured":"Ole H\u00d8gh Jensen. PhD thesis, University of Cambridge. Forthcoming, 1998."},{"key":"17_CR24","unstructured":"Alex Mifsud. Control Structures. PhD thesis, University of Edinburgh, 1996."},{"issue":"2","key":"17_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"Robin Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2(2):119\u2013141, 1992.","journal-title":"Journal of Mathematical Structures in Computer Science"},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s002360050067","volume":"33","author":"R. Milner","year":"1996","unstructured":"Robin Milner. Calculi for interaction. Acta Informatica, 33:707\u2013737, 1996.","journal-title":"Acta Informatica"},{"issue":"1","key":"17_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I + II. Information and Computation, 100(1): 1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"17_CR28","first-page":"685","volume":"623","author":"R. Milner","year":"1992","unstructured":"Robin Milner and Davide Sangiorgi. Barbed bisimulation. In Proceedings of 19th ICALP. LNCS 623, pages 685\u2013695, 1992.","journal-title":"LNCS"},{"key":"17_CR29","first-page":"171","volume":"1023","author":"J. Niehren","year":"1995","unstructured":"J. Niehren and M. Mueller. Constraints for free in concurrent computation. In Proceedings of the Asian Computer Science Conference, LNCS 1023, pages 171\u2013186, 1995.","journal-title":"LNCS"},{"key":"17_CR30","volume-title":"Technical Report DAIMI FN-19","author":"G. D. Plotkin","year":"1981","unstructured":"Gordon D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, 1981."},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"James Riely and Matthew Hennessy. A typed language for distributed mobile processes. In Proceedings of the 25th POPL, January 1998.","DOI":"10.1145\/268946.268978"},{"key":"17_CR32","unstructured":"Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1993."},{"key":"17_CR33","first-page":"391","volume":"1243","author":"P. Sewell","year":"1997","unstructured":"Peter Sewell. On implementations and semantics of a concurrent programming language. In Proceedings of CONCUR '97. LNCS 1243, pages 391\u2013405, 1997.","journal-title":"LNCS"},{"key":"17_CR34","unstructured":"Peter Sewell. From rewrite rules to bisimulation congruences. Technical Report 444, University of Cambridge, June 1998. Available from http:\/\/www.cl.cam.ac.uk\/users\/pes20\/."},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Peter Sewell. Global\/local subtyping and capability inference for a distributed \u03c0-calculus. In Proceedings of ICALP '98, LNCS, 1998.","DOI":"10.1007\/BFb0055094"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"D. Turi and G.D. Plotkin. Towards a mathematical operational semantics. In Proc. 12th LICS Conf., pages 280\u2013291. IEEE, Computer Society Press, 1997.","DOI":"10.1109\/LICS.1997.614955"},{"key":"17_CR37","volume-title":"PhD thesis","author":"F. Raamsdonk van","year":"1996","unstructured":"Femke van Raamsdonk. Confluence and Normalisation for Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, 1996."}],"container-title":["Lecture Notes in Computer Science","CONCUR'98 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055628","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T04:29:13Z","timestamp":1555734553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055628"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648963","9783540684558"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/bfb0055628","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}