{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T20:15:13Z","timestamp":1673208913928},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5280,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0304-3975(98)00139-x","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"157-181","source":"Crossref","is-referenced-by-count":5,"title":["Extending the type checker of Standard ML by polymorphic recursion"],"prefix":"10.1016","volume":"212","author":[{"given":"Martin","family":"Emms","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Lei\u03b2","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00139-X_BIB1","series-title":"Standard ML of New Jersey","author":"AT & T Bell Laboratories","year":"1993"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1111\/j.1746-8361.1969.tb01183.x","article-title":"Modified basic functionality in combinatory logic","volume":"23","author":"Curry","year":"1969","journal-title":"Dialectica"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB3","series-title":"Proc. 9th ACM Symp. on Principles of Programming Languages","first-page":"207","article-title":"Principal type-schemes for functional programs","author":"Damas","year":"1982"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB4","article-title":"Extending the type checker of SML by polymorphic recursion \u2014 a correctness proof","author":"Emms","year":"1996"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB5","unstructured":"M. Emms, H. Lei\u03b2, SML+ www.cis.uni-muenchen.de\/people\/leiss\/ polyrec.html ftp.cis.uni-muenchen. de\/pub\/leiss\/polyrec.tar.gz."},{"key":"10.1016\/S0304-3975(98)00139-X_BIB6","series-title":"Ph.D. Thesis, Courant Institute of Mathematical Sciences","article-title":"Polymorphic type inference and semi-unification","author":"Henglein","year":"1989"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/169701.169692","article-title":"Type inference with polymorphic recursion","volume":"15","author":"Henglein","year":"1993","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB8_1","series-title":"Recherches sur la theorie de la demonstration, in Ecrits logiques de Jacques Herbrand","author":"Herbrand","year":"1968"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB8_2","author":"Herbrand","year":"1930"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB9","first-page":"29","article-title":"The principal type-scheme of an object in combinatory logic","volume":"146","author":"Hindley","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(98)00139-X_BIB10","series-title":"Proc. 8th Conf. on Foundations of Software Technology and Theoretical Computer Science","first-page":"435","article-title":"Semi-unification","volume":"vol. 338","author":"Kapur","year":"1988"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB11","series-title":"Proc. 15th Coll. on Trees in Algebra and Programming (CAAP)","first-page":"206","article-title":"ML typability is DEXPTIME-complete","volume":"vol. 431","author":"Kfoury","year":"1990"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB12","series-title":"22nd Ann. ACM Symp. on Theory of Computing","first-page":"468","article-title":"The undecidability of the semi-unification problem","author":"Kfoury","year":"1990"},{"issue":"2","key":"10.1016\/S0304-3975(98)00139-X_BIB13","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/169701.169687","article-title":"Type reconstruction in the presence of polymorphic recursion","volume":"15","author":"Kfoury","year":"1993","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB14","article-title":"Semi-unification and type inference for polymorphic recursion","author":"Lei\u03b2","year":"1989"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB15","series-title":"CSL '89. 3rd Workshop on Computer Science Logic","first-page":"211","article-title":"Polymorphic Recursion and Semi-Unification","volume":"vol. 440","author":"Lei\u03b2","year":"1990"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB16","series-title":"16th Internat. Symp. on Mathematical Foundations of Computer Science","first-page":"318","article-title":"A decidable case of the semi-unification problem","volume":"vol. 520","author":"Lei\u03b2","year":"1991"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB17","series-title":"Proc. 17th ACM Symp. on Principles of Programming Languages, ACM","first-page":"382","article-title":"Deciding ML typability is complete for deterministic exponential time","author":"Mairson","year":"1990"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB18","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00139-X_BIB19","series-title":"The Definition of Standard ML","author":"Milner","year":"1990"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB20","series-title":"Internat. Symp. on Programming. 6th Colloquium","first-page":"217","article-title":"Polymorphic type schemes and recursive definitions","volume":"vol. 167","author":"Mycroft","year":"1984"},{"issue":"3","key":"10.1016\/S0304-3975(98)00139-X_BIB21","first-page":"551","article-title":"On a unification problem related to Kreisel's conjecture","volume":"29","author":"Pudl\u00e1k","year":"1988","journal-title":"Comment. Math. Univ. Carolin."},{"key":"10.1016\/S0304-3975(98)00139-X_BIB22","series-title":"7th ACM Conf. on Functional Programming and Computer Architecture","article-title":"Dimension inference under polymorphic recursion","author":"Rittri","year":"1995"},{"key":"10.1016\/S0304-3975(98)00139-X_BIB23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800139X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800139X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:27:16Z","timestamp":1556508436000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759800139X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S030439759800139X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00139-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}