{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:53:37Z","timestamp":1773482017413,"version":"3.50.1"},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540528261","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032030","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"167-180","source":"Crossref","is-referenced-by-count":51,"title":["Functions as processes"],"prefix":"10.1007","author":[{"given":"Robin","family":"Milner","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Abramsky, S., The Lazy Lambda Calculus, to appear in Declarative Programming, ed. D. Turner, Addison Wesley, 1988."},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(84)90102-6","volume":"33","author":"E. Astesiano","year":"1984","unstructured":"Astesiano, E. and Zucca, E., Parametric channels via Label Expressions in CCS, Journal of Theor. Comp. Science, Vol 33, pp45\u201364, 1984.","journal-title":"Journal of Theor. Comp. Science"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"33","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A. and Klop, J-W., Algebra of Communicating Processes with Abstraction, Journal of Theor. Comp. Science, Vol 33, pp77\u2013121, 1985.","journal-title":"Journal of Theor. Comp. Science"},{"key":"14_CR4","unstructured":"Berry, G., Mod\u00e8les Compl\u00e8tement Ad\u00e9quats et Stables des lambda-calcul typ\u00e9s, Th\u00e8se se Doctorat d'Etat, Universit\u00e9 Paris VII, 1979."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Berry, G. and Boudol, G., The Chemical Abstract Machine, to appear in Proc 17th Annual Symposium on Principles of Programming Languages, 1990.","DOI":"10.1145\/96709.96717"},{"key":"14_CR6","first-page":"149","volume":"351","author":"G. Boudol","year":"1989","unstructured":"Boudol, G., Towards a Lambda-Calculus for Concurrent and Communicating Systems, Proc TAPSOFT 1989, Lecture Notes in Computer Science 351, Springer-Verlag, pp149\u2013161, 1989.","journal-title":"Proc TAPSOFT 1989, Lecture Notes in Computer Science"},{"key":"14_CR7","unstructured":"Curry, H.B. and Feys, R., Combinatory Logic, Vol 1, North Holland, 1958."},{"key":"14_CR8","unstructured":"Clinger, W.D., Foundations of Actor Semantics, AI-TR-633, MIT Artificial Intelligence Laboratory, 1981."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Engberg, U. and Nielsen, M., A Calculus of Communicating Systems with Labelpassing, Report DAIMI PB-208, Computer Science Department, University of Aarhus, 1986.","DOI":"10.7146\/dpb.v15i208.7559"},{"key":"14_CR10","first-page":"111","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y., Linear Logic, Journal of Theoretical Science, Vol 50, pp111\u2013102, 1987.","journal-title":"Journal of Theoretical Science"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R., Communicating Sequential Processes, Prentice Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"14_CR12","first-page":"1","volume":"5","author":"R. Milner","year":"1977","unstructured":"Milner, R., Fully Abstract Models of Typed Lambda-calculi, Journal of Theoretical Science, Vol 5, pp1\u201323, 1977.","journal-title":"Journal of Theoretical Science"},{"key":"14_CR13","unstructured":"Milner, R., Communication and Concurrency, Prentice Hall, 1989."},{"key":"14_CR14","series-title":"Internal Report","volume-title":"Functions as Processes","author":"R. Milner","year":"1989","unstructured":"Milner, R., Functions as Processes, Internal Report, INRIA, Sophia Antipolis, December 1989."},{"key":"14_CR15","unstructured":"Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes, Parts I and II, Report ECS-LFCS-89-85 and-86, Laboratory for Foundations of Computer Science, Computer Science Department, Edinburgh University, 1989."},{"key":"14_CR16","volume-title":"The Typed \u03bb-calculus with First-class Processes, Report ID-TR:1988-43","author":"F. Nielsen","year":"1988","unstructured":"Nielsen, F., The Typed \u03bb-calculus with First-class Processes, Report ID-TR:1988-43, Inst. for Datateknik, Tekniske Hojskole, Lyngby, Denmark, 1988."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Ong, C-H.L., Fully Abstract Models of the Lazy Lambda Calculus, Proc 29th Symposium on Foundations of Computer Science, pp368\u2013376, 1988.","DOI":"10.1109\/SFCS.1988.21953"},{"key":"14_CR18","first-page":"125","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D., Call-by-name and Call-by-value and the \u03bb-calculus, Journal of Theoretical Science, Vol 1, pp125\u2013159, 1975.","journal-title":"Journal of Theoretical Science"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Thomsen, B., A Calculus of Higher-order Communicating Systems, Proc 16th Annual Symposium on Principles of Programming Languages, pp143\u2013154, 1989.","DOI":"10.1145\/75277.75290"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T21:20:01Z","timestamp":1683321601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0032030","relation":{},"subject":[]}}