{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T20:49:13Z","timestamp":1760042953553,"version":"3.37.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319667058"},{"type":"electronic","value":"9783319667065"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66706-5_19","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T00:13:26Z","timestamp":1503015206000},"page":"382-404","source":"Crossref","is-referenced-by-count":8,"title":["A Gradual Interpretation of Union Types"],"prefix":"10.1007","author":[{"given":"Mat\u00edas","family":"Toro","sequence":"first","affiliation":[]},{"given":"\u00c9ric","family":"Tanter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/103135.103138","volume":"13","author":"M Abadi","year":"1991","unstructured":"Abadi, M., Cardelli, L., Pierce, B., Plotkin, G.: Dynamic typing in a statically typed language. ACM Trans. Program. Lang. Syst. 13(2), 237\u2013268 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, A., Findler, R.B., Siek, J., Wadler, P.: Blame for all. In: POPL 2011 (2011)","DOI":"10.1145\/1926385.1926409"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Ba\u00f1ados Schwerter, F., Garcia, R., Tanter, \u00c9.: A theory of gradual effect systems. In: ICFP 2014 (2014)","DOI":"10.1145\/2628136.2628149"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1006\/inco.1995.1086","volume":"119","author":"F Barbanera","year":"1995","unstructured":"Barbanera, F., Dezani-Ciancaglini, M., De\u2019Liguoro, H.: Intersection and union types: syntax and semantics. Inf. Comput. 119, 202\u2013230 (1995)","journal-title":"Inf. Comput."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Benzaken, V., Castagna, G., Frisch, A.: CDuce: an XML-centric general purpose language. In: ICFP 2003 (2003)","DOI":"10.1145\/944705.944711"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-44543-9_12","volume-title":"Research Issues in Structured and Semistructured Database Programming","author":"P Buneman","year":"2000","unstructured":"Buneman, P., Pierce, B.: Union types for semistructured data. In: Connor, R., Mendelzon, A. (eds.) DBPL 1999. LNCS, vol. 1949, pp. 184\u2013207. Springer, Heidelberg (2000). doi: 10.1007\/3-540-44543-9_12"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Castagna, G., Lanvin, V.: Gradual typing with union and intersection types. In: ICFP 2017 (2017)","DOI":"10.1145\/3110285"},{"key":"19_CR8","unstructured":"Microsoft Corporation: Typescript language specification. https:\/\/www.typescriptlang.org\/ . Accessed June 2017"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL 1977 (1977)","DOI":"10.1145\/512950.512973"},{"key":"19_CR10","unstructured":"Disney, T., Flanagan, C.: Gradual information flow typing. In: STOP 2011 (2011)"},{"key":"19_CR11","unstructured":"Facebook: Flow: a static type checker for JavaScript. https:\/\/flow.org\/ . Accessed June 2017"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Frisch, A., Castagna, G., Benzaken, V.: Semantic subtyping. In: LICS 2002 (2002)","DOI":"10.1109\/LICS.2002.1029823"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Garcia, R., Cimini, M.: Principal type schemes for gradual programs. In: POPL 2015 (2015)","DOI":"10.1145\/2676726.2676992"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Garcia, R., Clark, A.M., Tanter, \u00c9.: Abstracting gradual typing. In: POPL 2016 (2016)","DOI":"10.1145\/2837614.2837670"},{"key":"19_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139342131","volume-title":"Practical Foundations for Programming Languages","author":"PR Harper","year":"2012","unstructured":"Harper, P.R.: Practical Foundations for Programming Languages. Cambridge University Press, Cambridge (2012)"},{"issue":"3","key":"19_CR16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-6423(94)00004-2","volume":"22","author":"F Henglein","year":"1994","unstructured":"Henglein, F.: Dynamic typing: syntax and proof theory. Sci. Comput. Program. 22(3), 197\u2013230 (1994)","journal-title":"Sci. Comput. Program."},{"key":"19_CR17","unstructured":"Herman, D., Tomb, A., Flanagan, C.: Space-efficient gradual typing. In: Trends in Functional Programming (2007)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. In: ICFP 2000 (2000)","DOI":"10.1145\/351240.351242"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Jafery, K.A., Dunfield, J.: Sums of uncertainty: refinements go gradual. In: POPL 2017 (2017)","DOI":"10.1145\/3009837.3009865"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Kent, A.M., Kempe, D., Tobin-Hochstadt, S.: Occurrence typing modulo theories. In: PLDI 2016 (2016)","DOI":"10.1145\/2908080.2908091"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Lehmann, N., Tanter, \u00c9.: Gradual refinement types. In: POPL 2017 (2017)","DOI":"10.1145\/3009837.3009856"},{"key":"19_CR22","unstructured":"Pierce, B.C.: Programming with intersection types, union types, and polymorphism. Technical report CMU-CS-91-106 (1991)"},{"key":"19_CR23","volume-title":"Types and Programming Languages","author":"BC Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Rastogi, A., Chaudhuri, A., Hosmer, B.: The ins and outs of gradual type inference. In: POPL 2012 (2012)","DOI":"10.1145\/2103656.2103714"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Rompf, T., Amin, N.: Type soundness for dependent object types (DOT). In: OOPSLA 2016 (2016)","DOI":"10.1145\/2983990.2984008"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-73589-2_2","volume-title":"ECOOP 2007 \u2013 Object-Oriented Programming","author":"J Siek","year":"2007","unstructured":"Siek, J., Taha, W.: Gradual typing for objects. In: Ernst, E. (ed.) ECOOP 2007. LNCS, vol. 4609, pp. 2\u201327. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73589-2_2"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Siek, J., Tobin-Hochstadt, S.: The recursive union of some gradual types. In: Wadler Festschrift (2016)","DOI":"10.1007\/978-3-319-30936-1_21"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Siek, J., Wadler, P.: Threesomes, with and without blame. In: POPL 2010 (2010)","DOI":"10.1145\/1706299.1706342"},{"key":"19_CR29","unstructured":"Siek, J.G., Taha, W.: Gradual typing for functional languages. In: Scheme and Functional Programming Workshop (2006)"},{"key":"19_CR30","unstructured":"Siek, J.G., Vitousek, M.M., Cimini, M., Boyland, J.T.: Refined criteria for gradual typing. In: SNAPL 2015 (2015)"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Tobin-Hochstadt, S., Felleisen, M.: The design and implementation of typed scheme. In: POPL 2008 (2008)","DOI":"10.1145\/1328438.1328486"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Tobin-Hochstadt, S., Felleisen, M.: Logical types for untyped languages. In: ICFP 2010 (2010)","DOI":"10.1145\/1863543.1863561"},{"key":"19_CR33","unstructured":"Toro, M., Tanter, \u00c9.: Gradual union types\u2013complete definition and proofs. Technical report TR\/DCC-2017-1, University of Chile, June 2017"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66706-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T10:40:36Z","timestamp":1570012836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66706-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319667058","9783319667065"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66706-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}