{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:06Z","timestamp":1725663966207},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581840"},{"type":"electronic","value":"9783540484776"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58184-7_120","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:29:00Z","timestamp":1330270140000},"page":"425-437","source":"Crossref","is-referenced-by-count":5,"title":["Predicative polymorphism in \u03c0-calculus"],"prefix":"10.1007","author":[{"given":"Vasco T.","family":"Vasconcelos","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Luis Damas and Robin Milner. Principal type-schemes for functional programs. In 9th ACM Symposium on Principles of Programming Languages, pages 207\u2013212, 1982.","key":"36_CR1","DOI":"10.1145\/582153.582176"},{"doi-asserted-by":"crossref","unstructured":"Kohei Honda. Types for dyadic interaction. In 4th International Conference on Concurrency Theory, volume 715 of LNCS, pages 509\u2013523. Springer-Verlag, August 1993.","key":"36_CR2","DOI":"10.1007\/3-540-57208-2_35"},{"unstructured":"Paris C. Kanellakis, Harry G. Mairson, and John C. Mitchell. Unification and ML type reconstruction. In Computational Logic, Essays in Honor of Alan Robinson, pages 444\u2013478. MIT Press, 1991.","key":"36_CR3"},{"doi-asserted-by":"crossref","unstructured":"A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. A proper extension of ML with an effective type-assignment. In 15th ACM Symposium on Principles of Programming Languages, pages 58\u201369, 1988.","key":"36_CR4","DOI":"10.1145\/73560.73565"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"Robin Milner. Functions as processes. In Automata, Language and Programming, volume 443 of LNCS. Springer-Verlag, 1990. Also as Rapport de Recherche No 1154, INRIA-Sophia Antipolis, February 1990.","key":"36_CR6"},{"unstructured":"Robin Milner. The polyadic \u03c0-calculus: a tutorial. ECS-LFCS 91-180, University of Edinburgh, October 1991.","key":"36_CR7"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, I and II. Information and Computation, 100:1\u201377, 1992. Also as Tech. Rep. ECS-LFCS 89-85\/86, University of Edinburgh.","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"John C. Mitchell. Type systems for programming languages. In Handbook of Theoretical Computer Science, pages 366\u2013358. Elsevier Science Publishers B.V., 1990.","key":"36_CR9","DOI":"10.1016\/B978-0-444-88074-1.50013-5"},{"unstructured":"A. Mycroft. Polymorphic type schemes for functional programming. In 9th ACM Symposium on Principles of Programming Languages, 1984.","key":"36_CR10"},{"doi-asserted-by":"crossref","unstructured":"Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. In 8th IEEE Symposium on Logic in Computer Science, June 1993.","key":"36_CR11","DOI":"10.1109\/LICS.1993.287570"},{"unstructured":"Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1992.","key":"36_CR12"},{"unstructured":"David N. Turner. A \u03c0-calculus sorting discipline. University of Edinburgh, December 1992.","key":"36_CR13"},{"doi-asserted-by":"crossref","unstructured":"Vasco T. Vasconcelos and Kohei Honda. Principal typing-schemes in a polyadic \u03c0-calculus. In 4th International Conference on Concurrency Theory, volume 715 of LNCS, pages 524\u2013538. Springer-Verlag, August 1993. Also as Keio University Report CS 92-002.","key":"36_CR14","DOI":"10.1007\/3-540-57208-2_36"},{"doi-asserted-by":"crossref","unstructured":"Vasco T. Vasconcelos and Mario Tokoro. A typing system for a calculus of objects. In 1st International Symposium on Object Technologies for Advanced Software, volume 742 of LNCS, pages 460\u2013474. Springer-Verlag, November 1993.","key":"36_CR15","DOI":"10.1007\/3-540-57342-9_89"},{"key":"36_CR16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.3233\/FI-1987-10202","volume":"X","author":"M. Wand","year":"1987","unstructured":"Mitchell Wand. A simple algorithm and proof for type inference. Fundamenta Informaticae, X:115\u2013122, 1987.","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","PARLE'94 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58184-7_120.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T06:25:23Z","timestamp":1640931923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58184-7_120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581840","9783540484776"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58184-7_120","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}