{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:12:57Z","timestamp":1767928377050,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540129257","type":"print"},{"value":"9783540388098","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-12925-1_41","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:00:17Z","timestamp":1330192817000},"page":"217-228","source":"Crossref","is-referenced-by-count":69,"title":["Polymorphic type schemes and recursive definitions"],"prefix":"10.1007","author":[{"given":"Alan","family":"Mycroft","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Burstall, R., MacQueen, D.B. and Sannella, D.T. HOPE: an experimental applicative language. Internal report, Dept. of Computer Science, Edinburgh University, 1980.","DOI":"10.1145\/800087.802799"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Damas, L. and Milner, R. Principal type schemes for functional programs. Proc. 9th ACM Symp. on Principles of programming languages, 1982.","DOI":"10.1145\/582153.582176"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Gordon, M., Milner, R. and Wadsworth, C. Edinburgh LCF. Springer-Verlag LNCS 78, 1979.","DOI":"10.1007\/3-540-09724-4"},{"key":"19_CR4","unstructured":"Homstr\u00f6m, S. Polymorphic type schemes and concurrent computation in functional languages. PhD thesis, Dept. of Computer Science, Chalmers TH, S-412 96 G\u00f6teborg, 1983."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Milner, R. A theory of type polymorphism in programming. Journal of computer and system sciences, 17(3), 1978.","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"19_CR6","unstructured":"Mycroft, A. and O'Keefe, R.A. A polymorphic type system for Prolog. To appear in Artificial Intelligence. Preliminary version in DAI research report. Dept. of Artificial Intelligence, Edinburgh University."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"MacQueen, D.B., Plotkin, G.D. and Sethi, R. An ideal model for recursive polymorphic types. Proc. 11th ACM Symp. on Principles of programming languages, 1984.","DOI":"10.1145\/800017.800528"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"MacQueen, D.B. and Sethi, R. A semantic model of types for applicative languages. Proc. Aspen\u00e4s workshop 1982.","DOI":"10.1145\/800068.802156"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Robinson, J.A. A machine oriented logic based on the resolution principle. JACM 12(1), 1965.","DOI":"10.1145\/321250.321253"}],"container-title":["Lecture Notes in Computer Science","International Symposium on Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12925-1_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:56Z","timestamp":1605643616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12925-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540129257","9783540388098"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-12925-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984]]}}}