{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:01:37Z","timestamp":1780671697999,"version":"3.54.1"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T00:00:00Z","timestamp":1780617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001823","name":"Czech Ministry of Education, Youth and Sports","doi-asserted-by":"crossref","award":["LL2325"],"award-info":[{"award-number":["LL2325"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"crossref","award":["23-07580X"],"award-info":[{"award-number":["23-07580X"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2026,6,30]]},"abstract":"<jats:p>Dynamic programming languages pose significant challenges for optimizing compilers due to features such as dynamic typing, late binding, reflection, copy-on-write, and delayed evaluation. To generate efficient code, compilers must speculate on which dynamic features will be exercised and produce specialized code based on these assumptions. This article presents the design of a statically typed, high-level intermediate representation (IR) that makes dynamic behaviors explicit and amenable to static analysis. Our IR combines gradual typing with ownership tracking, and explicitly represents promises, multiple function versions, and contextual dispatch. Together, these features directly support optimizations such as specialization, inlining, scope elision, and copy elimination. We formalize a core calculus, called FI\u0158, that captures the essential features required for these optimizations. We provide an operational semantics, a type system, and flow and reflection analyses, and we prove the soundness of the type system.<\/jats:p>","DOI":"10.1145\/3811921","type":"journal-article","created":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T13:57:02Z","timestamp":1777125422000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Typed Intermediate Representation for Dynamic Languages"],"prefix":"10.1145","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1590-2392","authenticated-orcid":false,"given":"Micka\u00ebl","family":"Laurent","sequence":"first","affiliation":[{"name":"Charles University, Prague, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7471-0702","authenticated-orcid":false,"given":"Jakob","family":"Hain","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, Indiana, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0478-6202","authenticated-orcid":false,"given":"Filip","family":"K\u0159ikava","sequence":"additional","affiliation":[{"name":"Czech Technical University, Prague, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4124-0225","authenticated-orcid":false,"given":"Sebasti\u00e1n","family":"Krynski","sequence":"additional","affiliation":[{"name":"Czech Technical University, Prague, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4052-3458","authenticated-orcid":false,"given":"Jan","family":"Vitek","sequence":"additional","affiliation":[{"name":"Charles University, Prague, Czech Republic and Czech Technical University Prague, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,5]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","unstructured":"John Aycock. 2003. A brief history of just-in-time. ACM Computing Surveys 35 2 (2003) 97\u2013113. DOI: 10.1145\/857076.857077.","DOI":"10.1145\/857076.857077"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3434327"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276490"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01806108"},{"key":"e_1_3_2_6_2","unstructured":"Clifford Click. 1995. Combining Analyses Combining Optimizations. Ph.D. Dissertation. Rice University. Retrieved from https:\/\/hdl.handle.net\/1911\/16837"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3617651.3622979"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/800017.800542"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","unstructured":"Matthias Felleisen and Robert Hieb. 1992. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science 103 2 (1992) 235\u2013271. DOI: 10.1016\/0304-3975(92)90014-7","DOI":"10.1016\/0304-3975(92)90014-7"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428288"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3359619.3359744"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3158137"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","unstructured":"Stephen Freund and John Mitchell. 2003. type system for the Java bytecode language and verifier. Journal of Automated Reasoning 30 3 (May 2003) 271\u2013321. DOI: 10.1023\/A:1025011624925","DOI":"10.1023\/A:1025011624925"},{"key":"e_1_3_2_14_2","unstructured":"Michael Gottesman Joe Groff and John McCall. 2024. Borrowing and consuming Parameter Ownership Modifiers. RFC 0377. Apple. Retrieved from https:\/\/github.com\/swiftlang\/swift-evolution\/blob\/main\/proposals\/0377-parameter-ownership-modifiers.md"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/2047849.2047854"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","unstructured":"Atsushi Igarashi Benjamin C. Pierce and Philip Wadler. 2001. Featherweight Java: A minimal core calculus for Java and GJ. ACM Transactions on Programming Languages and Systems 23 3 (2001) 396\u2013450. DOI: 10.1145\/503502.503505","DOI":"10.1145\/503502.503505"},{"key":"e_1_3_2_17_2","unstructured":"Chris Lattner Mehdi Amini Uday Bondhugula Albert Cohen Andy Davis Jacques Pienaar River Riddle Tatiana Shpeisman Nicolas Vasilache and Oleksandr Zinenko. 2020. MLIR: A compiler infrastructure for the end of Moore\u2019s Law. arxiv:2002.11054. Retrieved from https:\/\/arxiv.org\/abs\/2002.11054"},{"key":"e_1_3_2_18_2","unstructured":"Tim Lindholm Frank Yellin Gilad Bracha and Alex Buckley. 2015. The Java\u00ae Virtual Machine Specification Java SE 8 Edition. Addison-Wesley Professional. Retrieved from https:\/\/docs.oracle.com\/javase\/specs\/jvms\/se8\/html\/"},{"key":"e_1_3_2_19_2","unstructured":"Niko Matsakis. 2016. Introducing MIR. Retrieved from Retrieved from https:\/\/blog.rust-lang.org\/2016\/04\/19\/MIR\/"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","unstructured":"Greg Morrisett David Walker Karl Crary and Neal Glew. 1999. From system F to typed assembly language. ACM Transactions on Programming Languages and Systems 21 (1999) 527\u2013568. DOI: 10.1145\/319301.319345","DOI":"10.1145\/319301.319345"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054091"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.5555\/1267847.1267848"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73589-2_2"},{"key":"e_1_3_2_24_2","unstructured":"Tobias Wrigstad. 2006. Ownership-Based Alias Management. Doctoral Dissertation. Department of Information Technology Uppsala University. Retrieved from https:\/\/wrigstad.com\/papers\/thesis.pdf"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706343"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2384577.2384587"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3811921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T14:02:28Z","timestamp":1780668148000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3811921"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,5]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6,30]]}},"alternative-id":["10.1145\/3811921"],"URL":"https:\/\/doi.org\/10.1145\/3811921","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,5]]},"assertion":[{"value":"2025-07-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-06-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}