{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:16:43Z","timestamp":1725574603827},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253884"},{"type":"electronic","value":"9783540319825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31982-5_17","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:29:02Z","timestamp":1294990142000},"page":"266-281","source":"Crossref","is-referenced-by-count":3,"title":["Full Abstraction for Polymorphic Pi-Calculus"],"prefix":"10.1007","author":[{"given":"Alan","family":"Jeffrey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Rathke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8598-9","volume-title":"A Theory of Objects","author":"M. Abadi","year":"1996","unstructured":"Abadi, M., Cardelli, L.: A Theory of Objects. Springer, Heidelberg (1996)"},{"key":"17_CR2","volume-title":"The Lambda Calculus, Its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus, Its Syntax and Semantics. North-Holland, Amsterdam (1984)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-36576-1_7","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Berger","year":"2003","unstructured":"Berger, M., Honda, K., Yoshida, N.: Genericity and the \u03c0-calculus. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 103\u2013119. Springer, Heidelberg (2003)"},{"issue":"3","key":"17_CR4","first-page":"560","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J.\u00a0ACM\u00a031(3), 560\u2013599 (1984)","journal-title":"J.\u00a0ACM"},{"key":"17_CR5","first-page":"273","volume-title":"Proc.\u00a0Int.\u00a0Conf.\u00a0Functional Programming Languages and Computer Architecture (FPCA)","author":"P. Canning","year":"1989","unstructured":"Canning, P., Cook, W., Hill, W., Olthoff, W., Mitchell, J.C.: F-bounded polymorphism for object-oriented programming. In: Proc.\u00a0Int.\u00a0Conf.\u00a0Functional Programming Languages and Computer Architecture (FPCA), pp. 273\u2013280. ACM Press, New York (1989)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02011875","volume":"19","author":"M. Coppo","year":"1978","unstructured":"Coppo, M., Dezani-Ciancaglini, M.: A new type-assignment for \u03bb-terms. Archiv Math. Logik\u00a019, 139\u2013156 (1978)","journal-title":"Archiv Math. Logik"},{"key":"17_CR7","unstructured":"Microsoft Corporation. ECMA and ISO\/IEC c# and common language infrastructure standards (2004), http:\/\/msdn.microsoft.com\/net\/ecma\/"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1007\/BFb0055107","volume-title":"Automata, Languages and Programming","author":"C. Fournet","year":"1998","unstructured":"Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, p. 844. Springer, Heidelberg (1998)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201996: Concurrency Theory","author":"C. Fournet","year":"1996","unstructured":"Fournet, C., Gonthier, G., Levy, J.-J., Maranget, L., Remy, D.: A calculus of mobile agents. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119. Springer, Heidelberg (1996)"},{"key":"17_CR10","volume-title":"Proofs and Types","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y., Taylor, P., Lafont, Y.: Proofs and Types. Cambridge University Press, Cambridge (1989)"},{"key":"17_CR11","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/inco.2001.3089","volume":"173","author":"M. Hennessy","year":"2002","unstructured":"Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. Information and Computation\u00a0173(1), 82\u2013120 (2002)","journal-title":"Information and Computation"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"152","author":"K. Honda","year":"1995","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science\u00a0152(2), 437\u2013486 (1995)","journal-title":"Theoretical Computer Science"},{"key":"17_CR14","first-page":"101","volume-title":"Proc. IEEE Logic In Computer Science","author":"A.S.A. Jeffrey","year":"2002","unstructured":"Jeffrey, A.S.A., Rathke, J.: A fully abstract testing semantics for concurrent objects. In: Proc. IEEE Logic In Computer Science, pp. 101\u2013112. IEEE Press, Los Alamitos (2002); Full version to appear in Theoretical Computer Science"},{"key":"17_CR15","series-title":"Electronic Notes in Computer Science","volume-title":"Proc. Mathematical Foundations of Programming Semantics","author":"A.S.A. Jeffrey","year":"2003","unstructured":"Jeffrey, A.S.A., Rathke, J.: Contextual equivalence for higher-order pi-calculus revisited. In: Proc. Mathematical Foundations of Programming Semantics. Electronic Notes in Computer Science. Elsevier, Amsterdam (2003)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.S.A., Rathke, J.: Full abstraction for polymorphic pi-calculus. Online edition with proofs (2005), http:\/\/www.fabfac.org\/","DOI":"10.1007\/978-3-540-31982-5_17"},{"key":"17_CR17","unstructured":"Sun Microsystems. Release notes Java 2 platform standard edition development kit 5.0 (2004), http:\/\/java.sun.com\/j2se\/1.5.0\/relnotes.html"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"Milner, R.: Fully abstract models of typed lambda-calculi. Theoretical Computer Science\u00a04, 1\u201322 (1977)","journal-title":"Theoretical Computer Science"},{"key":"17_CR19","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"17_CR20","volume-title":"Communication and mobile systems: the \u03c0-calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communication and mobile systems: the \u03c0-calculus. Cambridge University Press, Cambridge (1999)"},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","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, Part I + II. Information and Computation\u00a0100(1), 1\u201377 (1992)","journal-title":"Information and Computation"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623. Springer, Heidelberg (1992)"},{"issue":"3","key":"17_CR23","first-page":"531","volume":"47","author":"B.C. Pierce","year":"2000","unstructured":"Pierce, B.C., Sangiorgi, D.: Behavioral equivalence in the polymorphic pi-calculus. J.\u00a0ACM\u00a047(3), 531\u2013584 (2000)","journal-title":"J.\u00a0ACM"},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1017\/S0960129500003066","volume":"10","author":"A.M. Pitts","year":"2000","unstructured":"Pitts, A.M.: Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science\u00a010, 321\u2013359 (2000)","journal-title":"Mathematical Structures in Computer Science"},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. Theoretical Computer Science\u00a05, 223\u2013255 (1977)","journal-title":"Theoretical Computer Science"},{"key":"17_CR26","first-page":"513","volume":"83","author":"J.C. Reynolds","year":"1983","unstructured":"Reynolds, J.C.: Types, abstraction and parametric polymorphism. Information Processing\u00a083, 513\u2013523 (1983)","journal-title":"Information Processing"},{"key":"17_CR27","first-page":"155","volume-title":"Proc. ACM Symp. Principles of Programming Languages","author":"J.C. Reynolds","year":"1993","unstructured":"Reynolds, J.C.: An introduction to logical relations and parametric polymorphism (abstract). In: Proc. ACM Symp. Principles of Programming Languages, pp. 155\u2013156. ACM Press, New York (1993)"},{"key":"17_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626364","volume-title":"Theories of Programming Languages","author":"J.C. Reynolds","year":"1998","unstructured":"Reynolds, J.C.: Theories of Programming Languages. Cambridge University Press, Cambridge (1998)"},{"key":"17_CR29","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh (1993)"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Sumii, E., Pierce, B.C.: A bisimulation for type abstraction and recursion. In: Proc. ACM Symp. Principles of Programming Languages (2005) (to appear)","DOI":"10.1145\/1040305.1040311"},{"key":"17_CR31","first-page":"347","volume-title":"Proc.\u00a0Int.\u00a0Conf.\u00a0Functional Programming Languages and Computer Architecture (FPCA)","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Theorems for free! In: Proc.\u00a0Int.\u00a0Conf.\u00a0Functional Programming Languages and Computer Architecture (FPCA), pp. 347\u2013359. ACM Press, New York (1989)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31982-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:32:53Z","timestamp":1605760373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31982-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253884","9783540319825"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31982-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}