{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:27:45Z","timestamp":1760819265388},"reference-count":41,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"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":4549,"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,2]]},"DOI":"10.1016\/s0304-3975(00)00097-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:01:59Z","timestamp":1027630919000},"page":"311-350","source":"Crossref","is-referenced-by-count":25,"title":["Asynchronous process calculi: the first- and higher-order paradigms"],"prefix":"10.1016","volume":"253","author":[{"given":"Davide","family":"Sangiorgi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00097-9_BIB1","series-title":"Research Topics in Functional Programming","first-page":"65","article-title":"The lazy lambda calculus","author":"Abramsky","year":"1989"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB2","series-title":"Actors","author":"Agha","year":"1986"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB3","series-title":"On bisimulations for the asynchronous \u03c0-calculus, Proc. CONCUR \u201996","volume":"vol. 1119","author":"Amadio","year":"1996"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB4","unstructured":"R.M. Amadio, L. Cardelli, Subtyping recursive types, ACM Trans. Program. Languages Systems 15 (4) (1993), 575\u2013631. A preliminary version appeared in POPL \u201991 and as DEC Systems Research Center Research Report Number 62, August 1990, pp. 104\u2013118."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB5","series-title":"On the expressiveness of internal mobility in name-passing calculi, Proc. CONCUR \u201996","volume":"vol. 1119","author":"Boreale","year":"1996"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB6","doi-asserted-by":"crossref","unstructured":"G. Boudol, Towards a lambda calculus for concurrent and communicating systems, TAPSOFT \u201989, Lecture Notes in Computer Science, vol. 351, pp. 149\u2013161, 1989.","DOI":"10.1007\/3-540-50939-9_130"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB7","unstructured":"G. Boudol, Asynchrony and the \u03c0-calculus, Tech. Rep. RR-1702, INRIA-Sophia Antipolis, 1992."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB8","series-title":"The pi-calculus in direct style, Proc. 24th POPL","author":"Boudol","year":"1997"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB9","doi-asserted-by":"crossref","unstructured":"J. Despeyroux, Higher-order specification of the pi-calculus, to appear in Proc. IFIP TCS \u20192000, Japan, August 2000.","DOI":"10.1007\/3-540-44929-9_30"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB10","doi-asserted-by":"crossref","unstructured":"W. Ferreira, M. Hennessy, A. Jeffrey, A theory of weak bisimulation for core CML, Tr 95:05, School of Cognitive and Computing Sciences, University of Sussex, 1995.","DOI":"10.1145\/232627.232649"},{"issue":"2","key":"10.1016\/S0304-3975(00)00097-9_BIB11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty processor","volume":"32","author":"Fischer","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB12","series-title":"The reflexive chemical abstract machine and the join calculus, Proc. 23rd POPL","author":"Fournet","year":"1996"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB13","series-title":"TAPSOFT \u201989","first-page":"189","article-title":"FACILE, a symmetric integration of concurrent and functional programming","volume":"vol. 352","author":"Giacalone","year":"1989"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB14","series-title":"Bisimilarity for a first-order calculus of objects with subtyping, Proc. 23rd POPL","author":"Gordon","year":"1996"},{"issue":"3","key":"10.1016\/S0304-3975(00)00097-9_BIB15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0004-3702(77)90033-9","article-title":"Viewing control structures as patterns of passing messages","volume":"8","author":"Hewitt","year":"1977","journal-title":"J. Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB16","unstructured":"K. Honda, Two bisimilarities for the \u03bd-calculus, Tech. Rep. 92-002, Keio University, 1992."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB17","series-title":"ECOOP \u201991 Workshop on Object Based Concurrent Programming, Geneva, Switzerland, 1991","first-page":"133","article-title":"An object calculus for asynchronous communications","volume":"vol. 512","author":"Honda","year":"1991"},{"issue":"2","key":"10.1016\/S0304-3975(00)00097-9_BIB18","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/127070.127079","article-title":"A small calculus for concurrent objects","volume":"2","author":"Honda","year":"1991","journal-title":"ACM OOPS Messanger"},{"issue":"2","key":"10.1016\/S0304-3975(00)00097-9_BIB19","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","article-title":"On reduction-based process semantics","volume":"152","author":"Honda","year":"1995","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(00)00097-9_BIB20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/inco.1996.0008","article-title":"Proving congruence of bisimulation in functional programming languages","volume":"124","author":"Howe","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB21","unstructured":"H. H\u00fcttel, J. Kleist, M. Merro, U. Nestmann, Migration=cloning; aliasing, to be presented at Sixth Workshop on Foundations of Object-Oriented Languages (FOOL 6), 1999."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB22","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1006\/inco.1993.1069","article-title":"Deciding bisimulation equivalences for a class of non-finite-state programs","volume":"107","author":"Jonsson","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB23","series-title":"On asynchrony in name-passing calculi, 25th ICALP","volume":"vol. 1443","author":"Merro","year":"1998"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB24","doi-asserted-by":"crossref","unstructured":"R. Milner, The polyadic \u03c0-calculus: a tutorial, Tech. Rep. ECS-LFCS-91-180, LFCS, Department of Computer Science Edinburgh University October 1991, Also in: F.L. Bauer, W. Brauer, H. Schwichtenberg (Eds.), Logic and Algebra of Specification, Springer, Berlin, 1993.","DOI":"10.1007\/978-3-642-58041-3_6"},{"issue":"2","key":"10.1016\/S0304-3975(00)00097-9_BIB25","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","article-title":"Functions as processes","volume":"2","author":"Milner","year":"1992","journal-title":"J. Math. Struct. Comp. Sci."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB26","series-title":"19th ICALP","first-page":"685","article-title":"Barbed bisimulation","volume":"vol. 623","author":"Milner","year":"1992"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB27","series-title":"Decoding choice encodings, Proc. CONCUR \u201996","volume":"vol. 1119","author":"Nestmann","year":"1996"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB28","series-title":"Comparing the expressive power of the synchronous and the asynchronous pi-calculus, Proc. 24th POPL","author":"Palamidessi","year":"1997"},{"issue":"2","key":"10.1016\/S0304-3975(00)00097-9_BIB29","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/inco.1995.1108","article-title":"Algebraic theories for name-passing calculi","volume":"120","author":"Parrow","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB30","unstructured":"B.C. Pierce, D.N. Turner, Pict: a programming language based on the pi-calculus, Tech. Rep. CSCI 476, Indiana University, 1997, in: Gordon Plotkin, Colin Stirling, and Mads Tofte (Eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner (Eds.) MIT Press, Cambridge, MA, to appear."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB31","doi-asserted-by":"crossref","unstructured":"J. Reppy. CML: a higher-order concurrent language, in: Programming Language Design and Implementation, SIGPLAN, ACM, 1991.","DOI":"10.1145\/113445.113470"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB32","unstructured":"D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms. Ph.D. thesis CST-99-93, Department of Computer Science, University of Edinburgh, 1992."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB33","unstructured":"D. Sangiorgi, Lazy functions and mobile processes. Tech. Rep. RR-2515, INRIA-Sophia Antipolis, 1995, in Festschrift volume in honor of Robin Milner's 60th birthday, MIT Press, New York, to appear."},{"issue":"2","key":"10.1016\/S0304-3975(00)00097-9_BIB34","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. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(00)00097-9_BIB35","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(96)00075-8","article-title":"\u03c0-calculus, internal mobility and agent-passing calculi","volume":"167","author":"Sangiorgi","year":"1996","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB36","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0304-3975(99)00040-7","article-title":"The name discipline of receptiveness","volume":"221","author":"Sangiorgi","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB37","unstructured":"D. Sangiorgi, Interpreting functions as pi-calculus processes: a tutorial, Revised version of TR RR-3470, INRIA-Sophia Antipolis, Available from the author's web page."},{"key":"10.1016\/S0304-3975(00)00097-9_BIB38","series-title":"Proc. CONCUR \u201992","first-page":"32","article-title":"The problem of Weak Bisimulation up to","volume":"vol. 630","author":"Sangiorgi","year":"1992"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB39","doi-asserted-by":"crossref","unstructured":"B. Thomsen, Calculi for higher order communicating systems, Ph.D. Thesis, Department of Computing, Imperial College, 1990.","DOI":"10.1145\/75277.75290"},{"key":"10.1016\/S0304-3975(00)00097-9_BIB40","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)00097-9_BIB41","series-title":"A Facile tutorial, Proc. CONCUR \u201996","volume":"vol. 1119","author":"Thomsen","year":"1996"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000979?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000979?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T21:15:35Z","timestamp":1620767735000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000979"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0304397500000979"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00097-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}