{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:45Z","timestamp":1761611205036},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_26","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:28:20Z","timestamp":1178357300000},"page":"304-313","source":"Crossref","is-referenced-by-count":8,"title":["Compositional Characterizations of \u03bb-Terms Using Intersection Types"],"prefix":"10.1007","author":[{"given":"M.","family":"Dezani-Ciancaglini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Honsell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Motohama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"issue":"1\u20132","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"S. Abramsky. Domain theory in logical form. Ann. Pure Appl. Logic, 51(1\u20132):1\u201377, 1991.","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"S. Abramsky and C.-H. L. Ong. Full abstraction in the lazy lambda calculus. Inform. and Comput., 105(2):159\u2013267, 1993.","journal-title":"Inform. and Comput."},{"key":"26_CR3","unstructured":"F. Alessi, M. Dezani-Ciancaglini, and F. Honsell. A complete characterization of the complete intersection-type theories. In Proceedings in Informatics. ITRS\u201900 Workshop, Carleton-Scientific, 2000."},{"key":"26_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511983504","volume-title":"Domains and lambda-calculi","author":"R. M. Amadio","year":"1998","unstructured":"R. M. Amadio and P.-L. Curien. Domains and lambda-calculi. Cambridge University Press, Cambridge, 1998."},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(92)90297-S","volume":"102","author":"S. Bakel van","year":"1992","unstructured":"S. van Bakel. Complete restrictions of the intersection type discipline. Theoret. Comput. Sci., 102(1):135\u2013163, 1992.","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"26_CR6","doi-asserted-by":"publisher","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. J. Symbolic Logic, 48(4):931\u2013940, 1983.","journal-title":"J. Symbolic Logic"},{"key":"26_CR7","unstructured":"H.P. Barendregtet. al. Typed \u03bb-calculus and applications. North-Holland. (to appear)."},{"key":"26_CR8","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/BFb0029521","volume-title":"calculus and computer science theory","author":"C. B\u00f6hm","year":"1975","unstructured":"C. B\u00f6hm and M. Dezani-Ciancaglini. \u03bb-terms as total or partial functions on normal forms. In C. B\u00f6hm, editor, \u03bb-calculus and computer science theory, pages 96\u2013121, Lecture Notes in Comput. Sci., Vol. 37. Springer, Berlin, 1975."},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","volume":"21","author":"M. Coppo","year":"1980","unstructured":"M. Coppo and M. Dezani-Ciancaglini. An extension of the basic functionality theory for the \u03bb-calculus. Notre Dame J. Formal Logic, 21(4):685\u2013693, 1980.","journal-title":"Notre Dame J. Formal Logic"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0890-5401(87)90042-3","volume":"72","author":"M. Coppo","year":"1987","unstructured":"M. Coppo, M. Dezani-Ciancaglini, and M. Zacchi. Type theories, normal forms, and D\u221e-lambda-models. Inform. and Comput., 72(2):85\u2013116, 1987.","journal-title":"Inform. and Comput."},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0049-237X(08)71819-6","volume-title":"Logic colloquium\u2019 82","author":"M. Coppo","year":"1984","unstructured":"M. Coppo, F. Honsell, M. Dezani-Ciancaglini, and G. Longo. Extended type struc-tures and filter lambda models. In G. Longo et. al., editors, Logic colloquium\u2019 82, pages 241\u2013262. North-Holland, Amsterdam, 1984."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"M. Dezani-Ciancaglini, F. Honsell, and Y. Motohama. Compositional cha-racterization of \u03bb-terms using intersection types. Internal report, 2000, ( http:\/\/www.di.unito.it\/~yoko\/paper\/dezahonsmoto2000.ps ).","DOI":"10.1007\/3-540-44612-5_26"},{"issue":"2","key":"26_CR13","first-page":"149","volume":"16","author":"L. Egidi","year":"1992","unstructured":"L. Egidi, F. Honsell, and S. Ronchi Della Rocca. Operational, denotational and logical descriptions: a case study. Fund. Inform., 16(2):149\u2013169, 1992.","journal-title":"Fund. Inform."},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1305\/ndjfl\/1040067315","volume":"37","author":"S. Ghilezan","year":"1996","unstructured":"S. Ghilezan. Strong normalization and typability with intersection types. Notre Dame J. Formal Logic, 37(1):44\u201352, 1996.","journal-title":"Notre Dame J. Formal Logic"},{"issue":"1-2","key":"26_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(98)00140-6","volume":"212","author":"F. Honsell","year":"1999","unstructured":"F. Honsell and M. Lenisa. Semantical analysis of perpetual strategies in \u03bb-calculus. Theoret. Comput. Sci., 212(1-2):183\u2013209, 1999.","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"26_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0022-0000(92)90040-P","volume":"45","author":"F. Honsell","year":"1992","unstructured":"F. Honsell and S. Ronchi Della Rocca. An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus. J. Comput. System Sci., 45(1):49\u201375, 1992.","journal-title":"J. Comput. System Sci."},{"key":"26_CR17","volume-title":"Lambda-calcul Types et Mod\u00e9les","author":"J.-L. Krivine","year":"1990","unstructured":"J.-L. Krivine. Lambda-calcul Types et Mod\u00e9les. Masson, Paris, 1990. English translation: Lambda-calculus, types and models, Ellis Horwood, 1993."},{"issue":"1","key":"26_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(86)90109-X","volume":"44","author":"D. Leivant","year":"1986","unstructured":"D. Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51\u201368, 1986.","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR19","unstructured":"J. Mitchell. Foundation for Programmimg Languages. MIT Press, 1996."},{"issue":"1-2","key":"26_CR20","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0304-3975(93)90094-A","volume":"121","author":"G. D. Plotkin","year":"1993","unstructured":"G. D. Plotkin. Set-theoretical and other elementary models of the \u03bb-calculus. Theoret. Comput. Sci., 121(1-2):351\u2013409, 1993.","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR21","first-page":"561","volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"G. Pottinger","year":"1980","unstructured":"G. Pottinger. A type assignment for the strongly normalizable \u03bb-terms. In J.R. Hindley and J.P. Seldin, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 561\u2013577. Academic Press, London, 1980."},{"key":"26_CR22","series-title":"Lecture Notes in Math.","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0073967","volume-title":"Toposes, Algebraic Geo-metry and Logic","author":"D. Scott","year":"1972","unstructured":"D. Scott. Continuous lattices. In F.W. Lawvere, editor, Toposes, Algebraic Geo-metry and Logic, pages 97\u2013136. Lecture Notes in Math., Vol. 274. Springer, Berlin, 1972."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:41:31Z","timestamp":1556376091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}