{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:24Z","timestamp":1725663264351},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540527534"},{"type":"electronic","value":"9783540471370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52753-2_41","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T01:43:31Z","timestamp":1330220611000},"page":"211-224","source":"Crossref","is-referenced-by-count":2,"title":["Polymorphic recursion and semi-unification"],"prefix":"10.1007","author":[{"given":"Hans","family":"Lei\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"L. Damas and R. Milner. Principle type-schemes for functional programs. In In Proceedings of the 9th ACM Symposium on Principles of Programming Languages, pages 207\u2013212, 1982.","DOI":"10.1145\/582153.582176"},{"key":"13_CR2","unstructured":"R. Harper. Introduction to Standard ML. LFCS Report Series ECS-LFCS-86-14, Laboratory for Foundations of Computer Science, Dept. of Computer Science, University of Edinburgh, November 1986."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"F. Henglein. Type inference and semi-unification. In Proceedings of the 1988 ACM Conference on LISP and Functional Programming. Snowbird, Utah, July 25\u201327, pages 184\u2013197, 1988.","DOI":"10.1145\/62678.62701"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"D. Kapur, D. Musser, P. Narendran, and J. Stillman. Semi-unification. In Proceedings of the 8th Conference on Foundations of Software Technology and Theoretical Computer Science. Pune, India, December 21\u201323, 1988, pages 435\u2013454. Springer LNCS 338.","DOI":"10.1007\/3-540-50517-2_95"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. Computational consequences and partial solutions of a generalized unification problem. In Fourth IEEE Symposium on Logic in Computer Science. Asilomar, California, June 5\u20138, 1989.","DOI":"10.1109\/LICS.1989.39163"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. Undecidability of the semi-unification problem. types electronic mailing list, Sept. 25, 1989.","DOI":"10.1145\/100216.100279"},{"key":"13_CR7","first-page":"151","volume":"329","author":"H. Lei\u00df","year":"1988","unstructured":"H. Lei\u00df. On type inference for object-oriented programming languages. In E. B\u00f6rger, H. Kleine-B\u00fcning, and M. M. Richter, editors, CSL '87. 1st Workshop on Computer Science Logic. Karlsruhe, FRG, October 12\u201316, 1987, pages 151\u2013172. Springer LNCS 329, 1988.","journal-title":"Springer LNCS"},{"key":"13_CR8","volume-title":"Semi-unification and type inference for polymorphic recursion. Bericht INF2-ASE-5-89","author":"H. Lei\u00df","year":"1989","unstructured":"H. Lei\u00df. Semi-unification and type inference for polymorphic recursion. Bericht INF2-ASE-5-89, Siemens AG, M\u00fcnchen, May 1989."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. 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"},{"key":"13_CR10","first-page":"217","volume":"167","author":"A. Mycroft","year":"1984","unstructured":"A. Mycroft. Polymorphic type schemes and recursive definitions. In International Symposium on Programming. 6th Colloquium. Toulouse, April 17\u201319, 1984, pages 217\u2013228. Springer LNCS 167, 1984.","journal-title":"Springer LNCS"},{"issue":"3","key":"13_CR11","first-page":"551","volume":"29","author":"P. Pudl\u00e1k","year":"1988","unstructured":"P. Pudl\u00e1k. On a unification problem related to Kreisel's conjecture. Commentationes Mathematicae Universitatis Carolinae, 29(3):551\u2013556, 1988.","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"D. A. Turner. Miranda: a non-strict functional language with polymorphic types. In Proceedings of the IFIP International Conference on Fuctional Programming Languages and Computer Architecture. Springer LNCS 201, 1985.","DOI":"10.1007\/3-540-15975-4_26"}],"container-title":["Lecture Notes in Computer Science","CSL '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52753-2_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:09Z","timestamp":1605648309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52753-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540527534","9783540471370"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-52753-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}