{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T23:05:04Z","timestamp":1779836704554,"version":"3.53.1"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1998,9]]},"abstract":"<jats:p>Concurrent ML (CML) is an extension of Standard ML of New Jersey\n with concurrent \nfeatures similar to those of process algebra. In this paper, we build upon\n John Reppy's \nreduction semantics for CML by constructing a compositional operational\n semantics for a \nfragment of CML, based on higher-order process algebra. Using the operational\n semantics we \ngeneralise the notion of weak bisimulation equivalence to build a semantic\n theory of CML. \nWe give some small examples of proofs about CML expressions, and show that\n our semantics \ncorresponds to Reppy's up to weak first-order bisimulation.<\/jats:p>","DOI":"10.1017\/s0956796898003165","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:26:15Z","timestamp":1027761975000},"page":"447-491","source":"Crossref","is-referenced-by-count":18,"title":["A theory of weak bisimulation for Core CML"],"prefix":"10.1017","volume":"8","author":[{"given":"WILLIAM","family":"FERREIRA","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"MATTHEW","family":"HENNESSY","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"ALAN","family":"JEFFREY","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[1998,9,1]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796898003165","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T22:34:53Z","timestamp":1779834893000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796898003165\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":0,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0956796898003165"],"URL":"https:\/\/doi.org\/10.1017\/s0956796898003165","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}