{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:23Z","timestamp":1725493463657},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427360"},{"type":"electronic","value":"9783540455004"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45500-0_22","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T19:37:33Z","timestamp":1193341053000},"page":"448-458","source":"Crossref","is-referenced-by-count":0,"title":["Infinite Intersection and Union Types for the Lazy Lambda Calculus"],"prefix":"10.1007","author":[{"given":"Marcello M.","family":"Bonsangue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost N.","family":"Kok","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,10]]},"reference":[{"key":"22_CR1","unstructured":"S. Abramsky. The lazy lambda calculus. In Research Topics in Functional Programming, pp. 65\u2013117, Addison Wesley, 1990."},{"issue":"1","key":"22_CR2","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. Annals of Pure and Applied Logic, 51(1):1\u201377, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"key":"22_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/3-540-54415-1_69","volume-title":"Proceedings of TACS\u201991","author":"F. Barbanera","year":"1991","unstructured":"F. Barbanera and M. Dezani-Ciancaglini. Intersection and union types. In Proceedings of TACS\u201991, vol. 526 of Lecture Notes in Computer Science, pp. 651\u2013674. Springer-Verlag, 1991."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1006\/inco.1995.1086","volume":"119","author":"F. Barbanera","year":"1995","unstructured":"F. Barbanera, M. Dezani-Ciancaglini, and U. d\u00e9 Liguoro. Intersection and union types: syntax and semantics. Information and Computation, 119:202\u2013230, 1995.","journal-title":"Information and Computation"},{"key":"22_CR5","unstructured":"H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North Holland, 1984."},{"issue":"4","key":"22_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. Journal of Symbolic Logic 48(4):931\u2013940, 1983.","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(95)00048-2","volume":"151","author":"M.M. Bonsangue","year":"1995","unstructured":"M.M. Bonsangue, B. Jacobs, and J.N. Kok. Duality beyond sober spaces: topological spaces and observation frames. Theoretical Computer Science, 151(1):79\u2013124, 1995.","journal-title":"Theoretical Computer Science"},{"key":"22_CR8","unstructured":"M.M. Bonsangue. Topological Dualities in Semantics. Vol. 8 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 1997."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/inco.1999.2827","volume":"155","author":"M.M. Bonsangue","year":"1999","unstructured":"M.M. Bonsangue and J.N. Kok. Towards an infinitary logic of domains: Abramsky logic for transition systems. Information and Computation, 155:170\u2013201, 1999.","journal-title":"Information and Computation"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02011875","volume":"19","author":"M. Coppo","year":"1978","unstructured":"M. Coppo and M. Dezani-Ciancaglini. A new type-assignment for \u03bb-term. In Archiv. Math. Logik, 19:139\u2013156, 1978.","journal-title":"Archiv. Math. Logik"},{"key":"22_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/3-540-44612-5_26","volume-title":"Proceedings of MFCS 2000","author":"M. Dezani-Ciancaglini","year":"2000","unstructured":"M. Dezani-Ciancaglini, F. Honsell and Y. Motohama. Compositional characterizations of \u03bb-terms using intersection types. In Proceedings of MFCS 2000, vol. 1893 of Lecture Notes in Computer Science, pp. 304\u2013313. Springer-Verlag, 2000."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BFb0089908","volume":"871","author":"K.H. Hofmann","year":"1981","unstructured":"K.H. Hofmann and M.W. Mislove. Local compactness and continuous lattices. In Continuous lattices-Proceedings Bremen 1979, vol. 871 of Lecture Notes in Mathematics, pp. 209\u2013248. Springer-Verlag, 1981.","journal-title":"Continuous lattices-Proceedings Bremen 1979"},{"key":"22_CR13","unstructured":"P.T. Johnstone. Stone Spaces. Cambridge University Press, 1982."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"D. Leivant. Discrete polymorphism. In Proceedings of 1990 ACM Conference of LISP and Functional Programming, pp. 288\u2013297.","DOI":"10.1145\/91556.91675"},{"key":"22_CR15","unstructured":"B.C. Pierce. Programming with intersection types, union types, and polymorphism. Technical Report CMU-CS-91-106, Carnegie Mellon University, 1991."},{"key":"22_CR16","unstructured":"G. Pottinger. A type assignment for the strongly normalizable \u03bb-term. In To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, pp. 561\u2013577. Academic Press, 1980."},{"issue":"4","key":"22_CR17","doi-asserted-by":"publisher","first-page":"677","DOI":"10.2307\/2032165","volume":"3","author":"G. Raney","year":"1952","unstructured":"G. Raney. Completely distributive complete lattices. In Proceedings of the American Mathematical Society vol. 3(4), pp. 677\u2013680, 1952.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"22_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BFb0012801","volume-title":"International Colloquioum on Automata, Languages, and Programs","author":"D.S. Scott","year":"1982","unstructured":"D.S. Scott Domains for denotational semantics. In M. Nielson and E.M. Schmidt (eds.), International Colloquioum on Automata, Languages, and Programs, volume 140 of Lecture Notes in Computer Science, pp 577\u2013613, Springer-Verlag, 1982."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45500-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T15:34:11Z","timestamp":1551022451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45500-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427360","9783540455004"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45500-0_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}