{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T02:01:34Z","timestamp":1726452094805},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90043-5","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"121-157","source":"Crossref","is-referenced-by-count":16,"special_numbering":"C","title":["A characterization of F-complete type assignments"],"prefix":"10.1016","volume":"45","author":[{"given":"Mariangiola","family":"Dezani-Ciancaglini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ines","family":"Margaria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1984","series-title":"The Lambda Calculus, its Syntax and Semantics","author":"Barendregt","key":"10.1016\/0304-3975(86)90043-5_BIB1"},{"key":"10.1016\/0304-3975(86)90043-5_BIB2","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"},{"article-title":"Type assignment in the lambda calculus: Syntax and semantics","year":"1979","author":"Ben-Yelles","key":"10.1016\/0304-3975(86)90043-5_BIB3"},{"key":"10.1016\/0304-3975(86)90043-5_BIB4","series-title":"Mathematical Foundations of Computer Science 1980","first-page":"194","article-title":"An extended polymorphic type system for applicative languages","volume":"88","author":"Coppo","year":"1980"},{"key":"10.1016\/0304-3975(86)90043-5_BIB5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289413","article-title":"On the semantics of polymorphism","volume":"20","author":"Coppo","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(86)90043-5_BIB6","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(86)90043-5_BIB7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02011875","article-title":"A new type assignment for \u03bb-terms","volume":"19","author":"Coppo","year":"1979","journal-title":"Arch. Math. Logik Grundlag."},{"issue":"4","key":"10.1016\/0304-3975(86)90043-5_BIB8","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","article-title":"An extension of the basic functionality theory for the \u03bb-calculus","volume":"21","author":"Coppo","year":"1980","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/0304-3975(86)90043-5_BIB9","series-title":"Logic Colloquim '82","first-page":"241","article-title":"Extended type structures and filter lambda models","author":"Coppo","year":"1984"},{"key":"10.1016\/0304-3975(86)90043-5_BIB10","article-title":"Applicative information systems and recursive domain equations","author":"Coppo","year":"1984","journal-title":"Internal Rept."},{"key":"10.1016\/0304-3975(86)90043-5_BIB11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/malq.19810270205","article-title":"Functional characteris of solvable terms","volume":"27","author":"Coppo","year":"1981","journal-title":"Z. Math. Logik. Grundlag. Math."},{"key":"10.1016\/0304-3975(86)90043-5_BIB12","series-title":"To. H.B. Curry, Essays in Combinatory Logic, Lambda Calculus and Formalism","first-page":"535","article-title":"Principal type schemes and \u03bb-calculus semantics","author":"Coppo","year":"1980"},{"key":"10.1016\/0304-3975(86)90043-5_BIB13","doi-asserted-by":"crossref","unstructured":"M. Coppo, M. Dezani-Ciancaglini and M. Zacchi, Type theories, normal forms and D\u221e lambda models, Inform. and Control, to appear.","DOI":"10.1016\/0890-5401(87)90042-3"},{"key":"10.1016\/0304-3975(86)90043-5_BIB14","series-title":"CAAP 1983","first-page":"179","article-title":"Completeness results for a polymorphic type system","volume":"159","author":"Coppo","year":"1983"},{"year":"1958","series-title":"Combinatory Logic I","author":"Curry","key":"10.1016\/0304-3975(86)90043-5_BIB15"},{"year":"1972","series-title":"Combinatory Logic II","author":"Curry","key":"10.1016\/0304-3975(86)90043-5_BIB16"},{"key":"10.1016\/0304-3975(86)90043-5_BIB17","series-title":"Semantics of Data Types","first-page":"279","article-title":"F-semantics for intersection type discipline","volume":"173","author":"Dezani-Ciancaglini","year":"1984"},{"key":"10.1016\/0304-3975(86)90043-5_BIB18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/322358.322370","article-title":"The expressiveness of simple and second-order type structures","volume":"30","author":"Fortune","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(86)90043-5_BIB19","series-title":"2nd Scandinavian Logic Symp.","first-page":"63","article-title":"Une extension de l'interpretation d G\u00f6del \u00e0 l'analyse et son application \u00e0 l\u00e9limination des coupres dans l'analyse et la th\u00e9orie des types","author":"Girard","year":"1971"},{"key":"10.1016\/0304-3975(86)90043-5_BIB20","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."},{"issue":"1","key":"10.1016\/0304-3975(86)90043-5_BIB21","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."},{"issue":"1","key":"10.1016\/0304-3975(86)90043-5_BIB22","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(83)90141-X","article-title":"Curry's type-rules are complete with respect to F-semantics","volume":"22","author":"Hindley","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90043-5_BIB23","series-title":"Internat. Symp. on Programming","first-page":"212","article-title":"The simple semantics for Coppo-Dezani-Sall\u00e9 type assignment","volume":"137","author":"Hindley","year":"1981"},{"key":"10.1016\/0304-3975(86)90043-5_BIB24","doi-asserted-by":"crossref","unstructured":"R. Hindley, Private Communication, 1980.","DOI":"10.1038\/286865a0"},{"key":"10.1016\/0304-3975(86)90043-5_BIB25","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/malq.19800261902","article-title":"Lambda calculus models and extensionality","volume":"26","author":"Hindley","year":"1980","journal-title":"Math. Logik Grundlag. Math."},{"issue":"2","key":"10.1016\/0304-3975(86)90043-5_BIB26","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","article-title":"A syntactic characterization of the equality in some models of the \u03bb-calculus","volume":"12","author":"Hyland","year":"1976","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0304-3975(86)90043-5_BIB27","series-title":"Proc. 10th ACM Symp. Principles of Programming Languages","first-page":"88","article-title":"Polymorphic type inference","author":"Leivant","year":"1983"},{"issue":"1","key":"10.1016\/0304-3975(86)90043-5_BIB28","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(76)90009-8","article-title":"An algebraic interpretation of the \u03bb\u03b2K-calculus and an application of a labelled \u03bb-calculus","volume":"2","author":"L\u00e9vy","year":"1976","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0304-3975(86)90043-5_BIB29","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, isomorphism","volume":"24","author":"Longo","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(86)90043-5_BIB30","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\/0304-3975(86)90043-5_BIB31","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(86)90043-5_BIB32","first-page":"243","article-title":"A semantic model of types for applicative languages","author":"MacQueen","year":"1983"},{"key":"10.1016\/0304-3975(86)90043-5_BIB33","series-title":"Programming Symposium","first-page":"408","article-title":"Towards a theory of type structure","volume":"19","author":"Reynolds","year":"1974"},{"key":"10.1016\/0304-3975(86)90043-5_BIB34","series-title":"Toposes, Algebraic Geometry and Logic","first-page":"97","article-title":"Continuous lattices","volume":"274","author":"Scott","year":"1972"},{"key":"10.1016\/0304-3975(86)90043-5_BIB35","series-title":"\u03bb-Calculus and Computer Science Theory","first-page":"368","article-title":"Open problems II, 4","volume":"37","author":"Scott","year":"1975"},{"key":"10.1016\/0304-3975(86)90043-5_BIB36","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(86)90043-5_BIB37","series-title":"The Kleene Symposium, Studies in Logic","first-page":"223","article-title":"Lambda calculus: Some models, some philosophy","author":"Scott","year":"1980"},{"key":"10.1016\/0304-3975(86)90043-5_BIB38","doi-asserted-by":"crossref","unstructured":"D.S. Scott, Letter to Albert Meyer, 1980.","DOI":"10.1145\/800141.804646"},{"key":"10.1016\/0304-3975(86)90043-5_BIB39","series-title":"Automata, Languages and Programming","first-page":"577","article-title":"Domains for denotational semantics","volume":"140","author":"Scott","year":"1982"},{"year":"1972","series-title":"Combinators, \u03bb-terms and Proof theory","author":"Stenlund","key":"10.1016\/0304-3975(86)90043-5_BIB40"},{"key":"10.1016\/0304-3975(86)90043-5_BIB41","doi-asserted-by":"crossref","first-page":"198","DOI":"10.2307\/2271658","article-title":"Intentional interpretation of functionals of finite type","volume":"32","author":"Tait","year":"1967","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(86)90043-5_BIB42","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for D\u221e-models of the lambda-calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900435?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900435?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:53:37Z","timestamp":1553201617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":42,"alternative-id":["0304397586900435"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90043-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1986]]}}}