{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:14Z","timestamp":1725664154954},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606888"},{"type":"electronic","value":"9783540492627"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60688-2_42","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:51:55Z","timestamp":1330289515000},"page":"156-170","source":"Crossref","is-referenced-by-count":1,"title":["Combinatory formulations of concurrent languages"],"prefix":"10.1007","author":[{"given":"N.","family":"Raja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. K.","family":"Shyamasundar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Cardelli, L., Curien,P.L., Levy, J.J.: Explicit Substitutions, Proc. 17th ACM Annual Symposium on Principles of Programming Languages, (1990) 31\u201346.","DOI":"10.1145\/96709.96712"},{"key":"13_CR2","unstructured":"Barendregt, H.: Lambda Calculus, Studies in Logic, 103, North-Holland (1981)."},{"key":"13_CR3","unstructured":"Bernays, P.: \u00dcber eine nat\u00fcrliche Erweiterung des Relationenkalkuls, in A. Heyting, ed. Constructivity in Mathematics, North-Holland (1959)."},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"Berry, G., Boudol, G.: Chemical Abstract Machine, TCS 96 (1992) 217\u2013248.","journal-title":"TCS"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/3-540-50939-9_130","volume":"351","author":"G. Boudol","year":"1989","unstructured":"Boudol, G.: Towards a lambda-calculus for concurrent and communicating systems, Proc. TAPSOFT'89, LNCS 351 (1989) 149\u2013161.","journal-title":"Proc. TAPSOFT'89, LNCS"},{"key":"13_CR6","unstructured":"Boudol, G.: Asynchrony and the \u03c0-calculus, Research Report 1702, INRIA (1991)."},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N. Bruijn De","year":"1972","unstructured":"De Bruijn, N.: Lambda-Calculus Notation with Nameless Dummies, A Tool for Automatic Formula Manipulation, Indeg. Mat. 34 (1972) 381\u2013392.","journal-title":"Indeg. Mat."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., Yankelevich, D.: An Operational Framework for Value-Passing Processes, Proc. ACM Annual Symp. of Prog. Lang., (1994) 326\u2013338.","DOI":"10.1145\/174675.177941"},{"key":"13_CR9","unstructured":"Curien, P.-L.: Categorical Combinators, Sequential Algorithms and Functional Programming, Pitman (1986)."},{"key":"13_CR10","unstructured":"Curry, H.B., Feys, R.: Combinatory Logic, Vol. 1, North Holland (1958)."},{"key":"13_CR11","unstructured":"Hewitt, C., Bishop, P., Sterger, R.: A Universal Modulator Actor Formalism for Artificial Intelligence, Proc. IJCAI (1973) 235\u2013245."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Hoare, C.: Communicating Sequential Processes, Prentice-Hall (1985).","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N.: Combinatory Representation of Mobile Processes, Proc. ACM Annual Symposium of Programming Languages, ACM (1994) 348\u2013360.","DOI":"10.1145\/174675.177953"},{"key":"13_CR14","first-page":"786","volume":"789","author":"K. Honda","year":"1994","unstructured":"Honda, K., Yoshida, N.: Replication in Concurrent Combinators, Proc. TACS'94, LNCS 789 (1994) 786\u2013805.","journal-title":"Proc. TACS'94, LNCS"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/48022.48026","volume":"10","author":"R. Kennaway","year":"1988","unstructured":"Kennaway, R., Sleep, R.: Director Strings as Combinators, TOPLAS, 10, 4 (1988).","journal-title":"TOPLAS"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Lafont, Y.: Interaction Nets, POPL'90, ACM (1990) 95\u2013108.","DOI":"10.1145\/96709.96718"},{"key":"13_CR17","unstructured":"Milner, R.: Action Structures, Research Report LFCS-92-249, Edinburgh (1992)."},{"key":"13_CR18","unstructured":"Milner, R.: Communication and Concurrency, Prentice Hall (1989)."},{"key":"13_CR19","unstructured":"Milner, R.: Functions as processes, Research Report 1154, INRIA (1990)."},{"key":"13_CR20","unstructured":"Milner, R.: The polyadic \u03c0-calculus: a tutorial, Marktoberdorf (1991)."},{"key":"13_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (Parts I and II), Information and Computation 100 (1992) 1\u201377.","journal-title":"Information and Computation"},{"key":"13_CR22","unstructured":"Milner, R., Sangiorgi, D.: Barbed Bisimulation, ICALP'92, LNCS 623 (1992)."},{"issue":"4","key":"13_CR23","first-page":"324","volume":"24","author":"W.V. Quine","year":"1959","unstructured":"Quine, W.V.: Eliminating variables without applying functions to functions, Journal of Symbolic Logic 24, 4 (1959) 324\u2013325.","journal-title":"Journal of Symbolic Logic"},{"key":"13_CR24","unstructured":"Quine, W.V.: Variables Explained Away, Proc. American Philosophical Society, April 1960."},{"key":"13_CR25","unstructured":"Raja, N., Shyamasundar, R.K.: The Next 700 Combinatory Representations of Mobile Processes, TIFR Research Report, Bombay (1994)."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Raja, N., Shyamasundar, R.K.: The Quine-Bernays Combinatory Calculus, Int. Journal of Foundations of Comp. Sci., (to appear).","DOI":"10.1142\/S0129054195000226"},{"key":"13_CR27","unstructured":"Russell, B., Whitehead, A.N.: Principia Mathematica, Vols. 1,2,3, CUP (1912)."},{"key":"13_CR28","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01448013","volume":"92","author":"M. Sch\u00f6nfinkel","year":"1924","unstructured":"Sch\u00f6nfinkel, M.: \u00dcber die Bausteine der mathematischen Logik, Math. Annalen 92 (1924) 305\u2013316. English trans. with an introduction by W. V. Quine in J. van Heijenoort, ed., From Frege to G\u00f6del, Harvard Univ. Press (1967) 355\u2013366.","journal-title":"Math. Annalen"},{"key":"13_CR29","unstructured":"Thomsen, B.: Calculi for higher-order communicating systems, Ph.D. thesis, Imperial College (1990)."}],"container-title":["Lecture Notes in Computer Science","Algorithms, Concurrency and Knowledge"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60688-2_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:01:14Z","timestamp":1605646874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60688-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606888","9783540492627"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-60688-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}