{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:51Z","timestamp":1761611151611},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1995,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper we use the chemical abstract machine (CHAM) framework [BeB90, BeB92, Bou94] for discussing various semantics for the Facile programming language [GMP89, GMP90, FAR93] and for formalising (parts of) its implementations. We use these formal descriptions to argue (informally) about implementability and cost of implementation in terms of low level machinery needed to implement the given semantics.<\/jats:p>\n          <jats:p>We take the Facile language as source for discussion, but the results also apply to several other new languages such as CML [Rep91, BMT92] and Poly\/ML [Mat91]. Characteristic for all these languages is that they combine ideas from the \u03bb-calculus and process algebra, such as CCS [Mil80, Mil89], to support high level constructs for programming concurrent, parallel and\/or distributed systems.<\/jats:p>\n          <jats:p>The full version of this extended summary can be found in [LeT94].<\/jats:p>","DOI":"10.1007\/bf01211076","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T15:57:58Z","timestamp":1109260678000},"page":"314-328","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Some facile chemistry"],"prefix":"10.1145","volume":"7","author":[{"given":"Lone","family":"Leth","sequence":"first","affiliation":[{"name":"European Computer-Industry Research Centre, Arabellastr. 17, D-81925, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bent","family":"Thomsen","sequence":"additional","affiliation":[{"name":"European Computer-Industry Research Centre, Arabellastr. 17, D-81925, Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"crossref","unstructured":"Andreoli J.-M. Leth L. Pareschi R. Thomsen B.: True Concurrency Semantics for a Linear Logic Programming Language with Broadcast Communication pp. 182\u2013198 Proceedings of TAPSOFT'93 LNCS 668 Springer-Verlag 1993.","DOI":"10.1007\/3-540-56610-4_64"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"crossref","unstructured":"Berry G. Boudol G.: The Chemical Abstract Machine in Proceedings of POPL'90 1990.","DOI":"10.1145\/96709.96717"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90185-I"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"crossref","unstructured":"Berry D. Milner R. Turner D.N.: A semantics for ML concurrency primitives in Proceedings of POPL'92 pp. 119\u2013129 1992.","DOI":"10.1145\/143165.143191"},{"key":"e_1_2_1_2_5_2","unstructured":"Birman K. P. Joseph T. & Schmuck F.: ISIS \u2014 A Distributed Programming Environment Version 2.1 \u2014 User's Guide and Reference Manual July 1987."},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"crossref","unstructured":"Birman K.: The Process group Approach to Reliable Distributed Computing Communication of the ACM December 1993.","DOI":"10.21236\/ADA256787"},{"key":"e_1_2_1_2_7_2","doi-asserted-by":"crossref","unstructured":"Boudol G.: Some Chemical Abstract Machines Note INRIA Sophia-Antipolis 1994.","DOI":"10.1007\/3-540-58043-3_18"},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90069-8"},{"issue":"2","key":"e_1_2_1_2_9_2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01491213","article-title":"Facile: a symmetric integration of concurrent and functional programming","volume":"18","author":"Giacalone A.","year":"1989","journal-title":"International Journal of Parallel Programming"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032073"},{"key":"e_1_2_1_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-17660-8_53"},{"key":"e_1_2_1_2_12_2","unstructured":"Kramer A. Cosquer F.: Distributing Facile MAGIC Note 12 ECRC 1991 5 ."},{"key":"e_1_2_1_2_13_2","unstructured":"Kuo T.-M.: Magic Facile version 0.3 MAGIC Note 22 ECRC 1992."},{"key":"e_1_2_1_2_14_2","first-page":"67","article-title":"Some Facile Chemistry","volume":"7","author":"Leth L.","year":"1994","journal-title":"Formal Aspects of Computing"},{"key":"e_1_2_1_2_15_2","unstructured":"Matthews D.: A Distributed Concurrent Implementation of Standard ML to appear in Proceedings of EurOpen Autumn 1991 Conference 1991."},{"key":"e_1_2_1_2_16_2","doi-asserted-by":"crossref","unstructured":"Milner R.: A Calculus of Communicating Systems Lecture Notes in Computer Science 92 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"e_1_2_1_2_17_2","unstructured":"Milner R.: Communication and Concurrency Prentice Hall 1989."},{"key":"e_1_2_1_2_18_2","doi-asserted-by":"crossref","unstructured":"Reppy J.H.: CML: a higher order concurrent language in Proceedings of SIGPLAN'91 Conference on Programming Language Design and Implementation pp. 293\u2013305 1991.","DOI":"10.1145\/113446.113470"},{"key":"e_1_2_1_2_19_2","unstructured":"Talpin J.-P.: The Calumet Experiment \u2014 Part I: An Implementation of Group-Communication Protocols in Facile Technical report ECRC-94-4 1994."},{"key":"e_1_2_1_2_20_2","doi-asserted-by":"crossref","unstructured":"Thomsen B. Leth L. Giacalone A.: Some Issues in the Semantics of Facile Distributed Programming Proceedings of the 1992 REX Workshop on Semantics: Foundations and Applications LNCS 666 Springer-Verlag 1992.","DOI":"10.1007\/3-540-56596-5_47"},{"key":"e_1_2_1_2_21_2","unstructured":"Thomsen B. Leth L. Prasad S. Kuo T.-S. Kramer A. Knabe F. Giacalone A: Facile Antigua Release \u2014 Programming Guide Technical report ECRC-93-20 1993."}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01211076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01211076\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01211076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:24:10Z","timestamp":1641482650000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01211076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["10.1007\/BF01211076"],"URL":"https:\/\/doi.org\/10.1007\/bf01211076","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}