{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:12Z","timestamp":1725663552116},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543459"},{"type":"electronic","value":"9783540475798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54345-7_49","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:42:52Z","timestamp":1330209772000},"page":"64-73","source":"Crossref","is-referenced-by-count":9,"title":["Strong conjunction and intersection types"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Alessi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Barbanera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"6_CR1","unstructured":"H.Barendregt. Lambda Calculus: its Sintax and Semantics. North Holland 1984."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"H. Barendregt, M. Coppo, M. Dezani. A Filter Lambda Model and the Completeness of Type Assignment. Journal of Simbolic Logic, 48, 931\u2013940, 1983.","journal-title":"Journal of Simbolic Logic"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","volume":"21","author":"M. Coppo","year":"1980","unstructured":"M. Coppo, M. Dezani. An extension of basic functionality theory for lambda-calculus. Notre Dame Journel of formal Logic, 21, 685\u2013693. 1980.","journal-title":"Notre Dame Journel of formal Logic"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"M.Coppo,M.Dezani,F.Honsell,G.Longo. Extended type structures and filter lambda models. Proceedings of Logic Colloquium '82 (eds. G.Lolli, G.Longo, A.Marcja), 241\u2013262. North-Holland. 1984.","DOI":"10.1016\/S0049-237X(08)71819-6"},{"key":"6_CR5","unstructured":"H.B. Curry, R.Feys. Combinatory Logic. Vol.I. North Holland. 1958."},{"key":"6_CR6","volume-title":"J.W.de Bakker, 25 Jaar Semantiek","author":"M. Dezani","year":"1989","unstructured":"M. Dezani, R. Hindley. Intersection Types for Combinatory Logic. J.W.de Bakker, 25 Jaar Semantiek edited by J.W. Klop et al., published by Centrum voor Wiskunde, Amsterdam. 1989. An expanded version to appear in Teoretical Computer Science."},{"key":"6_CR7","unstructured":"R.Hindley, J.P.Seldin. Introduction to Combinators and \u03bb-calculus. Cambridge University Press. 1986."},{"key":"6_CR8","first-page":"1","volume":"10","author":"S.C. Kleene","year":"1952","unstructured":"S.C. Kleene. Permutability of Inferences in Gentzen's Calculi LK and LJ. Memoirs of the American Mathematical Society. 10, 1\u201326. 1952.","journal-title":"Memoirs of the American Mathematical Society"},{"key":"6_CR9","first-page":"208","volume":"1130","author":"E.G.K. Lopez-Escobar","year":"1985","unstructured":"E.G.K. Lopez-Escobar. Proof Functional Connectives. LNM, 1130,208\u2013221. 1985.","journal-title":"LNM"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1305\/ndjfl\/1093635158","volume":"30","author":"G.E. Mints","year":"1989","unstructured":"G.E. Mints. The Completeness of Provable Realizability. Notre Dame Journal of Formal Logic. 30. 420\u2013441. 1989.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"6_CR11","unstructured":"G.E.Mints. Personal communication, 1991."},{"key":"6_CR12","unstructured":"G.Pottinger. A Type Assignment for the Strongly Normalizable \u03bb-terms. In To H.B.Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism (ed. Seldin and Hindley). 561\u2013577. Academic Press. 1980."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1991"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54345-7_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:20:55Z","timestamp":1619572855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54345-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543459","9783540475798"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-54345-7_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}