{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:20:25Z","timestamp":1759033225501},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":6376,"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":[[1996,2]]},"DOI":"10.1016\/0304-3975(95)00017-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:48:18Z","timestamp":1027630098000},"page":"179-219","source":"Crossref","is-referenced-by-count":14,"title":["From CML to its process algebra"],"prefix":"10.1016","volume":"155","author":[{"given":"Flemming","family":"Nielson","sequence":"first","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00017-8_bib1","series-title":"Proc. POPL'92","first-page":"119","article-title":"A semantics for ML concurrency primitives","author":"Berry","year":"1992"},{"key":"10.1016\/0304-3975(95)00017-8_bib2","series-title":"Proc. ESOP'94","first-page":"89","article-title":"Programming with behaviours in an ML framework: the syntax and semantics of LCS","volume":"Vol. 788","author":"Berthomieu","year":"1994"},{"key":"10.1016\/0304-3975(95)00017-8_bib3","series-title":"Proc. AMAST'93","article-title":"A coherent type system for a concurrent, functional and imperative programming language","author":"Bolignano","year":"1993"},{"issue":"4","key":"10.1016\/0304-3975(95)00017-8_bib4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1017\/S0956796800000198","article-title":"A semantic basis for quest","volume":"1","author":"Cardelli","year":"1991","journal-title":"J. Funct. Programming"},{"key":"10.1016\/0304-3975(95)00017-8_bib5","series-title":"Proc. Lisp and Functional Programming","first-page":"182","article-title":"A calculus for overloaded functions with subtyping","author":"Castagna","year":"1992"},{"key":"10.1016\/0304-3975(95)00017-8_bib6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02011875","article-title":"A new type assignment for \u03bb-terms","volume":"19","author":"Coppo","year":"1978","journal-title":"Archiv. Math. Logik"},{"key":"10.1016\/0304-3975(95)00017-8_bib7","article-title":"\u03c0\u03bb-Kalk\u00fcle f\u00fcr Prozesse und Funktionen","author":"Crasemann","year":"1992"},{"key":"10.1016\/0304-3975(95)00017-8_bib8","series-title":"Introduction to Lattices and Order","author":"Davey","year":"1990"},{"key":"10.1016\/0304-3975(95)00017-8_bib9","series-title":"Formal Descriptions of Programming Concepts III","first-page":"193","article-title":"Control operators, the SECD-machine, and the \u03bb-calculus","author":"Felleisen","year":"1986"},{"key":"10.1016\/0304-3975(95)00017-8_bib10","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":"1990"},{"key":"10.1016\/0304-3975(95)00017-8_bib11","series-title":"Proc. ICALP '93","first-page":"544","article-title":"The fork calculus","volume":"Vol. 700","author":"Havelund","year":"1993"},{"key":"10.1016\/0304-3975(95)00017-8_bib12","first-page":"88","article-title":"Esprit basic research action 6454 \u2014 CONFER: CONcurrency and Functions: Evaluation and Reduction","volume":"Vol. 48","author":"J.-Levy","year":"1992","journal-title":"EATCS Bulletin"},{"key":"10.1016\/0304-3975(95)00017-8_bib13","series-title":"Proc. POPL'88","first-page":"47","article-title":"Polymorphic effect systems","author":"Lucassen","year":"1988"},{"key":"10.1016\/0304-3975(95)00017-8_bib14","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/0304-3975(95)00017-8_bib15_1","article-title":"The polyadic \u03c0-calculus: a tutorial","author":"Milner","year":"1991"},{"key":"10.1016\/0304-3975(95)00017-8_bib15_2","series-title":"Logic and Algebra of Specification","year":"1993"},{"key":"10.1016\/0304-3975(95)00017-8_bib16","series-title":"The Definition of Standard ML","author":"Milner","year":"1990"},{"key":"10.1016\/0304-3975(95)00017-8_bib17","series-title":"Proc. PARLE'89","first-page":"357","article-title":"The typed lambda-calculus with first-class processes","volume":"Vol. 366","author":"Nielson","year":"1989"},{"key":"10.1016\/0304-3975(95)00017-8_bib18","series-title":"Two-Level Functional Languages","author":"Nielson","year":"1992"},{"key":"10.1016\/0304-3975(95)00017-8_bib19","series-title":"Proc. CONCUR'93","first-page":"493","article-title":"From CML to process algebras (extended abstract)","volume":"Vol. 715","author":"Nielson","year":"1993"},{"key":"10.1016\/0304-3975(95)00017-8_bib20","series-title":"Proc. POPL'94","first-page":"84","article-title":"Higher-order concurrent programs with finite communication topology","author":"Nielson","year":"1994"},{"key":"10.1016\/0304-3975(95)00017-8_bib21","doi-asserted-by":"crossref","unstructured":"F. Nielson and H.R. Nielson, Constraints for polymorphic behaviours of concurrent ML, Proc. CCL'94, Springer Lecture Notes in Computer Science, Vol. 845 (Springer, Berlin,) 73\u201388.","DOI":"10.1007\/BFb0016845"},{"key":"10.1016\/0304-3975(95)00017-8_bib22","series-title":"Proc. PARLE'91","first-page":"202","article-title":"Concurrent clean","volume":"Vol. 506","author":"Nocker","year":"1991"},{"key":"10.1016\/0304-3975(95)00017-8_bib23","series-title":"Elements of Functional Programming","author":"Reade","year":"1989"},{"key":"10.1016\/0304-3975(95)00017-8_bib24","series-title":"Proc. PLDI'91","first-page":"293","article-title":"CML: a higher-order concurrent language","author":"Reppy","year":"1991"},{"key":"10.1016\/0304-3975(95)00017-8_bib25","article-title":"Higher-order concurrency","author":"Reppy","year":"1992"},{"key":"10.1016\/0304-3975(95)00017-8_bib26","series-title":"Proc. Functional Programming, Concurrency, Simulation and Automated Reasoning","first-page":"165","article-title":"Concurrent ML: design, application and semantics","volume":"Vol. 693","author":"Reppy","year":"1993"},{"key":"10.1016\/0304-3975(95)00017-8_bib27","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-57208-2_10","article-title":"A theory of bisimulation for the \u03c0-calculus","author":"Sangiorgi","year":"1993"},{"key":"10.1016\/0304-3975(95)00017-8_bib28","series-title":"Proc. LICS'92","first-page":"162","article-title":"The type and effect discipline","author":"Talpin","year":"1992"},{"key":"10.1016\/0304-3975(95)00017-8_bib29","series-title":"Proc. POPL'89","first-page":"143","article-title":"A calculus of higher order communicating systems","author":"Thomsen","year":"1989"},{"key":"10.1016\/0304-3975(95)00017-8_bib30","article-title":"Plain CHOCS","author":"Thomsen","year":"1989"},{"key":"10.1016\/0304-3975(95)00017-8_bib31","article-title":"Calculi for higher order communicating systems","author":"Thomsen","year":"1990"},{"key":"10.1016\/0304-3975(95)00017-8_bib32","article-title":"Polymorphic sorts and types for concurrent functional programs","author":"Thomsen","year":"1993","journal-title":"Technical report ECRC93-10"},{"key":"10.1016\/0304-3975(95)00017-8_bib33","doi-asserted-by":"crossref","DOI":"10.1006\/inco.1994.1093","article-title":"A syntactic approach to type soundness","author":"Wright","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000178?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000178?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:52:32Z","timestamp":1555404752000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0304397595000178"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00017-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}