{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:10:02Z","timestamp":1751983802436,"version":"3.41.2"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order and Symbolic Computation"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1023\/a:1010064516533","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T00:56:42Z","timestamp":1040605002000},"page":"177-208","source":"Crossref","is-referenced-by-count":12,"title":["The \u03c0-Calculus in Direct Style"],"prefix":"10.1007","volume":"11","author":[{"given":"G\u00e9rard","family":"Boudol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"187568_CR1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"S. ABRAMSKY, C.-H.L. ONG, Full abstraction in the lazy lambda-calculus, Information and Computation 105 (1993) 159-267.","journal-title":"Information and Computation"},{"key":"187568_CR2","doi-asserted-by":"crossref","unstructured":"R. AMADIO, L. LETH, B. THOMSEN, From a concurrent \u03bb-calculus to the \u03c0-calculus, FCT'95, Lecture Notes in Comput. Sci. 965 (1995) 106-115.","DOI":"10.1007\/3-540-60249-6_43"},{"key":"187568_CR3","doi-asserted-by":"crossref","unstructured":"R. AMADIO, I. CASTELLANI, D. SANGIORGI, On bisimulations for the asynchronous \u03c0-calculus, CONCUR'96, Lecture Notes in Comput. Sci. 1119 (1996) 147-162.","DOI":"10.1007\/3-540-61604-7_53"},{"key":"187568_CR4","doi-asserted-by":"crossref","unstructured":"R. AMADIO, An asynchronous model of locality, failure, and process mobility, COORDINATION'97, Lecture Notes in Comput. Sci. 1282 (1997).","DOI":"10.1007\/3-540-63383-9_92"},{"key":"187568_CR5","doi-asserted-by":"crossref","unstructured":"A. APPEL, Compiling with Continuations, Cambridge University Press (1992).","DOI":"10.1017\/CBO9780511609619"},{"key":"187568_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"G. BERRY, G. BOUDOL, The chemical abstract machine, Theoretical Comput. Sci. 96 (1992) 217-248.","journal-title":"Theoretical Comput. Sci."},{"key":"187568_CR7","doi-asserted-by":"crossref","unstructured":"M. BOREALE, On the expressiveness of internal mobility in name-passing calculi, CONCUR'96, Lecture Notes in Comput. Sci. 1119 (1996) 163-178.","DOI":"10.1007\/3-540-61604-7_54"},{"key":"187568_CR8","doi-asserted-by":"crossref","unstructured":"G. BOUDOL, Towards a lambda-calculus for concurrent and communicating systems, TAPSOFT 89, Lecture Notes in Comput. Sci. 351 (1989) 149-161.","DOI":"10.1007\/3-540-50939-9_130"},{"key":"187568_CR9","unstructured":"G. BOUDOL, Asynchrony and the \u03c0-calculus, INRIA Res. Report 1702 (1992)."},{"key":"187568_CR10","doi-asserted-by":"crossref","unstructured":"G. BOUDOL, The \u03bb-calculus with multiplicities, INRIA Res. Report 2025 (1993).","DOI":"10.1007\/3-540-57208-2_1"},{"key":"187568_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1006\/inco.1994.1003","volume":"108","author":"G. Boudol","year":"1994","unstructured":"G. BOUDOL, Lambda-calculi for (strict) parallel functions, Information and Computation 108 (1994) 51-127.","journal-title":"Information and Computation"},{"key":"187568_CR12","doi-asserted-by":"crossref","unstructured":"G. BOUDOL, Typing the use of resources in a concurrent calculus, ASIAN'97, Lecture Notes in Comput. Sci. 1345 (1997) 239-253.","DOI":"10.1007\/3-540-63875-X_56"},{"key":"187568_CR13","unstructured":"G. BOUDOL, C. LANEVE, \u03bb-Calculus, multiplicities and the \u03c0-calculus, INRIA Res. Report 2581 (1995) to appear in Essays in Honour of Robin Milner (G. Plotkin, C. Stirling and M. Tofte Eds), MIT Press."},{"key":"187568_CR14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/inco.1996.0037","volume":"126","author":"G. Boudol","year":"1996","unstructured":"G. BOUDOL, C. LANEVE, The discriminating power of multiplicities in the \u03bb-calculus, Information and Computation 126 (1996) 83-102.","journal-title":"Information and Computation"},{"key":"187568_CR15","unstructured":"W. FERREIRA, M. HENNESY, A. JEFFREY, Combining typed \u03bb-calculus with CCS, to appear in Essays in Honour of Robin Milner (G. Plotkin, C. Stirling and M. Tofte Eds), MIT Press (1998)."},{"key":"187568_CR16","doi-asserted-by":"crossref","unstructured":"C. FOURNET, G. GONTHIER, The reflexive cham, and the join calculus, POPL'96 (1996) 372-385.","DOI":"10.1145\/237721.237805"},{"key":"187568_CR17","unstructured":"C. FOURNET, L. MARANGET, The Join-Calculus language, release 1.01, available electronically, INRIA (June 1997)."},{"key":"187568_CR18","doi-asserted-by":"crossref","unstructured":"A. GIACALONE, P. MISHRA, S. PRASAD, Facile: a symmetric integration of concurrent and functional programming, TAPSOFT'89, Lecture Notes in Comput. Sci. 352 (1989) 184-209.","DOI":"10.1007\/3-540-50940-2_36"},{"key":"187568_CR19","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01019463","volume":"6","author":"R. Harper","year":"1993","unstructured":"R. HARPER, M. LILLIBRIDGE, Polymorphic type assignment and cps conversion, LISP and Symbolic Computation 6 (1993) 361-380.","journal-title":"LISP and Symbolic Computation"},{"issue":"3","key":"187568_CR20","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1017\/S0956796897002748","volume":"7","author":"J. Hatcliff","year":"1997","unstructured":"J. HATCLIFF, O. DANVY, Thunks and the \u03bb-calculus, J. of Functional Programming Vol 7 No 3 (1997) 303-320.","journal-title":"J. of Functional Programming"},{"issue":"2","key":"187568_CR21","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/127070.127079","volume":"2","author":"K. Honda","year":"1991","unstructured":"K. HONDA, M. TOKORO, A small calculus for concurrent objects, OOPS Messenger Vol 2 No 2, ACM Press (1991) 50-54.","journal-title":"OOPS Messenger"},{"issue":"3","key":"187568_CR22","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/365230.365257","volume":"9","author":"P.J. Landin","year":"1966","unstructured":"P.J. LANDIN, The Next 700 Programming Languages, CACM Vol. 9 No. 3 (1966) 157-164.","journal-title":"CACM"},{"key":"187568_CR23","doi-asserted-by":"crossref","unstructured":"J. LAUNCHBURY, A natural semantics for lazy evaluation, POPL'93 (1993) 144-154.","DOI":"10.1145\/158511.158618"},{"key":"187568_CR24","doi-asserted-by":"crossref","unstructured":"M. MERRO, D. SANGIORGI, On asynchrony in name-passing calculi, ICALP'98, Lecture Notes in Comput. Sci. 1443 (1998).","DOI":"10.1007\/BFb0055108"},{"key":"187568_CR25","doi-asserted-by":"crossref","unstructured":"A.R. MEYER, M. WAND, Continuation semantics in typed lambda-calculi, Lecture Notes in Comput. Sci. 193 (1985) 219-224.","DOI":"10.1007\/3-540-15648-8_17"},{"key":"187568_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. MILNER, J. PARROW, D. WALKER, A calculus of mobile processes, Information and Computation 100 (1992) 1-77.","journal-title":"Information and Computation"},{"key":"187568_CR27","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"R. MILNER, Functions as processes, Math. Struct. in Comp. Science 2 (1992) 119-141. Preliminary version in INRIA Res. Report 1154.","journal-title":"Math. Struct. in Comp. Science"},{"key":"187568_CR28","doi-asserted-by":"crossref","unstructured":"R. MILNER, The polyadic \u03c0-calculus: a tutorial, Technical Report ECS-LFCS-91-180, Edinburgh University (1991) Reprinted in Logic and Algebra of Specification, F. Bauer, W. Brauer and H. Schwichtenberg, Eds, Springer Verlag, 1993, 203-246.","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"187568_CR29","doi-asserted-by":"crossref","unstructured":"C. MURTHY, A computational analysis of Girard's translation and LC, LICS'92 (1992) 90-101.","DOI":"10.1109\/LICS.1992.185523"},{"key":"187568_CR30","unstructured":"M. ODERSKY, Applying \u03c0: towards a basis for concurrent imperative programming, Proc. 2nd ACM SIGPLAN Workshop on State in Programming Languages (1995)."},{"key":"187568_CR31","unstructured":"G. OSTHEIMER, A. DAVIE, \u03c0-calculus characterizations of some practical \u03bb-calculus reduction strategies, Techn. Report CS\/93\/14, University of St Andrews (1993)."},{"key":"187568_CR32","unstructured":"B. PIERCE, Programming in the \u03c0-calculus - An experiment in concurrent language design, Version 3.6k, available electronically, Computer Lab. Cambridge (1995)."},{"key":"187568_CR33","unstructured":"B. PIERCE, Programming in the \u03c0-calculus - A Tutorial Introduction to Pict, Version 4.0, available electronically, Computer Science Department, Indiana University, (March 1997)."},{"key":"187568_CR34","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G. Plotkin","year":"1975","unstructured":"G. PLOTKIN, Call-by-name, call-by-value and the \u03bb-calculus, Theoret. Comput. Sci. 1 (1975) 125-159.","journal-title":"Theoret. Comput. Sci."},{"key":"187568_CR35","first-page":"293","volume":"26","author":"J.H. Reppy","year":"1991","unstructured":"J.H. REPPY, CML: a higher-order concurrent language, ACM SIGPLAN'91 PLDI Conference, SIGPLAN Notices 26 (1991) 293-305.","journal-title":"CML: a higher-order concurrent language"},{"key":"187568_CR36","unstructured":"D. SANGIORGI, Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, PhD Thesis, Department of Computer Science, The University of Edinburgh (1993)."},{"key":"187568_CR37","doi-asserted-by":"crossref","unstructured":"D. SANGIORGI, From \u03c0-calculus to higher-order \u03c0-calculus - and back, TAPSOFT'93, Lecture Notes in Comput. Sci. 668 (1993) 151-166.","DOI":"10.1007\/3-540-56610-4_62"},{"key":"187568_CR38","unstructured":"D. SANGIORGI, Lazy functions and mobile processes, INRIA Res. Rep. 2515 (1995) to appear in Essays in Honour of Robin Milner (G. Plotkin, C. Stirling and M. Tofte Eds), MIT Press."},{"key":"187568_CR39","doi-asserted-by":"crossref","unstructured":"G. SMOLKA, A foundation for higher-order concurrent constraint programming, in Constraints in Computational Logics,Lecture Notes in Comput. Sci. 845 (1994) 50-72.","DOI":"10.1007\/BFb0016844"},{"key":"187568_CR40","doi-asserted-by":"crossref","unstructured":"C. TALCOTT, ED., Special Issue on Continuations, LISP and Symbolic Computation 6 & 7 (1993).","DOI":"10.1007\/BF01019458"},{"key":"187568_CR41","unstructured":"D. TURNER, The Polymorphic Pi-calculus: Theory and Implementation, Ph.D. Thesis, University of Edinburgh (1995)."},{"key":"187568_CR42","doi-asserted-by":"crossref","unstructured":"V. VASCONCELOS, K. HONDA, Principal typing schemes in a polyadic \u03c0-calculus, CONCUR'93, Lecture Notes in Comput. Sci. 715 (1993) 524-538.","DOI":"10.1007\/3-540-57208-2_36"},{"key":"187568_CR43","doi-asserted-by":"crossref","unstructured":"N. YOSHIDA, Graph types for monadic mobile processes, FST-TCS'96, Lecture Notes in Comput. Sci. 1180 (1996) 371-386.","DOI":"10.1007\/3-540-62034-6_64"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010064516533.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1010064516533\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010064516533.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T13:48:00Z","timestamp":1751982480000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1010064516533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["187568"],"URL":"https:\/\/doi.org\/10.1023\/a:1010064516533","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"type":"print","value":"1388-3690"},{"type":"electronic","value":"1573-0557"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}