{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:27:31Z","timestamp":1648610851252},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4337,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0304-3975(00)00378-9","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T16:53:12Z","timestamp":1036083192000},"page":"839-852","source":"Crossref","is-referenced-by-count":2,"title":["Recursive equations in higher-order process calculi"],"prefix":"10.1016","volume":"266","author":[{"given":"Mingsheng","family":"Ying","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Wirsing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00378-9_BIB1","doi-asserted-by":"crossref","unstructured":"G. Boudol, Towards a lambda calculus for concurrent and communicating systems, in: TAPSOFT\u201989, Lecture Notes in Computer Science, vol. 351, Springer, Berlin, 1989, pp. 149\u2013161.","DOI":"10.1007\/3-540-50939-9_130"},{"key":"10.1016\/S0304-3975(00)00378-9_BIB2","doi-asserted-by":"crossref","unstructured":"J.F. Groote, M.P.A. Sellink, Confluence for process verification, Theoret. Comput. Sci. 170 (1996) 47\u201381. For a more detailed version, see: Tech. Report 137, Logic Group Preprint Series, Utrecht University, June, 1995.","DOI":"10.1016\/S0304-3975(96)00175-2"},{"key":"10.1016\/S0304-3975(00)00378-9_BIB3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/inco.1994.1052","article-title":"A fully abstract denotational model for higher order processes","volume":"112","author":"Hennessy","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00378-9_BIB4","doi-asserted-by":"crossref","unstructured":"M. Hennessy, Higher-order processes and their models, in: Proc. of ICALP\u201994, Lecture Notes in Computer Science, vol. 820, Springer, Berlin, 1994, pp. 280\u2013303.","DOI":"10.1007\/3-540-58201-0_76"},{"key":"10.1016\/S0304-3975(00)00378-9_BIB5","series-title":"A Calculus of Communicating Systems","volume":"vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/S0304-3975(00)00378-9_BIB6","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(00)00378-9_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes, parts I and II","volume":"100","author":"Milner","year":"1992","journal-title":"Information Comput."},{"key":"10.1016\/S0304-3975(00)00378-9_BIB8","article-title":"Concurrency on automata and infinite sequences","volume":"vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(00)00378-9_BIB9","unstructured":"D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D. Thesis, Department of Computer Science, University of Edinburgh, 1992."},{"key":"10.1016\/S0304-3975(00)00378-9_BIB10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1006\/inco.1996.0096","article-title":"Bisimulation for higher-order process calculi","volume":"131","author":"Sangiorgi","year":"1996","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00378-9_BIB11","doi-asserted-by":"crossref","unstructured":"B. Thomsen, A calculus of higher order communicating systems, in: Proceedings of POPL\u201989, ACM Press, New York, 1989, pp. 143\u2013154.","DOI":"10.1145\/75277.75290"},{"key":"10.1016\/S0304-3975(00)00378-9_BIB12","unstructured":"B. Thomsen, Calculi for Higher Order Communicating Systems, Ph.D. Thesis, Department of Computing, Imperial College, 1990."},{"key":"10.1016\/S0304-3975(00)00378-9_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01200262","article-title":"Plain CHOCS, a second generation calculus for higher-order processes","volume":"30","author":"Thomsen","year":"1993","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00378-9_BIB14","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1006\/inco.1995.1004","article-title":"A theory of higher order communicating systems","volume":"116","author":"Thomsen","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00378-9_BIB15","doi-asserted-by":"crossref","unstructured":"B. Thomsen, S. Abramsky, A fully abstract denotational semantics for the calculus of higher order communicating systems, Theoret. Comput. Sci., in press.","DOI":"10.1016\/S0304-3975(00)00281-4"},{"key":"10.1016\/S0304-3975(00)00378-9_BIB16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0304-3975(98)00187-X","article-title":"A shorter proof to uniqueness of solutions of equations","volume":"216","author":"Ying","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00378-9_BIB17","doi-asserted-by":"crossref","unstructured":"M.S. Ying, Weak confluence and \u03c4-inertness, Theoret. Comput. Sci. 238 (2000).","DOI":"10.1016\/S0304-3975(99)00084-5"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003789?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003789?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T01:58:08Z","timestamp":1556330288000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0304397500003789"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00378-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}