{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T04:56:18Z","timestamp":1773809778185,"version":"3.50.1"},"reference-count":93,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,3,5]],"date-time":"2023-03-05T00:00:00Z","timestamp":1677974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF 1518844, CCF 1763922, CNS 1823244, CCF 2030859"],"award-info":[{"award-number":["CCF 1518844, CCF 1763922, CNS 1823244, CCF 2030859"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2023,3,31]]},"abstract":"<jats:p>The literature presents many strategies for enforcing the integrity of types when typed code interacts with untyped code. This article presents a uniform evaluation framework that characterizes the differences among some major existing semantics for typed\u2013untyped interaction. Type system designers can use this framework to analyze the guarantees of their own dynamic semantics.<\/jats:p>","DOI":"10.1145\/3579833","type":"journal-article","created":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T15:57:43Z","timestamp":1673539063000},"page":"1-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Typed\u2013Untyped Interactions: A Comparative Analysis"],"prefix":"10.1145","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7078-9287","authenticated-orcid":false,"given":"Ben","family":"Greenman","sequence":"first","affiliation":[{"name":"PLT @ Brown University, Providence RI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9338-7034","authenticated-orcid":false,"given":"Christos","family":"Dimoulas","sequence":"additional","affiliation":[{"name":"PLT @ Northwestern University, Evanston IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6678-1004","authenticated-orcid":false,"given":"Matthias","family":"Felleisen","sequence":"additional","affiliation":[{"name":"PLT @ Northeastern University, Boston MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,3,5]]},"reference":[{"key":"e_1_3_3_2_2","first-page":"201","volume-title":"Proceedings of the POPL","author":"Ahmed Amal","year":"2011","unstructured":"Amal Ahmed, Robert Bruce Findler, Jeremy G. Siek, and Philip Wadler. 2011. Blame for all. In Proceedings of the POPL. 201\u2013214."},{"key":"e_1_3_3_3_2","first-page":"163","volume-title":"Proceedings of the POPL","author":"Aiken Alexander","year":"1994","unstructured":"Alexander Aiken, Edward L. Wimmers, and T. K. Lakshman. 1994. Soft typing with conditional types. In Proceedings of the POPL. 163\u2013173."},{"issue":"1","key":"e_1_3_3_4_2","first-page":"52","article-title":"Gradual typing for smalltalk","volume":"96","author":"Allende Esteban","year":"2013","unstructured":"Esteban Allende, Oscar Calla\u00fa, Johan Fabry, \u00c9ric Tanter, and Marcus Denker. 2013. Gradual typing for smalltalk. Sci. Comput. Program. 96, 1 (2013), 52\u201369.","journal-title":"Sci. Comput. Program."},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/AAI28000842"},{"issue":"7","key":"e_1_3_3_6_2","first-page":"53","article-title":"BabyJ: From object based to class based programming via types","volume":"82","author":"Anderson Christopher","year":"2003","unstructured":"Christopher Anderson and Sophia Drossopoulou. 2003. BabyJ: From object based to class based programming via types. WOOD 82, 7 (2003), 53\u201381.","journal-title":"WOOD"},{"key":"e_1_3_3_7_2","first-page":"54:1\u201354:24","article-title":"Sound gradual typing: only mostly dead","volume":"1","author":"Bauman Spenser","year":"2017","unstructured":"Spenser Bauman, Carl Friedrich Bolz-Tereick, Jeremy Siek, and Sam Tobin-Hochstadt. 2017. Sound gradual typing: only mostly dead. PACMPL 1, OOPSLA (2017), 54:1\u201354:24.","journal-title":"PACMPL"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/0212024"},{"key":"e_1_3_3_9_2","first-page":"257","volume-title":"Proceedings of the ECOOP","author":"Bierman Gavin","year":"2014","unstructured":"Gavin Bierman, Martin Abadi, and Mads Torgersen. 2014. Understanding TypeScript. In Proceedings of the ECOOP. 257\u2013281."},{"key":"e_1_3_3_10_2","first-page":"117","volume-title":"Proceedings of the OOPSLA","author":"Bloom Bard","year":"2009","unstructured":"Bard Bloom, John Field, Nathaniel Nystrom, Johan \u00d6stlund, Gregor Richards, Rok Strni\u0161a, Jan Vitek, and Tobias Wrigstad. 2009. Thorn: Robust, concurrent, extensible scripting on the JVM. In Proceedings of the OOPSLA. 117\u2013136."},{"key":"e_1_3_3_11_2","first-page":"68","volume-title":"Proceedings of the ESOP","author":"Bonnaire-Sergeant Ambrose","year":"2016","unstructured":"Ambrose Bonnaire-Sergeant, Rowan Davies, and Sam Tobin-Hochstadt. 2016. Practical optional types for clojure. In Proceedings of the ESOP. 68\u201394."},{"key":"e_1_3_3_12_2","first-page":"215","volume-title":"Proceedings of the OOPSLA","author":"Bracha Gilad","year":"1993","unstructured":"Gilad Bracha and David Griswold. 1993. Strongtalk: Typechecking smalltalk in a production environment. In Proceedings of the OOPSLA. 215\u2013230."},{"key":"e_1_3_3_13_2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/800087.802789","volume-title":"Proceedings of the LFP","author":"Cartwright Robert","year":"1980","unstructured":"Robert Cartwright. 1980. A constructive alternative to data type definitions. In Proceedings of the LFP. 46\u201355."},{"key":"e_1_3_3_14_2","first-page":"278","volume-title":"Proceedings of the PLDI","author":"Cartwright Robert","year":"1991","unstructured":"Robert Cartwright and Mike Fagan. 1991. Soft typing. In Proceedings of the PLDI. 278\u2013292."},{"key":"e_1_3_3_15_2","first-page":"8:1\u20138:12","volume-title":"Proceedings of the IFL","author":"Castagna Giuseppe","year":"2019","unstructured":"Giuseppe Castagna, Guillaume Duboc, Victor Lanvin, and Jeremy G. Siek. 2019. A space-efficient call-by-value virtual machine for gradual set-theoretic types. In Proceedings of the IFL. 8:1\u20138:12."},{"key":"e_1_3_3_16_2","first-page":"41:1\u201341:28","article-title":"Gradual typing with union and intersection types","volume":"1","author":"Castagna Giuseppe","year":"2017","unstructured":"Giuseppe Castagna and Victor Lanvin. 2017. Gradual typing with union and intersection types. PACMPL 1, ICFP (2017), 41:1\u201341:28.","journal-title":"PACMPL"},{"key":"e_1_3_3_17_2","first-page":"56:1\u201356:30","article-title":"Fast and precise type checking for JavaScript","volume":"1","author":"Chaudhuri Avik","year":"2017","unstructured":"Avik Chaudhuri, Panagiotis Vekris, Sam Goldman, Marshall Roch, and Gabriel Levy. 2017. Fast and precise type checking for JavaScript. PACMPL 1, OOPSLA (2017), 56:1\u201356:30.","journal-title":"PACMPL"},{"key":"e_1_3_3_18_2","first-page":"67","volume-title":"Proceedings of the ICFP","author":"Chitil Olaf","year":"2012","unstructured":"Olaf Chitil. 2012. Practical typed lazy contracts. In Proceedings of the ICFP. 67\u201376."},{"key":"e_1_3_3_19_2","first-page":"12:1\u201312:23","volume-title":"Proceedings of the ECOOP","author":"Chung Benjamin W.","year":"2018","unstructured":"Benjamin W. Chung, Paley Li, Francesco Zappa Nardelli, and Jan Vitek. 2018. KafKa: Gradual typing for objects. In Proceedings of the ECOOP. 12:1\u201312:23."},{"key":"e_1_3_3_20_2","unstructured":"Dart. 2020. The Dart Type System. Retrieved from https:\/\/dart.dev\/guides\/language\/type-system."},{"key":"e_1_3_3_21_2","first-page":"97","volume-title":"Proceedings of the PEPM","author":"Degen Markus","year":"2012","unstructured":"Markus Degen, Peter Thiemann, and Stefan Wehr. 2012. The interaction of contracts and laziness. In Proceedings of the PEPM. 97\u2013106."},{"issue":"5","key":"e_1_3_3_22_2","first-page":"16:1\u201316:29","article-title":"On contract satisfaction in a higher-order world","volume":"33","author":"Dimoulas Christos","year":"2011","unstructured":"Christos Dimoulas and Matthias Felleisen. 2011. On contract satisfaction in a higher-order world. Trans. Program. Lang. Syst. 33, 5 (2011), 16:1\u201316:29.","journal-title":"Trans. Program. Lang. Syst."},{"key":"e_1_3_3_23_2","first-page":"215","volume-title":"Proceedings of the POPL","author":"Dimoulas Christos","year":"2011","unstructured":"Christos Dimoulas, Robert Bruce Findler, Cormac Flanagan, and Matthias Felleisen. 2011. Correct blame for contracts: No more scapegoating. In Proceedings of the POPL. 215\u2013226."},{"key":"e_1_3_3_24_2","first-page":"214","volume-title":"Proceedings of the ESOP","author":"Dimoulas Christos","year":"2012","unstructured":"Christos Dimoulas, Sam Tobin-Hochstadt, and Matthias Felleisen. 2012. Complete monitors for behavioral contracts. In Proceedings of the ESOP. 214\u2013233."},{"key":"e_1_3_3_25_2","first-page":"133:1\u2013133:27","article-title":"Collapsible contracts: Fixing a pathology of gradual typing","volume":"2","author":"Feltey Daniel","year":"2018","unstructured":"Daniel Feltey, Ben Greenman, Christophe Scholliers, Robert Bruce Findler, and Vincent St-Amour. 2018. Collapsible contracts: Fixing a pathology of gradual typing. PACMPL 2, OOPSLA (2018), 133:1\u2013133:27.","journal-title":"PACMPL"},{"key":"e_1_3_3_26_2","first-page":"48","volume-title":"Proceedings of the ICFP","author":"Findler Robert Bruce","year":"2002","unstructured":"Robert Bruce Findler and Matthias Felleisen. 2002. Contracts for higher-order functions. In Proceedings of the ICFP. 48\u201359."},{"key":"e_1_3_3_27_2","first-page":"364","volume-title":"Proceedings of the ECOOP","author":"Findler Robert Bruce","year":"2004","unstructured":"Robert Bruce Findler, Matthew Flatt, and Matthias Felleisen. 2004. Semantic casts: Contracts and structural subtyping in a nominal world. In Proceedings of the ECOOP. 364\u2013388."},{"key":"e_1_3_3_28_2","first-page":"111","volume-title":"Proceedings of the IFL","author":"Findler Robert Bruce","year":"2007","unstructured":"Robert Bruce Findler, Shu-yu Guo, and Anne Rogers. 2007. Lazy contract checking for immutable data structures. In Proceedings of the IFL. 111\u2013128."},{"key":"e_1_3_3_29_2","first-page":"429","volume-title":"Proceedings of the POPL","author":"Garcia Ronald","year":"2016","unstructured":"Ronald Garcia, Alison M. Clark, and \u00c9ric Tanter. 2016. Abstracting gradual typing. In Proceedings of the POPL. 429\u2013442."},{"key":"e_1_3_3_30_2","first-page":"58","volume-title":"Proceedings of the VMIL","author":"Gariano Isaac Oscar","year":"2019","unstructured":"Isaac Oscar Gariano, Richard Roberts, Stefan Marr, Michael Homer, and James Noble. 2019. Which of my transient type checks are not (almost) free? In Proceedings of the VMIL. 58\u201366."},{"key":"e_1_3_3_31_2","unstructured":"Michael Greenberg. 2014. Space-efficient manifest contracts. Retrieved from https:\/\/arxiv.org\/abs\/1410.2813."},{"key":"e_1_3_3_32_2","first-page":"181","volume-title":"Proceedings of the POPL","author":"Greenberg Michael","year":"2015","unstructured":"Michael Greenberg. 2015. Space-efficient manifest contracts. In Proceedings of the POPL. 181\u2013194."},{"key":"e_1_3_3_33_2","first-page":"6:1\u20136:20","volume-title":"Proceedings of the SNAPL","author":"Greenberg Michael","year":"2019","unstructured":"Michael Greenberg. 2019. The dynamic practice and static theory of gradual typing. In Proceedings of the SNAPL. 6:1\u20136:20."},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.5555\/AAI28264039"},{"key":"e_1_3_3_35_2","first-page":"71:1\u201371:32","article-title":"A spectrum of type soundness and performance","volume":"2","author":"Greenman Ben","year":"2018","unstructured":"Ben Greenman and Matthias Felleisen. 2018. A spectrum of type soundness and performance. PACMPL 2, ICFP (2018), 71:1\u201371:32.","journal-title":"PACMPL"},{"key":"e_1_3_3_36_2","first-page":"122:1\u2013122:29","article-title":"Complete monitors for gradual types","volume":"3","author":"Greenman Ben","year":"2019","unstructured":"Ben Greenman, Matthias Felleisen, and Christos Dimoulas. 2019. Complete monitors for gradual types. PACMPL 3, OOPSLA (2019), 122:1\u2013122:29.","journal-title":"PACMPL"},{"issue":"2","key":"e_1_3_3_37_2","first-page":"1","article-title":"A transient semantics for typed racket","volume":"6","author":"Greenman Ben","year":"2022","unstructured":"Ben Greenman, Lukas Lazarek, Christos Dimoulas, and Matthias Felleisen. 2022. A transient semantics for typed racket. Programming 6, 2 (2022), 1\u201325.","journal-title":"Programming"},{"key":"e_1_3_3_38_2","first-page":"30","volume-title":"Proceedings of the PEPM","author":"Greenman Ben","year":"2018","unstructured":"Ben Greenman and Zeina Migeed. 2018. On the cost of type-tag soundness. In Proceedings of the PEPM. 30\u201339."},{"issue":"4","key":"e_1_3_3_39_2","first-page":"1","article-title":"How to evaluate the performance of gradual type systems","volume":"29","author":"Greenman Ben","year":"2019","unstructured":"Ben Greenman, Asumu Takikawa, Max S. New, Daniel Feltey, Robert Bruce Findler, Jan Vitek, and Matthias Felleisen. 2019. How to evaluate the performance of gradual type systems. J. Funct. Program. 29, e4 (2019), 1\u201345.","journal-title":"J. Funct. Program."},{"key":"e_1_3_3_40_2","first-page":"19","volume-title":"Proceedings of the SBLP","author":"Gualandi Hugo Musso","year":"2018","unstructured":"Hugo Musso Gualandi and Roberto Ierusalimschy. 2018. Pallene: A statically typed companion language for Lua. In Proceedings of the SBLP. 19\u201326."},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(94)00004-2"},{"issue":"2","key":"e_1_3_3_42_2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10990-011-9066-z","article-title":"Space-efficient gradual typing","volume":"23","author":"Herman David","year":"2010","unstructured":"David Herman, Aaron Tomb, and Cormac Flanagan. 2010. Space-efficient gradual typing. Higher-order Symbol. Comput. 23, 2 (2010), 167\u2013189.","journal-title":"Higher-order Symbol. Comput."},{"key":"e_1_3_3_43_2","first-page":"208","volume-title":"Proceedings of the FLOPS","author":"Hinze Ralf","year":"2006","unstructured":"Ralf Hinze, Johan Jeuring, and Andres L\u00f6h. 2006. Typed contracts for functional programming. In Proceedings of the FLOPS. 208\u2013225."},{"key":"e_1_3_3_44_2","first-page":"149","volume-title":"Proceedings of the ECOOP","author":"Keil Matthias","year":"2015","unstructured":"Matthias Keil, Sankha Narayan Guria, Andreas Schlegel, Manuel Geffken, and Peter Thiemann. 2015. Transparent object proxies in JavaScript. In Proceedings of the ECOOP. 149\u2013173."},{"key":"e_1_3_3_45_2","first-page":"517","volume-title":"Proceedings of the PLDI","author":"Kuhlenschmidt Andre","year":"2019","unstructured":"Andre Kuhlenschmidt, Deyaaeldeen Almahallawi, and Jeremy G. Siek. 2019. Toward efficient gradual typing for structural types via coercions. In Proceedings of the PLDI. 517\u2013532."},{"key":"e_1_3_3_46_2","first-page":"68:1\u201368:29","article-title":"How to evaluate blame for gradual types","volume":"5","author":"Lazarek Lukas","year":"2021","unstructured":"Lukas Lazarek, Ben Greenman, Matthias Felleisen, and Christos Dimoulas. 2021. How to evaluate blame for gradual types. PACMPL 5, ICFP (2021), 68:1\u201368:29.","journal-title":"PACMPL"},{"issue":"1","key":"e_1_3_3_47_2","first-page":"2:1\u20132:40","article-title":"Gradual soundness: Lessons from static python","volume":"7","author":"Lu Kuang-Chen","year":"2023","unstructured":"Kuang-Chen Lu, Ben Greenman, Carl Meyer, Dino Viehland, Aniket Panse, and Shriram Krishnamurthi. 2023. Gradual soundness: Lessons from static python. Programming 7, 1 (2023), 2:1\u20132:40.","journal-title":"Programming"},{"key":"e_1_3_3_48_2","first-page":"13","volume-title":"Proceedings of the DLS","author":"Maidl Andre Murbach","year":"2015","unstructured":"Andre Murbach Maidl, Fabio Mascarenhas, and Roberto Ierusalimschy. 2015. A formalization of typed lua. In Proceedings of the DLS. 13\u201325."},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/1498926.1498930"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"e_1_3_3_51_2","volume-title":"MACLISP Reference Manual, Revision 0","author":"Moon David A.","year":"1974","unstructured":"David A. Moon. 1974. MACLISP Reference Manual, Revision 0. Technical Report. MIT Project MAC."},{"key":"e_1_3_3_52_2","first-page":"214","volume-title":"Proceedings of the OOPSLA","author":"Moore Scott","year":"2016","unstructured":"Scott Moore, Christos Dimoulas, Robert Bruce Findler, Matthew Flatt, and Stephen Chong. 2016. Extensible access control with authorization contracts. In Proceedings of the OOPSLA. 214\u2013233."},{"key":"e_1_3_3_53_2","first-page":"56:1\u201356:30","article-title":"Sound gradual typing is nominally alive and well","author":"Muehlboeck Fabian","year":"2017","unstructured":"Fabian Muehlboeck and Ross Tate. 2017. Sound gradual typing is nominally alive and well. PACMPL (2017), 56:1\u201356:30.","journal-title":"PACMPL"},{"key":"e_1_3_3_54_2","doi-asserted-by":"publisher","DOI":"10.5555\/AAI28263083"},{"key":"e_1_3_3_55_2","first-page":"15:1\u201315:31","article-title":"Gradual type theory","author":"New Max S.","year":"2019","unstructured":"Max S. New, Daniel R. Licata, and Amal Ahmed. 2019. Gradual type theory. PACMPL (2019), 15:1\u201315:31.","journal-title":"PACMPL"},{"key":"e_1_3_3_56_2","first-page":"99","volume-title":"Proceedings of the POPL","author":"Ohori Atsushi","year":"1993","unstructured":"Atsushi Ohori and Kazuhiko Kato. 1993. Semantics for communication primitives in a Polymorphic language. In Proceedings of the POPL. 99\u2013112."},{"issue":"6","key":"e_1_3_3_57_2","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1017\/S0956796811000219","article-title":"Embedding an interpreted language using higher-order functions and types","volume":"21","author":"Ramsey Norman","year":"2008","unstructured":"Norman Ramsey. 2008. Embedding an interpreted language using higher-order functions and types. J. Funct. Program. 21, 6 (2008), 585\u2013615.","journal-title":"J. Funct. Program."},{"key":"e_1_3_3_58_2","first-page":"481","volume-title":"Proceedings of the POPL","author":"Rastogi Aseem","year":"2012","unstructured":"Aseem Rastogi, Avik Chaudhuri, and Basil Hosmer. 2012. The ins and outs of gradual type inference. In Proceedings of the POPL. 481\u2013494."},{"key":"e_1_3_3_59_2","first-page":"167","volume-title":"Proceedings of the POPL","author":"Rastogi Aseem","year":"2015","unstructured":"Aseem Rastogi, Nikhil Swamy, C\u00e9dric Fournet, Gavin Bierman, and Panagiotis Vekris. 2015. Safe & efficient gradual typing for TypeScript. In Proceedings of the POPL. 167\u2013180."},{"key":"e_1_3_3_60_2","first-page":"1565","volume-title":"Proceedings of the SAC","author":"Ren Brianna M.","year":"2013","unstructured":"Brianna M. Ren, John Toman, T. Stephen Strickland, and Jeffrey S. Foster. 2013. The ruby type checker. In Proceedings of the SAC. 1565\u20131572."},{"key":"e_1_3_3_61_2","first-page":"55:1\u201355:27","article-title":"The VM already knew that: Leveraging compile-time knowledge to optimize gradual typing","author":"Richards Gregor","year":"2017","unstructured":"Gregor Richards, Ellen Arteca, and Alexi Turcotte. 2017. The VM already knew that: Leveraging compile-time knowledge to optimize gradual typing. PACMPL (2017), 55:1\u201355:27.","journal-title":"PACMPL"},{"key":"e_1_3_3_62_2","first-page":"76","volume-title":"Proceedings of the ECOOP","author":"Richards Gregor","year":"2015","unstructured":"Gregor Richards, Francesco Zappa Nardelli, and Jan Vitek. 2015. Concrete types for TypeScript. In Proceedings of the ECOOP. 76\u2013100."},{"key":"e_1_3_3_63_2","first-page":"15:1\u201315:29","volume-title":"Proceedings of the ECOOP","author":"Roberts Richard","year":"2019","unstructured":"Richard Roberts, Stefan Marr, Michael Homer, and James Noble. 2019. Transient typechecks are (almost) free. In Proceedings of the ECOOP. 15:1\u201315:29."},{"key":"e_1_3_3_64_2","first-page":"425","volume-title":"Proceedings of the PLDI","author":"Siek Jeremy","year":"2015","unstructured":"Jeremy Siek, Peter Thiemann, and Philip Wadler. 2015. Blame and coercion: Together again for the first time. In Proceedings of the PLDI. 425\u2013435."},{"key":"e_1_3_3_65_2","first-page":"432","volume-title":"Proceedings of the ESOP","author":"Siek Jeremy","year":"2015","unstructured":"Jeremy Siek, Michael M. Vitousek, Matteo Cimini, Sam Tobin-Hochstadt, and Ronald Garcia. 2015. Monotonic references for efficient gradual typing. In Proceedings of the ESOP. 432\u2013456."},{"key":"e_1_3_3_66_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796821000241"},{"key":"e_1_3_3_67_2","first-page":"68","volume-title":"Proceedings of the SFP","author":"Siek Jeremy G.","year":"2012","unstructured":"Jeremy G. Siek and Ronald Garcia. 2012. Interpretations of the gradually typed lambda calculus. In Proceedings of the SFP. 68\u201380."},{"key":"e_1_3_3_68_2","first-page":"17","volume-title":"Proceedings of the ESOP","author":"Siek Jeremy G.","year":"2009","unstructured":"Jeremy G. Siek, Ronald Garcia, and Walid Taha. 2009. Exploring the design space of higher-order casts. In Proceedings of the ESOP. 17\u201331."},{"key":"e_1_3_3_69_2","first-page":"81","volume-title":"Proceedings of the SFP","author":"Siek Jeremy G.","year":"2006","unstructured":"Jeremy G. Siek and Walid Taha. 2006. Gradual typing for functional languages. In Proceedings of the SFP. 81\u201392."},{"key":"e_1_3_3_70_2","first-page":"274","volume-title":"Proceedings of the SNAPL","author":"Siek Jeremy G.","year":"2015","unstructured":"Jeremy G. Siek, Michael M. Vitousek, Matteo Cimini, and John Tang Boyland. 2015. Refined criteria for gradual typing. In Proceedings of the SNAPL. 274\u2013293."},{"key":"e_1_3_3_71_2","volume-title":"Lambda The Ultimate Declarative","author":"Jr. Guy Lewis Steele,","year":"1976","unstructured":"Guy Lewis Steele, Jr. 1976. Lambda The Ultimate Declarative. Technical Report AI Memo 379. MIT."},{"key":"e_1_3_3_72_2","volume-title":"Common Lisp","author":"Jr. Guy L. Steele,","year":"1990","unstructured":"Guy L. Steele, Jr. 1990. Common Lisp (2nd ed.). Digital Press."},{"key":"e_1_3_3_73_2","first-page":"943","volume-title":"Proceedings of the OOPSLA","author":"Strickland T. Stephen","year":"2012","unstructured":"T. Stephen Strickland, Sam Tobin-Hochstadt, Robert Bruce Findler, and Matthew Flatt. 2012. Chaperones and impersonators: Run-time support for reasonable interposition. In Proceedings of the OOPSLA. 943\u2013962."},{"key":"e_1_3_3_74_2","first-page":"425","volume-title":"Proceedings of the POPL","author":"Swamy Nikhil","year":"2014","unstructured":"Nikhil Swamy, C\u00e9dric Fournet, Aseem Rastogi, Karthikeyan Bhargavan, Juan Chen, Pierre-Yves Strub, and Gavin Bierman. 2014. Gradual typing embedded securely in JavaScript. In Proceedings of the POPL. 425\u2013437."},{"key":"e_1_3_3_75_2","first-page":"4","volume-title":"Proceedings of the ECOOP","author":"Takikawa Asumu","year":"2015","unstructured":"Asumu Takikawa, Daniel Feltey, Earl Dean, Robert Bruce Findler, Matthew Flatt, Sam Tobin-Hochstadt, and Matthias Felleisen. 2015. Towards practical gradual typing. In Proceedings of the ECOOP. 4\u201327."},{"key":"e_1_3_3_76_2","first-page":"456","volume-title":"Proceedings of the POPL","author":"Takikawa Asumu","year":"2016","unstructured":"Asumu Takikawa, Daniel Feltey, Ben Greenman, Max S. New, Jan Vitek, and Matthias Felleisen. 2016. Is sound gradual typing dead? In Proceedings of the POPL. 456\u2013468."},{"key":"e_1_3_3_77_2","first-page":"793","volume-title":"Proceedings of the OOPSLA","author":"Takikawa Asumu","year":"2012","unstructured":"Asumu Takikawa, T. Stephen Strickland, Christos Dimoulas, Sam Tobin-Hochstadt, and Matthias Felleisen. 2012. Gradual typing for first-class classes. In Proceedings of the OOPSLA. 793\u2013810."},{"key":"e_1_3_3_78_2","first-page":"367","volume-title":"Proceedings of the POPL","author":"Thatte Satish","year":"1990","unstructured":"Satish Thatte. 1990. Quasi-static typing. In Proceedings of the POPL. 367\u2013381."},{"key":"e_1_3_3_79_2","first-page":"964","volume-title":"Proceedings of the DLS","author":"Tobin-Hochstadt Sam","year":"2006","unstructured":"Sam Tobin-Hochstadt and Matthias Felleisen. 2006. Interlanguage migration: From scripts to programs. In Proceedings of the DLS. 964\u2013974."},{"key":"e_1_3_3_80_2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/1328438.1328486","volume-title":"Proceedings of the POPL","author":"Tobin-Hochstadt Sam","year":"2008","unstructured":"Sam Tobin-Hochstadt and Matthias Felleisen. 2008. The design and implementation of typed scheme. In Proceedings of the POPL. 395\u2013406."},{"key":"e_1_3_3_81_2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1863543.1863561","volume-title":"Proceedings of the ICFP","author":"Tobin-Hochstadt Sam","year":"2010","unstructured":"Sam Tobin-Hochstadt and Matthias Felleisen. 2010. Logical types for Untyped languages. In Proceedings of the ICFP. 117\u2013128."},{"key":"e_1_3_3_82_2","first-page":"17:1\u201317:17","volume-title":"Proceedings of the SNAPL","author":"Tobin-Hochstadt Sam","year":"2017","unstructured":"Sam Tobin-Hochstadt, Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Ben Greenman, Andrew M. Kent, Vincent St-Amour, T. Stephen Strickland, and Asumu Takikawa. 2017. Migratory typing: Ten years later. In Proceedings of the SNAPL. 17:1\u201317:17."},{"key":"e_1_3_3_83_2","first-page":"1","volume-title":"Proceedings of the DLS","author":"Wilson Preston Tunnell","year":"2018","unstructured":"Preston Tunnell Wilson, Ben Greenman, Justin Pombrio, and Shriram Krishnamurthi. 2018. The behavior of gradual types: A user study. In Proceedings of the DLS. 1\u201312."},{"key":"e_1_3_3_84_2","volume-title":"Gradual Typing for Python, Unguarded","author":"Vitousek Michael M.","year":"2019","unstructured":"Michael M. Vitousek. 2019. Gradual Typing for Python, Unguarded\u00a0 Ph.D. Dissertation. Indiana University."},{"key":"e_1_3_3_85_2","first-page":"45","volume-title":"Proceedings of the DLS","author":"Vitousek Michael M.","year":"2014","unstructured":"Michael M. Vitousek, Andrew Kent, Jeremy G. Siek, and Jim Baker. 2014. Design and evaluation of gradual typing for python. In Proceedings of the DLS. 45\u201356."},{"key":"e_1_3_3_86_2","first-page":"28","volume-title":"Proceedings of the DLS","author":"Vitousek Michael M.","year":"2019","unstructured":"Michael M. Vitousek, Jeremy G. Siek, and Avik Chaudhuri. 2019. Optimizing and evaluating transient gradual typing. In Proceedings of the DLS. 28\u201341."},{"key":"e_1_3_3_87_2","first-page":"762","volume-title":"Proceedings of the POPL","author":"Vitousek Michael M.","year":"2017","unstructured":"Michael M. Vitousek, Cameron Swords, and Jeremy G. Siek. 2017. Big types in little runtime: Open-world soundness and collaborative blame for gradual type systems. In Proceedings of the POPL. 762\u2013774."},{"key":"e_1_3_3_88_2","first-page":"309","volume-title":"Proceedings of the SNAPL","author":"Wadler Philip","year":"2015","unstructured":"Philip Wadler. 2015. A complement to blame. In Proceedings of the SNAPL. 309\u2013320."},{"key":"e_1_3_3_89_2","first-page":"1","volume-title":"Proceedings of the ESOP","author":"Wadler Philip","year":"2009","unstructured":"Philip Wadler and Robert Bruce Findler. 2009. Well-typed programs can\u2019t be blamed. In Proceedings of the ESOP. 1\u201315."},{"key":"e_1_3_3_90_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90011-4"},{"key":"e_1_3_3_91_2","first-page":"28:1\u201328:29","volume-title":"Proceedings of the ECOOP","author":"Williams Jack","year":"2017","unstructured":"Jack Williams, J. Garrett Morris, Philip Wadler, and Jakub Zalewski. 2017. Mixed messages: Measuring conformance and non-interference in TypeScript. In Proceedings of the ECOOP. 28:1\u201328:29."},{"key":"e_1_3_3_92_2","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1145\/182409.182485","volume-title":"Proceedings of the LFP","author":"Wright Andrew K.","year":"1994","unstructured":"Andrew K. Wright and Robert Cartwright. 1994. A practical soft type system for scheme. In Proceedings of the LFP. 250\u2013262."},{"key":"e_1_3_3_93_2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1093"},{"key":"e_1_3_3_94_2","first-page":"377","volume-title":"Proceedings of the POPL","author":"Wrigstad Tobias","year":"2010","unstructured":"Tobias Wrigstad, Francesco Zappa Nardelli, Sylvain Lebresne, Johan \u00d6stlund, and Jan Vitek. 2010. Integrating typed and untyped code in a Scripting language. In Proceedings of the POPL. 377\u2013388."}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579833","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3579833","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3579833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:27Z","timestamp":1750182687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,5]]},"references-count":93,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3,31]]}},"alternative-id":["10.1145\/3579833"],"URL":"https:\/\/doi.org\/10.1145\/3579833","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,5]]},"assertion":[{"value":"2021-07-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-14","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}