{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:56:25Z","timestamp":1768560985396,"version":"3.49.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997,1]]},"abstract":"<jats:p>We present an actor language which is an extension of a simple\n \n\nfunctional language, and \n\nprovide an operational semantics for this extension. Actor configurations\n \n\nrepresent open \n\ndistributed systems, by which we mean that the specification of an actor\n system \n\nexplicitly \n\ntakes into account the interface with external components. We study the\n \n\ncomposability of \n\nsuch systems. We define and study various notions of testing equivalence\n on \n\nactor expressions \n\nand configurations. The model we develop provides fairness. An important\n result \n\nis that the \n\nthree forms of equivalence, namely, convex, must, and may equivalences,\n collapse \n\nto two in \n\nthe presence of fairness. We further develop methods for proving laws of\n \n\nequivalence and \n\nprovide example proofs to illustrate our methodology.<\/jats:p>","DOI":"10.1017\/s095679689700261x","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:26:15Z","timestamp":1027761975000},"page":"1-72","source":"Crossref","is-referenced-by-count":269,"title":["A foundation for actor computation"],"prefix":"10.1017","volume":"7","author":[{"given":"GUL A.","family":"AGHA","sequence":"first","affiliation":[]},{"given":"IAN A.","family":"MASON","sequence":"additional","affiliation":[]},{"given":"SCOTT F.","family":"SMITH","sequence":"additional","affiliation":[]},{"given":"CAROLYN L.","family":"TALCOTT","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[1997,1,1]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S095679689700261X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T15:27:18Z","timestamp":1553959638000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S095679689700261X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S095679689700261X"],"URL":"https:\/\/doi.org\/10.1017\/s095679689700261x","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}