{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:41:39Z","timestamp":1725468099674},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647812"},{"type":"electronic","value":"9783540686811"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055094","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T08:08:05Z","timestamp":1154419685000},"page":"695-706","source":"Crossref","is-referenced-by-count":29,"title":["Global\/local subtyping and capability inference for a distributed \u03c0-calculus"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sewell","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"59_CR1","first-page":"611","volume":"1281","author":"M. Abadi","year":"1997","unstructured":"Mart\u00edn Abadi. Secrecy by typing in security protocols. In TACS '97 (open lecture), LNCS 1281, pages 611\u2013638, September 1997.","journal-title":"LNCS"},{"key":"59_CR2","first-page":"36","volume-title":"A calculus for cryptographic protocols: The spi calculus","author":"M. Abadi","year":"1997","unstructured":"Mart\u00edn Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security, Z\u00fcrich, pages 36\u201347. ACM Press, April 1997."},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"R. M. Amadio. An asynchronous model of locality, failure, and process mobility. In Proc. COORDINATION 97, LNCS 1282, 1997.","DOI":"10.1007\/3-540-63383-9_92"},{"key":"59_CR4","doi-asserted-by":"crossref","unstructured":"R. M. Amadio and S. Prasad. Localities and failures. In P S. Thiagarajan, editor, Proceedings of 14 th FST and TCS Conference, FST-TCS'94. LNCS 880, pages 205\u2013216. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58715-2_126"},{"key":"59_CR5","volume-title":"Rapport de Recherche 1702","author":"G. Boudol","year":"1992","unstructured":"G\u00e9rard Boudol. Asynchrony and the \u03c0-calculus (note). Rapport de Recherche 1702, INRIA Sofia-Antipolis, May 1992."},{"key":"59_CR6","doi-asserted-by":"crossref","unstructured":"Luca Cardelli and Andrew D. Gordon. Mobile ambients. In Proc. of Foundations of Software Science and Computation Structures (FoSSaCS), ETAPS'98, March 1998.","DOI":"10.1007\/BFb0053547"},{"key":"59_CR7","doi-asserted-by":"crossref","unstructured":"Rocco De Nicola, GianLuigi Ferrari, and Rosario Pugliese. Coordinating mobile agents via blackboards and access rights. In Proc. COORDINATION '97, LNCS 1282, 1997.","DOI":"10.1007\/3-540-63383-9_83"},{"key":"59_CR8","doi-asserted-by":"crossref","unstructured":"C\u00e9dric Fournet and Georges Gonthier. The reflexive CHAM and the join-calculus. In Proceedings of the 23rd POPL, pages 372\u2013385. ACM press, January 1996.","DOI":"10.1145\/237721.237805"},{"key":"59_CR9","doi-asserted-by":"crossref","unstructured":"C\u00e9dric Fournet, Georges Gonthier, Jean-Jacques L\u00e9vy, Luc Maranget, and Didier R\u00e9my A calculus of mobile agents. In Proceedings of CONCUR '96. LNCS 1119, pages 406\u2013421. Springer-Verlag, August 1996.","DOI":"10.1007\/3-540-61604-7_67"},{"key":"59_CR10","doi-asserted-by":"crossref","unstructured":"Simon J. Gay. A sort inference algorithm for the polyadic \u03c0-calculus. In Proceedings of the 20th POPL. ACM Press, 1993.","DOI":"10.1145\/158511.158701"},{"key":"59_CR11","doi-asserted-by":"crossref","unstructured":"Nevin Heintze and Jon G. Riecke. The SLam calculus: Programming with secrecy and integrity. In Proceedings of the 25th POPL, January 1998.","DOI":"10.1145\/268946.268976"},{"key":"59_CR12","doi-asserted-by":"crossref","unstructured":"Kohei Honda and Mario Tokoro. On asynchronous communication semantics. In M. Tokoro, O. Nierstrasz, and P. Wegner, editors, Object-Based Concurrent Computing. LNCS 612, pages 21\u201351, 1992.","DOI":"10.1007\/3-540-55613-3_2"},{"key":"59_CR13","doi-asserted-by":"crossref","unstructured":"Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. In Proceedings of the 23rd POPL, pages 358\u2013371. ACM press, January 1996.","DOI":"10.1145\/237721.237804"},{"key":"59_CR14","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s002360050067","volume":"33","author":"R. Milner","year":"1996","unstructured":"Robin Milner. Calculi for interaction. Acta Informatica, 33:707\u2013737, 1996.","journal-title":"Acta Informatica"},{"issue":"1","key":"59_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I + II. Information and Computation, 100(1):1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"59_CR16","doi-asserted-by":"crossref","unstructured":"Hanne Riis Nielson and Flemming Nielson. Static and dynamic processor allocation for higher-order concurrent languages. In Proceedings of TAPSOFT 95 (FASE). LNCS 915, 1995.","DOI":"10.1007\/3-540-59293-8_222"},{"issue":"5","key":"59_CR17","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S096012950007002X","volume":"6","author":"B. Pierce","year":"1996","unstructured":"Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409\u2013454, 1996.","journal-title":"Mathematical Structures in Computer Science"},{"key":"59_CR18","doi-asserted-by":"crossref","unstructured":"James Riely and Matthew Hennessy. Distributed processes and location failures. In Proceedings of ICALP '97. LNCS 1256, pages 471\u2013481. Springer-Verlag, July 1997.","DOI":"10.1007\/3-540-63165-8_203"},{"key":"59_CR19","doi-asserted-by":"crossref","unstructured":"James Riely and Matthew Hennessy. A typed language for distributed mobile processes. In Proceedings of the 25th POPL, January 1998.","DOI":"10.1145\/268946.268978"},{"key":"59_CR20","first-page":"303","volume":"1256","author":"D. Sangiorgi","year":"1997","unstructured":"Davide Sangiorgi. The name discipline of uniform receptiveness. In Proceedings of ICALP '97. LNCS 1256, pages 303\u2013313, 1997.","journal-title":"Proceedings of ICALP '97. LNCS"},{"key":"59_CR21","unstructured":"Peter Sewell. Global\/local subtyping for a distributed \u03c0-calculus. Technical Report 435, University of Cambridge, August 1997. Available from http:\/\/www.cl.cam.ac.uk\/users\/pes20\/."},{"key":"59_CR22","doi-asserted-by":"crossref","unstructured":"Peter Sewell. On implementations and semantics of a concurrent programming language. In Proceedings of CONCUR '97. LNCS 1243, pages 391\u2013405. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63141-0_27"},{"key":"59_CR23","unstructured":"Paul Steckler. Detecting local channels in distributed Poly\/ML. Technical Report ECS-LFCS-96-340, University of Edinburgh, January 1996."},{"key":"59_CR24","doi-asserted-by":"crossref","unstructured":"Geoffrey Smith and Dennis Volpano. Secure information flow in a multi-threaded imperative language. In Proceedings of the 25th POPL, January 1998.","DOI":"10.1145\/268946.268975"},{"key":"59_CR25","doi-asserted-by":"crossref","unstructured":"Bent Thomsen, Lone Leth, and Tsung-Min Kuo. A Facile tutorial. In Proceedings of CONCUR '96. LNCS 1119, pages 278-298. Springer-Verlag, August 1996.","DOI":"10.1007\/3-540-61604-7_61"},{"key":"59_CR26","unstructured":"David N. Turner. The Polymorphic Pi-calculus: Theory and Implementation. PhD thesis, University of Edinburgh, 1996."},{"key":"59_CR27","first-page":"524","volume":"715","author":"V. T. Vasconcelos","year":"1993","unstructured":"Vasco Thudichum Vasconcelos and Kohei Honda. Principal typing schemes in a polyadic \u03c0-calculus. In Proceedings of CONCUR '93. LNCS 715, pages 524\u2013538, 1993.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T06:24:11Z","timestamp":1683527051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647812","9783540686811"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0055094","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}