{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:31:29Z","timestamp":1693866689991},"reference-count":39,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"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":5252,"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":[[1999,3]]},"DOI":"10.1016\/s0304-3975(98)00049-8","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"55-107","source":"Crossref","is-referenced-by-count":5,"title":["A behavioural theory of first-order CML"],"prefix":"10.1016","volume":"216","author":[{"given":"William","family":"Ferreira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00049-8_BIB1","series-title":"Proc. 14th Founcdations of Software Technology and Theoretical Computer Science","article-title":"Localities and failures","volume":"vol. 880","author":"Amadio","year":"1994"},{"issue":"4","key":"10.1016\/S0304-3975(98)00049-8_BIB2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01178776","article-title":"An algebra for process creation","volume":"29","author":"Baeten","year":"1992","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(98)00049-8_BIB3","article-title":"Process Algebra","volume":"vol. 18","author":"Baeten","year":"1990","journal-title":"Cambridge Tracts in Theoretical Computer Science"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB4","series-title":"Proc. 19th ACM Symp. on Principles of Programmings Languages","article-title":"A semantics for ML concurrency primitives","author":"Berry","year":"1992"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB5","series-title":"Proc. ISAAC '92","article-title":"Higher-order communicating processes with value-passing, assignment and return of results","volume":"vol. 650","author":"Bolignano","year":"1992"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB6","series-title":"Proc. AMAST '93","article-title":"A coherent type inference system for a concurrent, functional and imperative programming language","author":"Bolignano","year":"1993"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB7","series-title":"Proc. ICCI '93. IEEE","article-title":"A denotational model for the integration of concurrent, functional and imperative programmng","author":"Bolignano","year":"1993"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB8","series-title":"Proc. TACS '94","article-title":"A semantic theory for CML","volume":"vol. 789","author":"Bolignano","year":"1994"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB9","series-title":"Introduction to Lattices and Order","author":"Davey","year":"1990"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB10","article-title":"Int\u00e9gration des Paradigmes de Programmation Parall\u00e8le, Fonctionelle et Imp\u00e9rative: Fondements S\u00e9mantiques","author":"Debbabi","year":"1994"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","article-title":"Testing equivalences for processes","volume":"24","author":"De Nicola","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00049-8_BIB12","article-title":"Semantic Theories for Concurrent ML","author":"Ferreira","year":"1996"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB13","series-title":"Proc. MFCS '95","first-page":"454","article-title":"Towards a semantic theory of CML","volume":"vol. 969","author":"Ferreira","year":"1995"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB14","series-title":"ACM SIGPLAN Internat. Conf. on Functional Programming","article-title":"A theory of weak bisimulation for core CML","author":"Ferreira","year":"1996"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB15","series-title":"Proc. ICALP 90","first-page":"765","article-title":"Operational and algebraic semantics for facile: a symmetric integration of concurrent and functional programming","volume":"vol. 443","author":"Giacalone","year":"1993"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB16","series-title":"Semantics of Programming Languages","author":"Gunter","year":"1992"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB17","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-56939-1_101","article-title":"The Fork calculus: towards a logic for concurrent ML","author":"Havelund","year":"1994"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB18","doi-asserted-by":"crossref","unstructured":"K. Havelund, K. Larsen, The fork calculus, in: Proc. ICALP, Lecture Notes in Computer Sci., vol. 700, Springer, Berlin, pp. 544\u2013557.","DOI":"10.1007\/3-540-56939-1_101"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB19","series-title":"Algebraic Theory of Processes","author":"Hennessy","year":"1988"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB20","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/BF01178906","article-title":"Concurrent testing of processes","volume":"32","author":"Hennessy","year":"1995","journal-title":"Acta Inform."},{"issue":"2","key":"10.1016\/S0304-3975(98)00049-8_BIB21","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1006\/inco.1993.1067","article-title":"A theory of communicating processes with value-passing","volume":"107","author":"Hennessy","year":"1993","journal-title":"Inform. and Comput."},{"issue":"1","key":"10.1016\/S0304-3975(98)00049-8_BIB22","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for non-determinism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB23","article-title":"Semantic models for communicating processes with value passing","author":"Ing\u00f3lfsd\u00f3ttir","year":"1994"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB24","series-title":"Proc. LICS '95","first-page":"255","article-title":"A fully abstract semantics for a concurrent functional language with monadic types","author":"Jeffrey","year":"1995"},{"issue":"1","key":"10.1016\/S0304-3975(98)00049-8_BIB25","first-page":"157","article-title":"Compositional theories based on an operational semantics of contexts","volume":"155","author":"Larsen","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00049-8_BIB26","article-title":"Some facile chemistry","author":"Leth","year":"1992","journal-title":"ERCC Tech. Report ERCC-92-14"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB27","series-title":"The Foundations of Program Verification","author":"Loeckx","year":"1984"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB28","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB29","series-title":"The Definition of Standard ML","author":"Milner","year":"1990"},{"issue":"1","key":"10.1016\/S0304-3975(98)00049-8_BIB30","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","article-title":"Notions of computation and monads","volume":"93","author":"Moggi","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(98)00049-8_BIB31","doi-asserted-by":"crossref","unstructured":"F. Nielson, H.R. Nielson, From CML to process algebras, in: Proc. CONCUR '93, Lecture Notes in Computer Sci., vol. 715, Springer, Berlin, pp. 493\u2013508.","DOI":"10.1007\/3-540-57208-2_34"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB32","article-title":"From CML to process algebras","author":"Nielson","year":"1994","journal-title":"Theore. Computer Sci."},{"key":"10.1016\/S0304-3975(98)00049-8_BIB33","doi-asserted-by":"crossref","unstructured":"D.M.R. Park, Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Sci., vol. 104, Springer, Berlin, pp. 167\u2013183.","DOI":"10.1007\/BFb0017309"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB34","series-title":"Basic Category Theory for Computer Scientists","author":"Pierce","year":"1991"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB35","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-name, call-by-value and the lambda-calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00049-8_BIB36","author":"Plotkin","year":"1981","journal-title":"Lecture Notes in Domain Theory"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB37","series-title":"Tech. Report TR 92-1285","article-title":"Higher-order Concurrency","author":"Reppy","year":"1992"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB38","doi-asserted-by":"crossref","unstructured":"J.H. Reppy, Concurrent ML: design, application and semantics, in: Proc. Functional Programming, Concurrency, Simulation and Automated Reasoning, Lecture Notes in Computer Science, vol. 693, Springer, Berlin, pp. 165\u2013198.","DOI":"10.1007\/3-540-56883-2_10"},{"key":"10.1016\/S0304-3975(98)00049-8_BIB39","series-title":"Denotational Semantics","author":"Schmidt","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000498?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000498?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T19:17:56Z","timestamp":1580843876000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0304397598000498"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00049-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}