{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:24Z","timestamp":1725456984790},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032021","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"46-59","source":"Crossref","is-referenced-by-count":0,"title":["Generic terms having no polymorphic types"],"prefix":"10.1007","author":[{"given":"Sophie","family":"Malecki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"L. Damas and R. Milner. The Principal Type Schemes for Functional Programs. In Symposium on Principles of Programming Languages, ACM, 1982.","DOI":"10.1145\/582153.582176"},{"key":"5_CR2","volume-title":"A strongly normalizing term having no type in the system F (second order calculus)","author":"P. Giannini","year":"1987","unstructured":"P. Giannini, F. Honsel, S. Ronchi Della Rocca. A strongly normalizing term having no type in the system F (second order calculus). Rapporto Interno, Dipartemento di Informatica, Torino, 1987."},{"key":"5_CR3","unstructured":"P. Giannini, F. Honsel, S. Ronchi Della Rocca. Characterization of typings in polymorphic type discipline. L.I.C.S. 88."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Une extension de l'interpr\u00e9tation de G\u00f6del \u00e0 l'analyse et son application \u00e0 l'\u00e9limination des coupures dans l'analyse et la th\u00e9orie des types. (P 0604) Scand Logic Symposium, 1971.","DOI":"10.1016\/S0049-237X(08)70843-7"},{"key":"5_CR5","unstructured":"J.L. Krivine. Un algorithme non typable dans le syst\u00e8me F. C.R. Acad. SC. Paris, t 304, s\u00e9rie 1(5), 1987."},{"key":"5_CR6","unstructured":"P. Le Chenadec. On the logic of unification. Rapports de Recherche I.N.R.I.A. 1008, 1989."},{"key":"5_CR7","unstructured":"S. Malecki. Un autre terme fortement normalisable sans type polymorphe. Rapport interne, 1989."},{"key":"5_CR8","unstructured":"S. Malecki. P.H.D. Thesis, 1990."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"J. C. Mitchell. Polymorphic type inference and containment. Information and computation, 76(2\/3), 1988.","DOI":"10.1016\/0890-5401(88)90009-0"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:44:44Z","timestamp":1586612684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0032021","relation":{},"subject":[]}}