{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:39Z","timestamp":1760202519403},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s00236-005-0175-1","type":"journal-article","created":{"date-parts":[[2005,10,27]],"date-time":"2005-10-27T16:58:19Z","timestamp":1130432299000},"page":"83-141","source":"Crossref","is-referenced-by-count":22,"title":["Genericity and the \u03c0-calculus"],"prefix":"10.1007","volume":"42","author":[{"given":"Martin","family":"Berger","sequence":"first","affiliation":[]},{"given":"Kohei","family":"Honda","sequence":"additional","affiliation":[]},{"given":"Nobuko","family":"Yoshida","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,11,1]]},"reference":[{"key":"175_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Cardelli, L., Curien, P.-L.: Formal parametric polymorphism. TCS 121,pp. (1\u20132) 9\u201358 (1993)","DOI":"10.1016\/0304-3975(93)90082-5"},{"key":"175_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","volume":"111","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S.: Computational interpretations of linear logic. TCS 111, 3\u201351 (1993)","journal-title":"TCS"},{"key":"175_CR3","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jagadeesan, R.: A game semantics for generic polymorphism. In: Proc. FOSSACS'03, no. 2620 in LNCS, pp. 1\u201322. Springer (2003)","DOI":"10.1007\/3-540-36576-1_1"},{"key":"175_CR4","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Information and Computation 163, 409\u2013470 (2000)","journal-title":"Information and Computation"},{"key":"175_CR5","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Lenisa, M.: Axiomatizing fully complete models for ML polymorphic types. In: Proc. of MFCS'2000, vol. 1893 of LNCS,pp. 141\u2013151. Springer (2000)","DOI":"10.1007\/3-540-44612-5_10"},{"key":"175_CR6","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Lenisa, M.: A fully-complete PER model for ML polymorphic types. In: CSL'2000, vol. 2142 of LNCS, pp. 443\u2013457. Springer (2000)","DOI":"10.1007\/3-540-44802-0_31"},{"key":"175_CR7","unstructured":"Barendregt, H.: The Lambda Calculus. North Holland, (1985)"},{"key":"175_CR8","doi-asserted-by":"crossref","unstructured":"Barendregt, H.: Lambda calculi with types. In: Abramsky, S., Gabbay, D., Maibaum, T., (eds.) Handbook of Logic in Computer Science. Background: Computational Structures, vol. 2. Clarendon Press (1992)","DOI":"10.1093\/oso\/9780198537618.003.0002"},{"key":"175_CR9","unstructured":"Berger, M.: Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, London (2002)"},{"key":"175_CR10","doi-asserted-by":"crossref","unstructured":"Berger, M.: Basic Theory of Reduction Congruence for Two Timed Asynchronous \u03c0-Calculi. In: Proc. CONCUR, 3170 pp. 115\u201313 (2004)","DOI":"10.1007\/978-3-540-28644-8_8"},{"key":"175_CR11","unstructured":"Berger, M., Honda, K., Yoshida, N.: Sequentiality and the \u03c0-calculus. Full version of 12"},{"key":"175_CR12","doi-asserted-by":"crossref","unstructured":"Berger, M., Honda, K., Yoshida, N.: Sequentiality and the \u03c0-calculus. In: Proc. TLCA'01, vol. 2044 of LNCS pp. 29\u201345 (2001)","DOI":"10.1007\/3-540-45413-6_7"},{"key":"175_CR13","doi-asserted-by":"crossref","unstructured":"Berger, M., Honda, K., Yoshida, N.: Genericity and the \u03c0-Calculus. In: Proc. FOSSACS'03, no. 2620 in LNCS, pp. 103\u2013119. Springer (2003)","DOI":"10.1007\/3-540-36576-1_7"},{"key":"175_CR14","unstructured":"Boudol, G.: Asynchrony and the pi-calculus. Tech. Rep. 1702. INRIA (1992)"},{"key":"175_CR15","doi-asserted-by":"crossref","unstructured":"Bracha, G., Odersky, M., Stoutamire, D., Wadler, P.: Making the future safe for the past: Adding genericity to the Java programming language. In: Proceedings of ACM OOPSLA 98 (1998)","DOI":"10.1145\/286936.286957"},{"key":"175_CR16","unstructured":"Girard, J.-Y.: Interpr\u00e9tation Fonctionnelle et \u00c9limination des Coupures de l'Arithm\u00e9tique d'Ordre Sup\u00e9rieur. PhD thesis, Universite de Paris VII (1972)"},{"key":"175_CR17","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Linear logic. TCS 50, pp. 1\u2013102 (1987)","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"175_CR18","doi-asserted-by":"crossref","unstructured":"Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: Proceedings of ECOOP'91. 512, 133\u2013147 (1991)","DOI":"10.1007\/BFb0057019"},{"key":"175_CR19","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0304-3975(99)00039-0","volume":"221","author":"K. Honda","year":"1999","unstructured":"Honda, K., Yoshida, N.: Game-Theoretic Analysis of Call-by-Value Computation. TCS 221, 393\u2013456 (1999)","journal-title":"TCS"},{"key":"175_CR20","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N.: A uniform type structure for secure information flow. In: POPL'02, ACM Press, pp. 81\u201392 (2002) Full version available at http:\/\/www.doc.ic.ac.uk\/yoshida","DOI":"10.1145\/565816.503281"},{"key":"175_CR21","unstructured":"Honda, K., Yoshida, N., Berger, M.: Control in the \u03c0-calculus. In: Proc. CW'04, ACM Press (2004)"},{"key":"175_CR22","doi-asserted-by":"crossref","unstructured":"Hughes, D.J.D.: Games and definability for system F. In: LICS'97, IEEE Computer Society Press, pp. 76\u201386 (1997)","DOI":"10.1109\/LICS.1997.614935"},{"key":"175_CR23","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J.M.E. Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.H.L.: On full abstraction for PCF. Inf. & Comp. 163, 285\u2013408 (2000)","journal-title":"Inf. & Comp."},{"key":"175_CR24","doi-asserted-by":"crossref","unstructured":"Kleist, J., Sangiorgi, D.: Imperative objects and mobile processes. In: Proc. IFIP Working Conference on Programming Concepts and Methods (PROCOMET'98). North-Holland (1998)","DOI":"10.1007\/978-0-387-35358-6_20"},{"issue":"5","key":"175_CR25","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1145\/330249.330251","volume":"21","author":"N. Kobayashi","year":"1999","unstructured":"Kobayashi, N., Pierce, B., Turner, D.: Linear types and \u03c0-calculus. ACM Trans. Program. Lang. Syst. 21(5), 914\u2013947 (1999)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"175_CR26","unstructured":"Lazi\u0107, R.S., Newcomb, T., Roscoe, A.: On model checking data-independent systems with arrays without reset. Tech. Rep. RR-02-02, Oxford University (2001)"},{"issue":"2","key":"175_CR27","first-page":"119","volume":"2","author":"R. Milner","year":"1992","unstructured":"Milner, R.: Functions as processes. MSCS 2(2), 119\u2013141 (1992)","journal-title":"MSCS"},{"key":"175_CR28","doi-asserted-by":"crossref","unstructured":"Milner, R.: The polyadic \u03c0-calculus: A tutorial. In: Proceedings of the International Summer School on Logic Algebra of Specification, Marktoberdorf (1992)","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"175_CR29","unstructured":"Milner, R.: Speech on receiving an Honorary Degree from the University of Bologna, ICALP'97 (1997)"},{"key":"175_CR30","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, parts I and II. Info. & Comp. 100, p. 1 (1992)","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"175_CR31","unstructured":"Milner, R., Tofte, M., Harper, R.W.: The Definition of Standard ML. MIT Press (1990)"},{"key":"175_CR32","doi-asserted-by":"crossref","unstructured":"Mitchell, J.C.: On the equivalence of data representation. In: Artificial Intelligence and Mathematical Theory of Computation (1991)","DOI":"10.1016\/B978-0-12-450010-5.50023-2"},{"key":"175_CR33","unstructured":"Mitchell, J.C.: Foundations for Programming Languages. MIT Press (1996)"},{"key":"175_CR34","doi-asserted-by":"crossref","unstructured":"Murawski, A., Ong, C.-H.L.: Evolving games and essential nets for affine polymorphism. In: Proc. of TLCA'01, no. 2044 in LNCS, pp. 360\u2013375. Springer (2001)","DOI":"10.1007\/3-540-45413-6_28"},{"issue":"5","key":"175_CR35","first-page":"409","volume":"6","author":"B. Pierce","year":"1996","unstructured":"Pierce, B., Sangiorgi, D.: Typing and subtyping for mobile processes. MSCS 6(5), 409\u2013454 (1996)","journal-title":"MSCS"},{"issue":"3","key":"175_CR36","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1145\/337244.337261","volume":"47","author":"B. Pierce","year":"2000","unstructured":"Pierce, B., Sangiorgi, D.: Behavioral equivalence in the polymorphic pi-calculus. Journal of ACM 47(3), 531\u2013584 (2000)","journal-title":"Journal of ACM"},{"key":"175_CR37","doi-asserted-by":"crossref","unstructured":"Pierce, B.C., Turner, D.N.: Pict: A programming language based on the pi-calculus. In: Proof, Language and Interaction: Essays in Honour of Robin Milner, Plotkin, G., Stirling, C., Tofte, M., (eds.) MIT Press (2000)","DOI":"10.7551\/mitpress\/5641.003.0022"},{"key":"175_CR38","doi-asserted-by":"crossref","unstructured":"Pitts, A.M.: Existential Types: Logical Relations and Operational Equivalence. In: Proc. ICALP'98, no. 1443 in LNCS, pp. 309\u2013326 (1998)","DOI":"10.1007\/BFb0055063"},{"key":"175_CR39","doi-asserted-by":"crossref","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 10, 321\u2013359 (2000)","journal-title":"Mathematical Structures in Computer Science"},{"key":"175_CR40","unstructured":"Pitts, A.M., Stark, I.D.B.: Operational reasoning for functions with local state. In: HOOTS'98, CUP, pp. 227\u2013273 (1998)"},{"key":"175_CR41","unstructured":"Plotkin, G., Abadi, M.: A logic for parameteric polymorphism. In: LICS'98, IEEE Press, pp. 42\u201353 (1998)"},{"key":"175_CR42","unstructured":"Reynolds, J.C.: Types, abstraction and parametric polymorphism. In: Information Processing. Mason, R.E.A.(ed.) 83 (1983)"},{"key":"175_CR43","unstructured":"Turner, D.N.: The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, University of Edinburgh (1996)"},{"key":"175_CR44","doi-asserted-by":"crossref","unstructured":"Vasconcelos, V.T.: Typed Concurrent Objects. In: 8th ECOOP, vol. 821 of Lecture Notes in Computer Science, pp. 100\u2013117 (1994)","DOI":"10.1007\/BFb0052178"},{"key":"175_CR45","doi-asserted-by":"crossref","unstructured":"Vasconcelos, V.T., Honda, K.: Principal typing-schemes in a polyadic \u03c0-calculus. In: 4th CONCUR, vol. 715 of Lecture Notes in Computer Science, pp. 524\u2013538 (1993)","DOI":"10.1007\/3-540-57208-2_36"},{"key":"175_CR46","doi-asserted-by":"crossref","unstructured":"Yoshida, N., Berger, M., Honda, K.: Strong Normalisation in the \u03c0-Calculus. In: LICS'01, IEEE, pp. 311\u2013322 (2001) The full version in Journal of Inf. & Comp. 191, 145\u2013202 Elsevier (2004)","DOI":"10.1016\/j.ic.2003.08.004"},{"key":"175_CR47","doi-asserted-by":"crossref","unstructured":"Yoshida, N., Honda, K., Berger, M.: Linearity and bisimulation. In: FoSSaCs02, vol. 2303 of LNCS, pp.417\u2013433. Springer (2002)","DOI":"10.1007\/3-540-45931-6_29"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0175-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-005-0175-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0175-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T08:27:14Z","timestamp":1706689634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-005-0175-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":47,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["175"],"URL":"https:\/\/doi.org\/10.1007\/s00236-005-0175-1","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}