{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:54:32Z","timestamp":1760043272973},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":8447,"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":[[1990,6]]},"DOI":"10.1016\/0304-3975(90)90144-7","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:44:32Z","timestamp":1034271872000},"page":"155-175","source":"Crossref","is-referenced-by-count":37,"title":["Type inference with subtypes"],"prefix":"10.1016","volume":"73","author":[{"given":"You-Chin","family":"Fuh","sequence":"first","affiliation":[]},{"given":"Prateek","family":"Mishra","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90144-7_BIB1","author":"Cardelli","year":"1985","journal-title":"Basic polymorphic typechecking"},{"key":"10.1016\/0304-3975(90)90144-7_BIB2","first-page":"207","article-title":"Principal type schemes for functional programs","author":"Damas","year":"1982","journal-title":"Proc. 9th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90144-7_BIB3","series-title":"Tech. Report 89-13","article-title":"Strictness analysis: a new perspective based on type inference","author":"Kuo","year":"1989"},{"key":"10.1016\/0304-3975(90)90144-7_BIB4","first-page":"88","article-title":"Polymorphic type inference","author":"Leivant","year":"1983","journal-title":"Proc. 10th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90144-7_BIB5","series-title":"Master's thesis","article-title":"Implementation issues for standard ML","author":"Malhotra","year":"1987"},{"issue":"2","key":"10.1016\/0304-3975(90)90144-7_BIB6","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An efficient unification algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"TOPLAS"},{"key":"10.1016\/0304-3975(90)90144-7_BIB7","first-page":"8","article-title":"Declaration-free type inference","author":"Mishra","year":"1985","journal-title":"Proc. 12th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90144-7_BIB8","first-page":"175","article-title":"Coercion and type inference","author":"Mitchell","year":"1984","journal-title":"Proc. 11th Ann. ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90144-7_BIB9","series-title":"Semantics of Data Types","first-page":"257","article-title":"Type inference and type containment","volume":"173","author":"Mitchell","year":"1984"},{"key":"10.1016\/0304-3975(90)90144-7_BIB10","first-page":"60","article-title":"Typechecking records and variants in a natural extension of ML","author":"Remy","year":"1989","journal-title":"Proc. 16th Ann. ACM Symp. on Programming Languages"},{"key":"10.1016\/0304-3975(90)90144-7_BIB11","first-page":"135","article-title":"Transformational systems and the algebraic structure of atomic formulas","volume":"5","author":"Reynolds","year":"1970","journal-title":"Mach. Intell."},{"key":"10.1016\/0304-3975(90)90144-7_BIB12","series-title":"Semantics-Directed Compiler Generation","first-page":"211","article-title":"Using category theory to design implicit conversions and generic operators","volume":"94","author":"Reynolds","year":"1980"},{"key":"10.1016\/0304-3975(90)90144-7_BIB13","series-title":"TAPSOFT 1985","first-page":"97","article-title":"Three approaches to type structure","volume":"186","author":"Reynolds","year":"1985"},{"key":"10.1016\/0304-3975(90)90144-7_BIB14","series-title":"ICALP 87","first-page":"615","article-title":"Type inference with partial types","volume":"317","author":"Thatte","year":"1987"},{"key":"10.1016\/0304-3975(90)90144-7_BIB15","author":"Wand","year":"1987","journal-title":"A simple algorithm and proof for type inference"},{"key":"10.1016\/0304-3975(90)90144-7_BIB16","author":"Wand","year":"1989","journal-title":"On the complexity of type inference with coercion"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590901447?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590901447?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:21:01Z","timestamp":1555179661000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397590901447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0304397590901447"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90144-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}