{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:52Z","timestamp":1742617132295,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544159"},{"type":"electronic","value":"9783540476177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54415-1_39","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:46:00Z","timestamp":1330209960000},"page":"18-37","source":"Crossref","is-referenced-by-count":7,"title":["Type inference in polymorphic type discipline"],"prefix":"10.1007","author":[{"given":"Paola","family":"Giannini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simona","family":"Ronchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Della","family":"Rocca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"2_CR1","unstructured":"Barendregt, H.P., The Lambda Calculus: its Syntax and Semantics. North Holland, 1984 (revised version)."},{"key":"2_CR2","unstructured":"Ben-Yelles, C., Type Assignment in the Lambda-Calculus: Syntax and Semantics. Ph. D. Thesis, University College of Swansea, 1979."},{"key":"2_CR3","unstructured":"Bosio, E., Ronchi Della Rocca, S., Type Synthesis for Intersection Type Discipline. Prooceedings of Third Italian Conference on Theoretical Computer Science. Word Scientific, 1989, pp.109\u2013122."},{"key":"2_CR4","volume-title":"Tipi e polimorfismo nei linguaggi di programmazione","author":"M. Coppo","year":"1985","unstructured":"Coppo, M., Tipi e polimorfismo nei linguaggi di programmazione, Atti degli Incontri di Logica Matematica, Siena, 1985."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Curry, H.B., Modified Basic Functionality in Combinatory Logic. Dialectica, 1969.","DOI":"10.1111\/j.1746-8361.1969.tb01183.x"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Damas, L. and Milner, R., The Principal Type Schemes for Functional Programs. In Symposium on Principles of Programming Languages, ACM, 1982, pp.207\u2013212.","DOI":"10.1145\/582153.582176"},{"key":"2_CR7","volume-title":"A strongly normalizing term having no type in the system F (second order \u03bb-calculus)","author":"P. Giannini","year":"1987","unstructured":"Giannini, P.,Honsell, F., Ronchi Della Rocca, S., A strongly normalizing term having no type in the system F (second order \u03bb-calculus), Rapporto Interno, Dipartimento di Informatica, Torino, 1987."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Giannini, P., Ronchi Della Rocca, S., Characterization of typings in polymorphic type discipline. In Logic in Computer Science, IEEE, 1988, pp. 61\u201370.","DOI":"10.1109\/LICS.1988.5101"},{"key":"2_CR9","unstructured":"Giannini, P., Ronchi Della Rocca, S., Message on the Type-Net, November 1989."},{"key":"2_CR10","unstructured":"Girard, J.Y., Interpretation Fonctionelle et Elimination des Coupures de l'Arithmetique dOrdre Superieur. These D'Etat, Universite Paris VII, 1972."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Hindley, R., The Principal Type Scheme of an Object in Combinatory Logic. Transactions of American Mathematical Society, 1969, pp. 1\u201317.","DOI":"10.2307\/1995158"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kfoury, A.J., Tiuryn J., Urzyczyn P., The Undecidability of Semiunification Problem. Tec. Report, Computer Science Dept., Boston University, 1989.","DOI":"10.1145\/100216.100279"},{"issue":"1\/2","key":"2_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0747-7171(89)80024-0","volume":"8","author":"P. Chenadec Le","year":"1989","unstructured":"Le Chenadec P., On the Logic of Unification. Journal of Symbolic Computation, 8, 1\/2, 1989, pp. 141\u2013199.","journal-title":"Journal of Symbolic Computation"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Leivant, D., Polymorphic Type Inference. In Symposium on Principles of Programming Languages, ACM, 1983, pp.88\u201398.","DOI":"10.1145\/567067.567077"},{"issue":"2\/3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0890-5401(88)90009-0","volume":"76","author":"J.C. Mitchell","year":"1988","unstructured":"Mitchell, J.C., Polymorphic Type Inference and Containment. Information and Computation 76, 2\/3, 1988, pp.211\u2013249.","journal-title":"Information and Computation"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Pfenning, F., Partial Polymorphic Type Inference and Higher-Order Unification. In Conference on LISP and Functional Programming, ACM, 1988.","DOI":"10.1145\/62678.62697"},{"key":"2_CR17","volume-title":"Natural Deduction, a Proof Theoretic Study","author":"D. Prawitz","year":"1965","unstructured":"Prawitz, D., Natural Deduction, a Proof Theoretic Study. Almquist and Wiksell, Amsterdam, 1965."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C., Towards a Theory of Type Structures. In Paris Colloquium on Programming, Springer Verlag, 1974, pp.408\u2013425.","DOI":"10.1007\/3-540-06859-7_148"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Robinson, J.A., A Machine Oriented Logic Based on the Resolution Principle. Journal of the ACM, 1965, pp.24\u201341.","DOI":"10.1145\/321250.321253"},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(88)90101-6","volume":"59","author":"S. Ronchi Della Rocca","year":"1988","unstructured":"Ronchi Della Rocca, S., Principal Type Scheme and Unification for Intersection Type Discipline. Theoretical Computer Science 59, 1988, pp.181\u2013209.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54415-1_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:18:00Z","timestamp":1742591880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54415-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544159","9783540476177"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-54415-1_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}