{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:58:08Z","timestamp":1649073488608},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4288,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0661(04)80873-9","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"50-69","source":"Crossref","is-referenced-by-count":0,"title":["First\u2013order Semantics for Higher\u2013order Processes"],"prefix":"10.1016","volume":"41","author":[{"given":"Michael","family":"Baldamus","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB1","doi-asserted-by":"crossref","unstructured":"R. Amadio. On the Reduction of CHOCS Bisimulation to \u03c0-Calculus Bisimulation. In Concurrency Theory, LNCS 715, pages 112\u2013126. Springer-Verlag, 1993. Proceedings CONCUR conference.","DOI":"10.1007\/3-540-57208-2_9"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB2","doi-asserted-by":"crossref","unstructured":"R. Amadio and M. Dam. Reasoning about Higher\u2013order Processes. In Theory and Practice of Software Development, LNCS 915, pages 202\u2013216. Springer-Verlag, 1995. Proceedings TAPSOFT '95 conference.","DOI":"10.1007\/3-540-59293-8_196"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB3","doi-asserted-by":"crossref","unstructured":"E. Astesiano, A. Giovini, and G. Reggio. Generalized Bisimulation on Relational Specifications. In Theoretical Aspects of Computer Science, LNCS 295, pages 207\u2013226. Springer\u2013Verlag, 1988. Proceedings STACS symposium.","DOI":"10.1007\/BFb0035846"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB4","unstructured":"M. Baldamus. Semantics and Logic of Higher\u2013Order Procsesses: Characterizing Late Context Bisimulation. PhD thesis, computer science department, Berlin University of Technology, 1998."},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB5","doi-asserted-by":"crossref","unstructured":"M. Baldamus and J. Dingel. Modal Characterization of Weak Bisimulation for Higher\u2013order Processes (Extended Abstract). In Theory and Practice of Software Development, LNCS 1214, pages 285\u2013296. Springer\u2013Verlag, 1997. Proceedings TAPSOFT '97 conference.","DOI":"10.1007\/BFb0030604"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB6","doi-asserted-by":"crossref","unstructured":"L. Cardelli and A. Gordon. Mobile Ambients. In Foundations of Software Science and Computational Structures, LNCS 1378, pages 140\u2013155. Springer-Verlag, 1998. Proceedings FoSSaCS '98.","DOI":"10.1016\/S1571-0661(05)80699-1"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB7","first-page":"83","article-title":"Testing Equivalences for Processes","volume":"34","author":"De Nicola","year":"1983","journal-title":"The-oretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB8","doi-asserted-by":"crossref","unstructured":"M. Fiore, E. Moggi, and D. Sangiorgi. A Fully Abstract Model for the \u03c0-Calculus. In Logic in Computer Science, pages 43\u201354. IEEE Computer Society Press, 1996. Proceedings LICS symposium.","DOI":"10.1109\/LICS.1996.561302"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB9","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek. The Linear Time - Branching Time Spectrum II. In Concurrency Theory, LNCS 715, pages 66\u201381. Springer\u2013Verlag, 1993. Proceedings CONCUR conference.","DOI":"10.1007\/3-540-57208-2_6"},{"issue":"1","key":"10.1016\/S1571-0661(04)80873-9_NEWBIB10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/inco.1994.1052","article-title":"A Fully Abstract Denotational Model for Higher\u2013Order Processes","volume":"112","author":"Hennessy","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB11","doi-asserted-by":"crossref","unstructured":"D. Howe. Equality in Lazy Computation Systems. In Logic in Computer Science, pages 198\u2013203. IEEE Computer Society Press, 1989. Proceedings LICS '89 symposium.","DOI":"10.1109\/LICS.1989.39174"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB12","series-title":"Communication and Concurency","author":"Milner","year":"1989"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB13","doi-asserted-by":"crossref","unstructured":"R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, Parts I\/II. Information and Computation, 100:1\u201377, 1992. Journal version of two technical reports from 1989.","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB14","doi-asserted-by":"crossref","unstructured":"J. Rutten and D. Turi. Initial Algebra and Final Coalgebra Semantics for Concurrency. In A Decade of Concurrency \u2014 Reflections and Perspectives, LNCS 803, pages 530\u2013583. Springer\u2013Verlag, 1994. Proceedings REX school\/symposium.","DOI":"10.1007\/3-540-58043-3_28"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB15","unstructured":"D. Sangiorgi. Expressing Mobility in Process Algebras: First\u2013Order and Higher\u2013Order Paradigms. PhD Thesis CST\u201399\u201393, Department of Computer Science, The University of Edinburgh, 1993."},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB16","doi-asserted-by":"crossref","unstructured":"D. Sangiorgi. From \u03c0-Calculus to Higher-order \u03c0-Calculus - and Back. In Theory and Practice of Software Development, LNCS 668, pages 151\u2013161. Springer\u2013Verlag, 1993. Proceedings TAPSOFT conference.","DOI":"10.1007\/3-540-56610-4_62"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1006\/inco.1996.0096","article-title":"Bisimulation in Higher\u2013order Calculi","volume":"131","author":"Sangiorgi","year":"1996","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB18","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80873-9_NEWBIB19","doi-asserted-by":"crossref","unstructured":"B. Thomsen. A Calculus of Higher\u2013Order Communicating Systems. In Principles of Programming Languages, pages 143\u2013154. ACM, 1989. Proceedings POPL conference.","DOI":"10.1145\/75277.75290"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104808739?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104808739?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:10:15Z","timestamp":1585897815000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104808739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S1571066104808739"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80873-9","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}