{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T21:48:54Z","timestamp":1723758534352},"reference-count":27,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T00:00:00Z","timestamp":1236124800000},"content-version":"unspecified","delay-in-days":6120,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[1992,6]]},"abstract":"This paper exhibits accurate encodings of the \u03bb-calculus in the \u03c0-calculus. The former is canonical for calculation with functions, while the latter is a recent step (Milner et al.<\/jats:italic> 1989) towards a canonical treatment of concurrent processes. With quite simple encodings, two \u03bb-calculus reduction strategies are simulated very closely; each reduction in \u03bb-calculus is mimicked by a short sequence of reductions in \u03c0-calculus. Abramsky's precongruence of applicative bisimulation<\/jats:italic> (Abramsky 1989) over \u03bb-calculus is compared with that induced by the encoding of the lazy \u03bb-calculus into \u03c0-calculus; a similar comparison is made for call-by-value \u03bb-calculus.<\/jats:p>","DOI":"10.1017\/s0960129500001407","type":"journal-article","created":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T04:02:25Z","timestamp":1236139345000},"page":"119-141","source":"Crossref","is-referenced-by-count":308,"title":["Functions as processes"],"prefix":"10.1017","volume":"2","author":[{"given":"Robin","family":"Milner","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2009,3,4]]},"reference":[{"key":"S0960129500001407_ref027","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54415-1_63"},{"key":"S0960129500001407_ref024","unstructured":"Stoughton A. (1989), Private communication."},{"key":"S0960129500001407_ref019","volume-title":"Proc PARLE 89","volume":"366","author":"Nielson","year":"1989"},{"key":"S0960129500001407_ref007","volume-title":"Combinatory Logic","volume":"1","author":"Curry","year":"1958"},{"key":"S0960129500001407_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-50939-9_130"},{"key":"S0960129500001407_ref005","doi-asserted-by":"crossref","unstructured":"Berry G. and Boudol G. (1990), The Chemical Abstract Machine, Proc 17th Annual Symposium on Principles of Programming Languages.","DOI":"10.1145\/96709.96717"},{"key":"S0960129500001407_ref004","volume-title":"Mod\u00e8les Compl\u00e8tement Ad\u00e9quats et Stables des lambda-calcul typ\u00e9s","author":"Berry","year":"1979"},{"key":"S0960129500001407_ref001","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96712"},{"key":"S0960129500001407_ref021","unstructured":"Ong C-H.L. (1990), Operational extensionality of Plotkin's pure untyped call-by-value calculus \u03bb\u03bd, Unpublished memorandum."},{"key":"S0960129500001407_ref016","volume-title":"Functions as Processes","volume":"1154","author":"Milner","year":"1990"},{"key":"S0960129500001407_ref022","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"S0960129500001407_ref011","doi-asserted-by":"publisher","DOI":"10.1145\/2455.2460"},{"key":"S0960129500001407_ref012","first-page":"235","volume-title":"Proc IJCAI","author":"Hewitt","year":"1973"},{"key":"S0960129500001407_ref014","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"S0960129500001407_ref017","volume-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"S0960129500001407_ref018","volume-title":"A Calculus of Mobile Processes, Parts I and II","author":"Milner","year":"1989"},{"key":"S0960129500001407_ref013","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90033-9"},{"key":"S0960129500001407_ref008","unstructured":"Clinger W.D. (1981), Foundations of Actor Semantics, Ph.D. thesis, Massachusetts Institute of Technology, Artificial Intelligence Lab Technical Report \u00a3633, May 1981. Reprinted in: Towards Open Information Systems Science, Hewitt C.E., Manning C.R., Inman J.T. and Agha G. (eds.), Cambridge, MA: MIT Press, Spring 1991."},{"key":"S0960129500001407_ref025","unstructured":"Thomsen B. (1989), A Calculus of Higher-order Communicating Systems, Proc 16th Annual Symposium on Principles of Programming Languages, pp. 143\u2013154."},{"key":"S0960129500001407_ref015","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90053-6"},{"key":"S0960129500001407_ref026","unstructured":"Thomsen B. (1990) A Calculi for Higher-order Communicating Systems, PhD Thesis, Department of Computing, Imperial College, London."},{"key":"S0960129500001407_ref020","unstructured":"Ong C-H.L. (1988), Fully Abstract Models of the Lazy Lambda Calculus, Proc 29th Symposium on Foundations of Computer Science, pp. 368\u2013376."},{"key":"S0960129500001407_ref003","volume-title":"The Lambda Calculus, Its Syntax and Semantics","volume":"103","author":"Barendregt","year":"1981"},{"key":"S0960129500001407_ref002","first-page":"65\u2013116","volume-title":"Research Topics in Functional Programming","author":"Abramsky","year":"1989"},{"key":"S0960129500001407_ref010","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"S0960129500001407_ref009","doi-asserted-by":"crossref","DOI":"10.7146\/dpb.v15i208.7559","volume-title":"A Calculus of Communicating Systems with Label-passing","author":"Engberg","year":"1986"},{"key":"S0960129500001407_ref023","unstructured":"Sangiorgi D. (1992), Forthcoming PhD thesis, University of Edinburgh."}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129500001407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:40:08Z","timestamp":1558028408000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129500001407\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["S0960129500001407"],"URL":"https:\/\/doi.org\/10.1017\/s0960129500001407","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}