{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:44Z","timestamp":1725455924396},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540536864"},{"type":"electronic","value":"9783540469827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0018452","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:30:30Z","timestamp":1132637430000},"page":"348-365","source":"Crossref","is-referenced-by-count":1,"title":["Polymorphic constructs in natural and programming languages"],"prefix":"10.1007","author":[{"given":"Hans","family":"Lei\u00df","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Jochen D\u00f6rre and William Rounds. On subsumption and semiunification in feature algebras. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, June 4\u20137, 1990, pages 300\u2013310, 1990.","DOI":"10.1109\/LICS.1990.113756"},{"key":"23_CR2","unstructured":"R. Harper, R. Milner, and M. Tofte. The Definition of Standard ML. Version 3. LFCS Report Series ECS-LFCS-89-81, Laboratory for Foundations of Computer Science, Dept. of Computer Science, University of Edinburgh, May 1989."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Fritz 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":"23_CR4","doi-asserted-by":"crossref","unstructured":"D. Kapur, D. Musser, P. Narendran, and J. Stillman. Semi-unification. In Proc. Foundations of Software Technology and Theoretical Computer Science, December 1988, Pune, India, pages 435\u2013454. Springer LNCS 338, 1988.","DOI":"10.1007\/3-540-50517-2_95"},{"key":"23_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 Annual IEEE Symposium on Logic in Computer Science. Asiloma, California, June 5\u20138, 1989, pages 98\u2013105.","DOI":"10.1109\/LICS.1989.39163"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"A.J. Kfoury, J. Tiuryn, and P. Urzyczyn. The undecidability of the semi-unification problem. Tech. Report BUCS-89-010, Boston University, October 1989.","DOI":"10.1145\/100216.100279"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Hans Lei\u00df. Polymorphic recursion and semi-unification. In CSL '89. 3rd Workshop on Computer Science Logic. Kaiserslautern, FRG, October 2\u20136, 1989, pages 211\u2013224. Springer LNCS 440, 1990.","DOI":"10.1007\/3-540-52753-2_41"},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"M. Robin","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"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Alan 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.","DOI":"10.1007\/3-540-12925-1_41"},{"issue":"3","key":"23_CR10","first-page":"551","volume":"29","author":"P. Pavel","year":"1988","unstructured":"Pavel 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":"23_CR11","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/3-540-17220-3_5","volume":"250","author":"P.W. Purdom","year":"1987","unstructured":"P.W. Purdom. Detecting loop simplifications. In P. Lescanne, editor, Proc. 2nd Conference on Rewriting Techniques and Applications, pages 54\u201362. Springer LNCS 250, 1987.","journal-title":"Proc. 2nd Conference on Rewriting Techniques and Applications"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Didier R\u00e9my. Typechecking records and variants in a natural extension of ML. In ACM Symposium on Principles of Programming Languages, pages 77\u201389, 1989.","DOI":"10.1145\/75277.75284"},{"key":"23_CR13","unstructured":"Stuart Shieber. Parsing and Type Inference for Natural and Computer Languages. PhD thesis, Stanford University, March 1989."}],"container-title":["Lecture Notes in Computer Science","Logics in AI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:35:57Z","timestamp":1586572557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018452"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540536864","9783540469827"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0018452","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}