{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:16:06Z","timestamp":1778249766026,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440437","type":"print"},{"value":"9783540456940","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45694-5_29","type":"book-chapter","created":{"date-parts":[[2007,10,5]],"date-time":"2007-10-05T03:44:18Z","timestamp":1191555858000},"page":"434-448","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["HOPLA\u2014A Higher-Order Process Language"],"prefix":"10.1007","author":[{"given":"Mikkel","family":"Nygaard","sequence":"first","affiliation":[]},{"given":"Glynn","family":"Winskel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"29_CR1","unstructured":"S. Abramsky. The lazy lambda calculus. In D. Turner (ed): Research Topics in Functional Programming. Addison-Wesley, 1990."},{"key":"29_CR2","unstructured":"L. Cardelli and A. D. Gordon. Anytime, anywhere. Modal logics for mobile ambients. In Proc. POPL\u201900."},{"key":"29_CR3","unstructured":"L. Cardelli and A. D. Gordon. A commitment relation for the ambient calculus. Note. October 6th, 2000."},{"key":"29_CR4","unstructured":"G. L. Cattani. Presheaf Models for Concurrency. BRICS Dissertation Series DS-99-1, 1999."},{"key":"29_CR5","unstructured":"G. L. Cattani, M. Fiore, and G. Winskel. Weak bisimulation and open maps. In Proc. LICS\u201999."},{"key":"29_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Presheaf models for the \u03c0-calculus","author":"G. L. Cattani","year":"1997","unstructured":"G. L. Cattani, I. Stark, and G. Winskel. Presheaf models for the \u03c0-calculus.In Proc. CTCS\u201997, LNCS 1290."},{"key":"29_CR7","unstructured":"G. L. Cattani and G. Winskel. Profunctors, open maps and bisimulation. Manuscript, 2000."},{"key":"29_CR8","unstructured":"A. D. Gordon and L. Cardelli. Equational properties of mobile ambients. In Proc. FoSSaCS\u201999."},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"A. D. Gordon. Bisimilarity as a theory of functional programming. In Proc. MFPS\u201995, ENTCS 1.","DOI":"10.1016\/S1571-0661(04)80013-6"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1006\/inco.1994.1052","volume":"112","author":"M. Hennessy","year":"1994","unstructured":"M. Hennessy. A fully abstract denotational model for higher-order processes. Information and Computation, 112(1):55\u201395, 1994.","journal-title":"Information and Computation"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D. J. Howe","year":"1996","unstructured":"D. J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103\u2013112, 1996.","journal-title":"Information and Computation"},{"key":"29_CR12","unstructured":"A. Jeffrey and J. Rathke. Towards a theory of bisimulation for local names. In Proc. LICS\u201999."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0168-0072(94)90069-8","volume":"70","author":"A. Joyal","year":"1994","unstructured":"A. Joyal and I. Moerdijk. A completeness theorem for open maps. Annals of Pure and Applied Logic, 70:51\u201386, 1994.","journal-title":"Annals of Pure and Applied Logic"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A. Joyal","year":"1996","unstructured":"A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Information and Computation, 127:164\u2013185, 1996.","journal-title":"Information and Computation"},{"key":"29_CR15","unstructured":"G. M. Kelly. Basic concepts of enriched category theory. London Math. Soc. Lecture Note Series 64, CUP, 1982."},{"key":"29_CR16","unstructured":"J. H. Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, MIT, December 1968."},{"key":"29_CR17","series-title":"Lect Notes Comput Sci","volume-title":"The typed \u03bb-calculus with first-class processes","author":"F. Nielson","year":"1989","unstructured":"F. Nielson. The typed \u03bb-calculus with first-class processes. In Proc. PARLE\u201989, LNCS 366."},{"key":"29_CR18","unstructured":"M. Nygaard and G. Winskel. Linearity in process languages. In Proc. LICS\u201902."},{"key":"29_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Concurrency and automata on infinite sequences","author":"D. Park","year":"1981","unstructured":"D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conference, LNCS 104, 1981."},{"key":"29_CR20","series-title":"Lect Notes Comput Sci","volume-title":"Observable properties of higher order functions that dynamically create local names","author":"A. M. Pitts","year":"1993","unstructured":"A. M. Pitts and I. D. B. Stark. Observable properties of higher order functions that dynamically create local names, or: What\u2019s new? In Proc. MFCS\u201993, LNCS 711."},{"key":"29_CR21","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"29_CR22","unstructured":"D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1992."},{"key":"29_CR23","unstructured":"B. Thomsen. A calculus of higher order communicating systems. In Proc. POPL\u201989."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2002 \u2014 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45694-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:50:12Z","timestamp":1778248212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45694-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440437","9783540456940"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45694-5_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}