{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:53Z","timestamp":1725662933036},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133469"},{"type":"electronic","value":"9783540388913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13346-1_14","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:04:52Z","timestamp":1330175092000},"page":"279-300","source":"Crossref","is-referenced-by-count":2,"title":["F-semantics for intersection type discipline"],"prefix":"10.1007","author":[{"given":"M.","family":"Dezani-Ciancaglini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Margaria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"14_CR1","volume-title":"The Lambda Calculus, its Syntax and Semantics","author":"H. Barendregt","year":"1981","unstructured":"Barendregt H., The Lambda Calculus, its Syntax and Semantics, (North-Holland, Amsterdam, 1981)."},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"Barendregt H., Coppo M., Dezani-Ciancaglini M., A Filter Lambda Model and the Completeness of Type Assignment, J. Symbolic Logic 48 (1983) 931\u2013940.","journal-title":"J. Symbolic Logic"},{"key":"14_CR3","unstructured":"Ben-Yelles C.B., Type Assignment in the Lambda-Calculus: Syntax and Semantics, Doctoral Thesis, University College of Swansea, 1979."},{"key":"14_CR4","unstructured":"Bruce K., Meyer A., The Semantics of Second Order Polymorphic Lambda Calculus, in this volume."},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/BFb0022505","volume-title":"Mathematical Foundations of Computer Science 1980","author":"M. Coppo","year":"1980","unstructured":"Coppo M., An Extended Polymorphic Type System for Applicative Languages, in: P. Dembinski, ed., Mathematical Foundations of Computer Science 1980, 9th Symposium, LNCS 88, (Springer-Verlag, Berlin, 1980) pp. 194\u2013204."},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289413","volume":"20","author":"M. Coppo","year":"1983","unstructured":"Coppo M., On the Semantics of Polymorphism, Acta Informatica, 20 (1983) 159\u2013170.","journal-title":"Acta Informatica"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Coppo M., Completeness of Type Assignment in Continuous Lambda Models, Theor. Comput. Sci. (to appear).","DOI":"10.1016\/0304-3975(84)90005-7"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02011875","volume":"19","author":"M. Coppo","year":"1979","unstructured":"Coppo M., Dezani-Ciancaglini M., A New Type Assignment for \u03bb-terms, Archiv f\u00fcr Math. Logik und Grundlagenforschung 19 (1979) 139\u2013156.","journal-title":"Archiv f\u00fcr Math. Logik und Grundlagenforschung"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","volume":"21-4","author":"M. Coppo","year":"1980","unstructured":"Coppo M., Dezani-Ciancaglini M., An Extension of the Basic Functionality Theory for the \u03bb-Calculus, Notre Dame J. of Formal Logic 21-4 (1980) 685\u2013693.","journal-title":"Notre Dame J. of Formal Logic"},{"key":"14_CR10","volume-title":"Logic Colloquium '82","author":"M. Coppo","year":"1983","unstructured":"Coppo M., Dezani-Ciancaglini M., Honsell F., Longo G., Extended Type Structures and Filter Lambda Models, in: G. Lolli et al., eds. Logic Colloquium '82, (North-Holland, Amsterdam, 1983) (to appear)."},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/malq.19810270205","volume":"27","author":"M. Coppo","year":"1981","unstructured":"Coppo M., Dezani-Ciancaglini M., Venneri B., Functional Characters of Solvable Terms, Z. Math. Logik Grundlag. Math. 27 (1981) 45\u201358.","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"14_CR12","unstructured":"Coppo M., Dezani-Ciancaglini M., Venneri B., Principal Type Schemes and \u03bb-calculus Semantics in: R.Hindley and J.P.Seldin, eds., To H.B.Curry, Essay in Combinatory Logic, Lambda Calculus and Formalism, (Academic Press, 1980) pp. 595\u2013560."},{"key":"14_CR13","unstructured":"Coppo M., Dezani-Ciancaglini M., Zacchi M., Type Theories, Normal Forms and D\u221e \u2014 Lambda Models, Internal Report, Computer Science Department, Turin University, 1983."},{"key":"14_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-12727-5_10","volume-title":"CAAP 83, LNCS, 159","author":"M. Coppo","year":"1983","unstructured":"Coppo M., Giovannetti E., Completeness Results for a Polymorphic Type System, in: G. Ausiello, ed., CAAP 83, LNCS, 159 (Springer-Verlag, Berlin 1983) pp.179\u2013190."},{"key":"14_CR15","volume-title":"Combinatory Logic I","author":"H.B. Curry","year":"1958","unstructured":"Curry H.B., Feys R., Combinatory Logic I, (North Holland, Amsterdam, 1958)."},{"key":"14_CR16","volume-title":"Combinatory Logic II","author":"H.B. Curry","year":"1972","unstructured":"Curry H.B., Hindley R., Seldin J.P., Combinatory Logic II, (North Holland, Amsterdam, 1972)."},{"key":"14_CR17","unstructured":"Dezani-Ciancaglini M., Margaria I., A Characterization of F-complete Polymorphic Type Assignments, Internal Report, Computer Science Department, Turin University 1983."},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/322358.322370","volume":"30","author":"S. Fortune","year":"1983","unstructured":"Fortune S., Leivant D., O'Donnel M., The Expressiveness of Simple and Second Order Type Structures, Journal of ACM 30 (1983) 151\u2013185.","journal-title":"Journal of ACM"},{"key":"14_CR19","first-page":"29","volume":"146","author":"R. Hindley","year":"1969","unstructured":"Hindley R., The Principal Type Scheme of an Object in Combinatory Logic, Trans. Amer. Math. Soc. 146 (1969) 29\u201360.","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1","key":"14_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(83)90136-6","volume":"22","author":"R. Hindley","year":"1983","unstructured":"Hindley R., The Completeness Theorem for Typing \u03bb-terms, Theor. Comput. Sci. 22 (1) (1983) 1\u201317.","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"14_CR21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(83)90141-X","volume":"22","author":"R. Hindley","year":"1983","unstructured":"Hindley R., Curry's Type-Rules are Complete with respect to F-semantics too, Theor. Comput. Sci. 22 (1) (1983) 127\u2013133.","journal-title":"Theor. Comput. Sci."},{"key":"14_CR22","first-page":"212","volume-title":"International Symposium on Programming, LNCS, 137","author":"R. Hindley","year":"1981","unstructured":"Hindley R., The Simple Semantics for Coppo-Dezani-Sall\u00e9 Type Assignment, in: M. Dezani-Ciancaglini and U. Montanari, eds., International Symposium on Programming, LNCS, 137, (Springer-Verlag, Berlin 1981) pp. 212\u2013226."},{"key":"14_CR23","unstructured":"Hindley R., Private Communication, (1980)."},{"key":"14_CR24","first-page":"289","volume":"26","author":"R. Hindley","year":"1980","unstructured":"Hindley R., Longo G., Lambda Calculus Models and Extensionality, Zeitschr. Math. Logik 26 (1980) 289\u2013310.","journal-title":"Zeitschr. Math. Logik"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Leivant D., Polymorphic Type Inference, Proc. 10th ACM Symposium on Principles of Programming Languages, Austin Texas (1983), 88\u201398.","DOI":"10.1145\/567067.567077"},{"issue":"2","key":"14_CR26","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","volume":"24","author":"G. Longo","year":"1983","unstructured":"Longo G., Set-Theoretical Model of \u03bb-calculus: Theories, Expansions, Isomorphism, Annals of Pure and Applied Logic 24(2) (1983) 153\u2013188.","journal-title":"Annals of Pure and Applied Logic"},{"key":"14_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"Milner R., Fully Abstract Models of Typed \u03bb-calculus, Theor. Comput. Sci. 4 (1977) 1\u201322.","journal-title":"Theor. Comput. Sci."},{"key":"14_CR28","unstructured":"McCracken N., An Investigation of a Programming Language with a Polymorphic Type Structure, Ph. D. Thesis, Syracuse University, 1979."},{"key":"14_CR29","unstructured":"Mac Queen D.B., Sethy R., A Semantic Model of Types for Applicative Languages, ACM Symposium of LISP and Functional Programming, (1983), pp. 243\u2013252."},{"key":"14_CR30","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/3-540-06859-7_148","volume-title":"Programming Symposium, LNCS 19","author":"J.C. Reynolds","year":"1974","unstructured":"Reynolds J.C., Towards a Theory of Type Structure in: B. Robinet, ed., Programming Symposium, LNCS 19 (Springer-Verlag, Berlin, 1974) pp. 408\u2013425."},{"key":"14_CR31","first-page":"513","volume-title":"Proceedings IFIP 83","author":"J.C. Reynolds","year":"1983","unstructured":"Reynolds J.C., Types, Abstraction and Parametric Polymorphism, in R.F.A. Mason, ed., Proceedings IFIP 83 (North-Holland, Amsterdam, 1983) pp. 513\u2013529."},{"key":"14_CR32","first-page":"368","volume-title":"\u03bb-calculus and Computer Science Theory, LNCS 37","author":"D.S. Scott","year":"1975","unstructured":"Scott D.S., Open Problems n.II, 4 in C. B\u00f6hm, ed., \u03bb-calculus and Computer Science Theory, LNCS 37, (Springer-Verlag, Berlin, 1975) p.368."},{"key":"14_CR33","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D.S. Scott","year":"1976","unstructured":"Scott D.S., Data Types as Lattices, SIAM J. Comput. 5 (1976) 522\u2013587.","journal-title":"SIAM J. Comput."},{"key":"14_CR34","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0049-237X(08)71262-X","volume-title":"The Kleene Symposium, Studies in Logic","author":"D.S. Scott","year":"1980","unstructured":"Scott D.S., Lambda Calculus: some Models, some Philosophy, in: I. Barwise et al., eds., The Kleene Symposium, Studies in Logic, (North-Holland, Amsterdam, 1980) pp. 223\u2013266."},{"key":"14_CR35","unstructured":"Scott D.S., Letter to Albert Meyer (1980)."},{"key":"14_CR36","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/BFb0012801","volume-title":"Automata, Language and Programming, LNCS 140","author":"D.S. Scott","year":"1982","unstructured":"Scott D.S., Domains for Denotational Semantics in: M. Nielsen and E. Schmidt, eds. Automata, Language and Programming, LNCS 140 (Springer-Verlag, Berlin, 1982) pp. 577\u2013610."}],"container-title":["Lecture Notes in Computer Science","Semantics of Data Types"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13346-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:52:53Z","timestamp":1619542373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13346-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133469","9783540388913"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-13346-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}