{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:55Z","timestamp":1751983675982},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540509400"},{"type":"electronic","value":"9783540461180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50940-2_36","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:35:23Z","timestamp":1330202123000},"page":"184-209","source":"Crossref","is-referenced-by-count":15,"title":["FACILE: A symmetric integration of concurrent and functional programming"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Giacalone","sequence":"first","affiliation":[]},{"given":"Prateek","family":"Mishra","sequence":"additional","affiliation":[]},{"given":"Sanjiva","family":"Prasad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"12_CR1","unstructured":"ADA Reference Manual. 1983. In Ellis Horowitz, \u201cProgramming Languages: A Grand Tour\u201d."},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-17660-8_55","volume-title":"LNCS 249: TAPSOFT '87","author":"E. Astesiano","year":"1987","unstructured":"Egidio Astesiano and Gianna Regio. SMoLCS-Driven Concurrent Calculi. In LNCS 249: TAPSOFT '87, pages 169\u2013201, Springer-Verlag, Berlin, 1987."},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-15975-4_31","volume-title":"LNCS 201: Functional Programming Languages and Computer Architecture","author":"S. Abramsky","year":"1985","unstructured":"S. Abramsky and R. Sykes. Secd-m: a Virtual Machine for Applicative Programming. In Jean-Pierre Jouannaud, editor, LNCS 201: Functional Programming Languages and Computer Architecture, pages 81\u201398, Springer-Verlag, Berlin, September 1985."},{"issue":"8","key":"12_CR4","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"John Backus. Can Programming Be Liberated from the von Neumann Style ? A Functional Style and Its Algebra of Programs. Communications of the ACM, 21(8):613\u2013641, August 1978.","journal-title":"Communications of the ACM"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A Theory of Communicating Sequential Processes. Journal of the ACM, 31(3):560\u2013599, July 1984.","journal-title":"Journal of the ACM"},{"volume-title":"LNCS 98: Towards a Formal Description of ADA. Lecture Notes in Computer Science","year":"1980","key":"12_CR6","unstructured":"D. Bjorner and O.N. Oest, editors. LNCS 98: Towards a Formal Description of ADA. Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1980."},{"key":"12_CR7","unstructured":"Luca Cardelli. The Functional Abstract Machine. Technical Report Technical Report TR-107, Bell Labs, 1983."},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/3-540-15670-4_20","volume-title":"LNCS 197: Proceedings of the Seminar on Concurrency","author":"L. Cardelli","year":"1985","unstructured":"Luca Cardelli. An Implementation Model of Rendezvous Communication. In LNCS 197: Proceedings of the Seminar on Concurrency, pages 449\u2013457, Springer-Verlag, Berlin, 1985."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Luca Cardelli. Amber. In Cousineau, Curien, and Robinet, editors, LNCS 242: Combinators and Functional Programming Languages, pages 21\u201347, Springer-Verlag, 1986.","DOI":"10.1007\/3-540-17184-3_38"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Luca Cardelli. The Amber Machine. In Cousineau, Curien, and Robinet, editors, LNCS 242: Combinators and Functional Programming Languages, pages 48\u201370, Springer-Verlag, 1986.","DOI":"10.1007\/3-540-17184-3_39"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"G. Cousineau, P. L. Curien, and M. Mauny. The Categorical Abstract Machine. In Proceedings of the IFIP Conference on Functional Programming Languages and Computer Architecture, IFIP, September 1985.","DOI":"10.1007\/3-540-15975-4_29"},{"key":"12_CR12","unstructured":"CHILL Language Definition: CCITT Recommendation Z. 200. volume 5 number 1 edition, January 1985."},{"key":"12_CR13","unstructured":"Alessandro Giacalone. A Concurrent Abstract Machine and an Interactive Environment for Simulating Concurrent Systems. Technical Report TR 87\/13, Dept. of Computer Science, SUNY at Stony Brook, December 1987."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Alessandro Giacalone and Scott A. Smolka. Integrated Environments for Formally Well-Founded Design and Simulation of Concurrent Systems: A Non-Procedural Approach. IEEE Transactions on Software Engineering, June 1988.","DOI":"10.1109\/32.6158"},{"key":"12_CR15","volume-title":"Functional Programming: Application and Implementation","author":"P. Henderson","year":"1980","unstructured":"Peter Henderson. Functional Programming: Application and Implementation. Prentice Hall International, London, 1980."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Peter Henderson. Purely Functional Operating Systems. In Darlington, Henderson, and Turner, editors, Functional Programming and its applications, pages 177\u2013192, Cambridge University Press, 1982.","DOI":"10.1145\/800068.802148"},{"key":"12_CR17","unstructured":"Matthew Hennessy. Algebraic Theory of Processes. MIT Press, 1988."},{"key":"12_CR18","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Series in Computer Science, Prentice-Hall, 1985."},{"key":"12_CR19","unstructured":"occam Programming Manual. 1984. Prentice-Hall International Series in Computer Science, C.A.R. Hoare (Series Editor)."},{"key":"12_CR20","unstructured":"Gilles Kahn. The Semantics of a Simple Language for Parallel Programming. In Proceedings of the IFIP Conference, pages 471\u2013475, IFIP, 1974."},{"key":"12_CR21","unstructured":"Robert Keller. Denotational Semantics for Parallel Programs with Indeterminate Operators. In E.J. Neuhold, editor, Formal Descriptions of Programming Concepts, pages 337\u2013366, North-Holland Publishing Company, 1978."},{"key":"12_CR22","unstructured":"Gilles Kahn and David MacQueen. Coroutines and Networks of Parallel Processes. IRIA Report 202, IRIA, November 1976."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"J. R. Kennaway and M. R. Sleep. Expressions as Processes. In Conference Record of the 1982 ACM Symposium on LISP and Functional Programming, pages 21\u201328, ACM, August 1982.","DOI":"10.1145\/800068.802131"},{"issue":"4","key":"12_CR24","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"P.J. Landin. The Mechanical Evaluation of Expressions. Computer Journal, 6(4):308\u2013320, 1964.","journal-title":"Computer Journal"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Robin Milner. A Calculus of Communicating Systems. Volume 92 of Lecture Notes in Computer Science, Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Robin Milner. A proposal for Standard ML. Internal Report CSR-157-83, University of Edinburgh, 1984.","DOI":"10.1145\/800055.802035"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Flemming Nielson. The Typed \u03bb-Calculus with First-Class Processes. June 1988. Extended Abstract.","DOI":"10.1007\/3-540-51285-3_52"},{"key":"12_CR28","unstructured":"G.D. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Aarhus University, September 1981."},{"key":"12_CR29","unstructured":"G.D. Plotkin. An Operational Semantics for CSP. Technical Report CSR-114-82, University of Edinburgh, May 1982."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"J.H. Reppy. Synchronous Operations as First-class Values. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, pages 250\u2013259, ACM SIGPLAN, June 1988.","DOI":"10.1145\/53990.54015"},{"issue":"5","key":"12_CR31","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1147\/rd.315.0556","volume":"31","author":"S. A. Smolka","year":"1987","unstructured":"Scott A. Smolka and Robert E. Strom. A CCS semantics for NIL. IBM Journal of Research and Development, 31(5):556\u2013570, September 1987.","journal-title":"IBM Journal of Research and Development"},{"key":"12_CR32","unstructured":"William Clinger et al. The Revised Revised Report on Scheme, or An UnCommon Lisp. AI Memo 848, MIT, Aug 1985."},{"key":"12_CR33","unstructured":"Niklaus Wirth. Programming in MODULA-2. Texts and Monographs in Computer Science, Springer-Verlag, second, corrected edition, 1982."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50940-2_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:42:24Z","timestamp":1640918544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50940-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540509400","9783540461180"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-50940-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}