{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:01Z","timestamp":1759637941233},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":7168,"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":[[1993,12]]},"DOI":"10.1016\/0304-3975(93)90086-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"113-143","source":"Crossref","is-referenced-by-count":17,"title":["Type inference, abstract interpretation and strictness analysis"],"prefix":"10.1016","volume":"121","author":[{"given":"Mario","family":"Coppo","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Ferrari","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90086-9_BIB1","series-title":"Proc. Workshop on Programs as Data Objects","first-page":"1","article-title":"Strictness analysis and polymorphic invariance","volume":"Vol. 217","author":"Abramsky","year":"1985"},{"key":"10.1016\/0304-3975(93)90086-9_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"Domain theory in logical form","volume":"51","author":"Abramsky","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(93)90086-9_BIB3","series-title":"The Lazy Lambda-Calculus","first-page":"65","article-title":"Research topics in functional programming","author":"Abramsky","year":"1990"},{"key":"10.1016\/0304-3975(93)90086-9_BIB4","series-title":"Abstract Interpretation of Declarative Languages","first-page":"9","article-title":"An introduction to abstract interpretation","author":"Abramsky","year":"1987"},{"key":"10.1016\/0304-3975(93)90086-9_BIB5","series-title":"The Lambda Calculus: its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/0304-3975(93)90086-9_BIB6","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\/0304-3975(93)90086-9_BIB7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","article-title":"Strictness analysis of higher order functions","volume":"7","author":"Burn","year":"1986","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(93)90086-9_BIB8","article-title":"Two extensions of Curry's type inference system","author":"Cardone","year":"1990","journal-title":"Logic and Comput. Sci."},{"key":"10.1016\/0304-3975(93)90086-9_BIB9","series-title":"Proc. IFIP Symp. on Functional Programming Languages and Computer Architecture","article-title":"Strictness analysis: a practical approach","volume":"Vol. 201","author":"Clak","year":"1985"},{"key":"10.1016\/0304-3975(93)90086-9_BIB10","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\/0304-3975(93)90086-9_BIB11","series-title":"Proc. Logic Colloq. '82","article-title":"Extended type structures and filter lambda models","author":"Coppo","year":"1984"},{"key":"10.1016\/0304-3975(93)90086-9_BIB12","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism","first-page":"536","article-title":"Principal type schemes and lambda calculus semantics","author":"Coppo","year":"1980"},{"key":"10.1016\/0304-3975(93)90086-9_BIB13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","article-title":"Type theories, normal forms and D\u221e lambda-models","volume":"72","author":"Coppo","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90086-9_BIB14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55251-0_6","article-title":"A complete type inference algorithm for simple intersection types","volume":"Vol. 581","author":"Coppo","year":"1992"},{"key":"10.1016\/0304-3975(93)90086-9_BIB15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(86)90043-5","article-title":"A characterization of f-complete type assignments","volume":"45","author":"Dezani-Ciancaglini","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90086-9_BIB16","series-title":"Master's Thesis","article-title":"Un sistema di tipi per analisi di strictness","author":"Ferrari","year":"1992"},{"key":"10.1016\/0304-3975(93)90086-9_BIB17","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\/0304-3975(93)90086-9_BIB18","series-title":"Proc. Functional Programming Languages and Computer Architecture","article-title":"Strictness analysis in logical form","volume":"Vol. 532","author":"Jensen","year":"1991"},{"key":"10.1016\/0304-3975(93)90086-9_BIB19","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/41625.41638","article-title":"On strictness and its analysis","author":"Kuo","year":"1987","journal-title":"Proc. ACM POPL '87"},{"key":"10.1016\/0304-3975(93)90086-9_BIB20","article-title":"Inferring strictness properties of the pure \u03bb-calculus: completeness and incompleteness theorems","author":"Kuo","year":"1990","journal-title":"Technical Report"},{"key":"10.1016\/0304-3975(93)90086-9_BIB21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0019-9958(86)80019-5","article-title":"An ideal model for recursive polymorphic types","volume":"71","author":"MacQueen","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90086-9_BIB22","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","article-title":"What is a model of the \u03bb-calculus?","volume":"52","author":"Meyer","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90086-9_BIB23","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\/0304-3975(93)90086-9_BIB24","series-title":"Proc. ICALP'83","article-title":"Strong abstract interpretation using power domains","volume":"Vol. 154","author":"Mycroft","year":"1983"},{"key":"10.1016\/0304-3975(93)90086-9_BIB25","series-title":"Proc. STACS'86","first-page":"1","article-title":"Abstract interpretation of denotational definitions","volume":"Vol. 210","author":"Nielsen","year":"1986"},{"key":"10.1016\/0304-3975(93)90086-9_BIB26","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(88)90101-6","article-title":"Principal type scheme and unification for intersection type discipline","volume":"59","author":"della Rocca","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90086-9_BIB27","series-title":"Toposes, Algebraic Geometry and Logic","first-page":"97","article-title":"Continuous lattices","volume":"Vol. 274","author":"Scott","year":"1972"},{"key":"10.1016\/0304-3975(93)90086-9_BIB28","series-title":"Toposes, Algebraic Geometry and Logic","article-title":"Lectures on a Mathematical Theory of Computation","author":"Scott","year":"1981"},{"key":"10.1016\/0304-3975(93)90086-9_BIB29","series-title":"Proc. 9th Internat. Colloq. on Automata, Languages and Programming","first-page":"577","article-title":"Domains for denotational semantics","volume":"Vol. 140","author":"Scott","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900869?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900869?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:58:30Z","timestamp":1555077510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593900869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["0304397593900869"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90086-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}