{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T07:45:00Z","timestamp":1714981500035},"reference-count":36,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":8113,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0890-5401(91)90020-3","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"48-80","source":"Crossref","is-referenced-by-count":28,"title":["Type inference with recursive types: Syntax and semantics"],"prefix":"10.1016","volume":"92","author":[{"given":"Felice","family":"Cardone","sequence":"first","affiliation":[]},{"given":"Mario","family":"Coppo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90020-3_BIB1","author":"Aho","year":"1986"},{"key":"10.1016\/0890-5401(91)90020-3_BIB2","author":"Amadio","year":"1989"},{"key":"10.1016\/0890-5401(91)90020-3_BIB3","author":"Barendregt","year":"1984"},{"key":"10.1016\/0890-5401(91)90020-3_BIB4","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","article-title":"A filter lambda model and the completeness of type assignment","volume":"48","author":"Barendregt","year":"1983","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0890-5401(91)90020-3_BIB5","article-title":"Type Assignment in Lambda Calculus","author":"Ben Yelles","year":"1983"},{"key":"10.1016\/0890-5401(91)90020-3_BIB6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(84)90063-X","article-title":"The solution of two star height problems for regular trees","volume":"30","author":"Braquelaire","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90020-3_BIB7","author":"Burstall","year":"1981"},{"key":"10.1016\/0890-5401(91)90020-3_BIB8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0304-3975(84)90005-7","article-title":"Completeness of type assignment in continuous lambda models","volume":"29","author":"Coppo","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90020-3_BIB9","series-title":"Proc. 12th International Colloquium on Automata, Languages and Programming","first-page":"120","article-title":"A completeness theorem for recursively defined types","volume":"Vol. 194","author":"Coppo","year":"1985"},{"key":"10.1016\/0890-5401(91)90020-3_BIB10","series-title":"Proc. Symposium on Logic in Computer Science","first-page":"218","article-title":"Type inference and logical relations","author":"Coppo","year":"1986"},{"key":"10.1016\/0890-5401(91)90020-3_BIB11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","article-title":"Fundamental properties of infinite trees","volume":"25","author":"Courcelle","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90020-3_BIB12","series-title":"Proc. 2nd International Colloquium on Automata, Languages and Programming","first-page":"200","article-title":"Algorithmes d'\u00e9quivalence et de r\u00e9duction \u00e0 des expressions minimales, dans une classe d'\u00e9quations recursive simples","volume":"Vol. 14","author":"Courcelle","year":"1974"},{"key":"10.1016\/0890-5401(91)90020-3_BIB13","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\/0890-5401(91)90020-3_BIB14","author":"Curry","year":"1958"},{"key":"10.1016\/0890-5401(91)90020-3_BIB15","article-title":"Type Assignment in Programming Languages","author":"Damas","year":"1985"},{"key":"10.1016\/0890-5401(91)90020-3_BIB16","series-title":"9th ACM Symposium on Principles of Programming Languages","first-page":"207","article-title":"Principal type schemes for functional programs","author":"Damas","year":"1982"},{"key":"10.1016\/0890-5401(91)90020-3_BIB17","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02483849","article-title":"Algebras and combinators","volume":"1981","author":"Engeler","year":"1981","journal-title":"Algebra Universalis"},{"key":"10.1016\/0890-5401(91)90020-3_BIB18","article-title":"Edinburgh LCF","volume":"Vol. 78","author":"Gordon","year":"1979"},{"key":"10.1016\/0890-5401(91)90020-3_BIB19","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\/0890-5401(91)90020-3_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(83)90136-6","article-title":"The completeness theorem for typing \u03bb-terms","volume":"22","author":"Hindley","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90020-3_BIB21","author":"Hindley","year":"1986"},{"key":"10.1016\/0890-5401(91)90020-3_BIB22","article-title":"R\u00e9solution d'\u00e9quations dans les langages d'ordre 1, 2, \u2026, \u03c9","author":"Huet","year":"1976"},{"key":"10.1016\/0890-5401(91)90020-3_BIB23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","article-title":"Set-theoretical models of \u03bb-calculus: Theories, expansions, isomorphisms","volume":"24","author":"Longo","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0890-5401(91)90020-3_BIB24","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0019-9958(86)80019-5","article-title":"An ideal model for recursive polimorphic types","volume":"71","author":"MacQueen","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(91)90020-3_BIB25","series-title":"First and second-order lambda calculi with recursive types","author":"Mendler","year":"1986"},{"key":"10.1016\/0890-5401(91)90020-3_BIB26","series-title":"Proc. Symposium on Logic in Computer Science","first-page":"30","article-title":"Recursive types and type constraints in second order lambda calculus","author":"Mendler","year":"1987"},{"key":"10.1016\/0890-5401(91)90020-3_BIB27","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\/0890-5401(91)90020-3_BIB28","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0890-5401(88)90009-0","article-title":"Type inference and type containment","volume":"76","author":"Mitchell","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(91)90020-3_BIB29","author":"Morris","year":"1968"},{"key":"10.1016\/0890-5401(91)90020-3_BIB30","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1137\/0216015","article-title":"On proving limiting completeness","volume":"16","author":"Mosses","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90020-3_BIB31","series-title":"Mathematical Foundations of Software Development","first-page":"97","article-title":"Three approaches to type structure","volume":"Vol. 185","author":"Reynolds","year":"1985"},{"key":"10.1016\/0890-5401(91)90020-3_BIB32","series-title":"Toposes, Algebraic Geometry and Logic","first-page":"97","article-title":"Continuous Lattices","volume":"Vol. 274","author":"Scott","year":"1972"},{"key":"10.1016\/0890-5401(91)90020-3_BIB33","series-title":"Proc. 9th international Colloquium on Automata, Languages and Programming","first-page":"577","article-title":"Domains for denotational semantics","volume":"Vol. 140","author":"Scott","year":"1982"},{"key":"10.1016\/0890-5401(91)90020-3_BIB34","author":"Stoy","year":"1977"},{"key":"10.1016\/0890-5401(91)90020-3_BIB35","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott's D\u221e-models of the lambda-calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90020-3_BIB36","first-page":"115","article-title":"A simple algorithm and proof for type inference","volume":"10","author":"Wand","year":"1987","journal-title":"Fund. Inform."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900203?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900203?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:25:23Z","timestamp":1549045523000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540191900203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["0890540191900203"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90020-3","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}