{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:42Z","timestamp":1750220442415,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,3,2]]},"DOI":"10.1145\/3446804.3446846","type":"proceedings-article","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T10:23:10Z","timestamp":1613298190000},"page":"153-164","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Resolvable ambiguity: principled resolution of syntactically ambiguous programs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0669-4085","authenticated-orcid":false,"given":"Viktor","family":"Palmkvist","sequence":"first","affiliation":[{"name":"KTH, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4918-6582","authenticated-orcid":false,"given":"Elias","family":"Castegren","sequence":"additional","affiliation":[{"name":"KTH, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2659-5271","authenticated-orcid":false,"given":"Philipp","family":"Haller","sequence":"additional","affiliation":[{"name":"KTH, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8457-4105","authenticated-orcid":false,"given":"David","family":"Broman","sequence":"additional","affiliation":[{"name":"KTH, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,2,27]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1016\/0304-3975(95)90680-J"},{"volume-title":"Software Language Engineering (Lecture Notes in Computer Science), Martin Erwig, Richard F","author":"Afroozeh Ali","unstructured":"Ali Afroozeh , Mark van den Brand , Adrian Johnstone , Elizabeth Scott , and Jurgen Vinju . 2013. Safe Specification of Operator Precedence Rules . In Software Language Engineering (Lecture Notes in Computer Science), Martin Erwig, Richard F . Paige, and Eric Van Wyk (Eds.). Springer International Publishing , 137-156. htps:\/\/doi.org\/10.1007\/ 978-3-319-02654-1_8 Ali Afroozeh, Mark van den Brand, Adrian Johnstone, Elizabeth Scott, and Jurgen Vinju. 2013. Safe Specification of Operator Precedence Rules. In Software Language Engineering (Lecture Notes in Computer Science), Martin Erwig, Richard F. Paige, and Eric Van Wyk (Eds.). Springer International Publishing, 137-156. htps:\/\/doi.org\/10.1007\/ 978-3-319-02654-1_8","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","volume-title":"Ullman","author":"Aho Alfred V.","year":"2006","unstructured":"Alfred V. Aho , Monica S. Lam , Ravi Sethi , and Jefrey D . Ullman . 2006 . Compilers : Principles, Techniques, and Tools (second ed.). Addison Wesley , Boston. Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jefrey D. Ullman. 2006. Compilers: Principles, Techniques, and Tools (second ed.). Addison Wesley, Boston."},{"key":"e_1_3_2_1_4_1","first-page":"202","volume-title":"Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing (STOC '04)","author":"Alur Rajeev","unstructured":"Rajeev Alur and P. Madhusudan . 2004. Visibly Pushdown Languages . In Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing (STOC '04) . ACM, New York, NY, USA , 202 - 211 . htps: \/\/doi.org\/10.1145\/1007352.1007390 Rajeev Alur and P. Madhusudan. 2004. Visibly Pushdown Languages. In Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing (STOC '04). ACM, New York, NY, USA, 202-211. htps: \/\/doi.org\/10.1145\/1007352.1007390"},{"volume-title":"Automata, Languages and Programming (Lecture Notes in Computer Science), Luca Aceto, Ivan Damg\u00e5rd, Leslie Ann Goldberg, Magn\u00fas M","author":"Axelsson Roland","unstructured":"Roland Axelsson , Keijo Heljanko , and Martin Lange . 2008. Analyzing Context-Free Grammars Using an Incremental SAT Solver . In Automata, Languages and Programming (Lecture Notes in Computer Science), Luca Aceto, Ivan Damg\u00e5rd, Leslie Ann Goldberg, Magn\u00fas M . Halld\u00f3rsson, Anna Ing\u00f3lfsd\u00f3ttir, and Igor Walukiewicz (Eds.). Springer Berlin Heidelberg , 410-422. htps:\/\/doi.org\/10.1007\/978-3-540-70583-3_34 Roland Axelsson, Keijo Heljanko, and Martin Lange. 2008. Analyzing Context-Free Grammars Using an Incremental SAT Solver. In Automata, Languages and Programming (Lecture Notes in Computer Science), Luca Aceto, Ivan Damg\u00e5rd, Leslie Ann Goldberg, Magn\u00fas M. Halld\u00f3rsson, Anna Ing\u00f3lfsd\u00f3ttir, and Igor Walukiewicz (Eds.). Springer Berlin Heidelberg, 410-422. htps:\/\/doi.org\/10.1007\/978-3-540-70583-3_34","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","article-title":"Practical Earley","volume":"45","author":"Aycock John","year":"2002","unstructured":"John Aycock and R. Nigel Horspool . 2002 . Practical Earley Parsing. Comput. J. 45 , 6 ( 2002 ), 620-630. htps:\/\/doi.org\/10.1093\/comjnl\/45.6. 620 John Aycock and R. Nigel Horspool. 2002. Practical Earley Parsing. Comput. J. 45, 6 ( 2002 ), 620-630. htps:\/\/doi.org\/10.1093\/comjnl\/45.6. 620","journal-title":"Parsing. Comput. J."},{"volume-title":"Implementation and Application of Automata (Lecture Notes in Computer Science), Jan Holub and Jan ??\u00e1rek (Eds.)","author":"Brabrand Claus","unstructured":"Claus Brabrand , Robert Giegerich , and Anders M\u00f8ller . 2007. Analyzing Ambiguity of Context-Free Grammars . In Implementation and Application of Automata (Lecture Notes in Computer Science), Jan Holub and Jan ??\u00e1rek (Eds.) . Springer Berlin Heidelberg , 214-225. htps:\/\/doi.org\/10.1007\/978-3-540-76336-9_21 Claus Brabrand, Robert Giegerich, and Anders M\u00f8ller. 2007. Analyzing Ambiguity of Context-Free Grammars. In Implementation and Application of Automata (Lecture Notes in Computer Science), Jan Holub and Jan ??\u00e1rek (Eds.). Springer Berlin Heidelberg, 214-225. htps:\/\/doi.org\/10.1007\/978-3-540-76336-9_21","key":"e_1_3_2_1_8_1"},{"volume-title":"Generative Programming and Component Engineering (Lecture Notes in Computer Science), Robert Gl\u00fcck and Michael Lowry (Eds.)","author":"Bravenboer Martin","unstructured":"Martin Bravenboer , Rob Vermaas , Jurgen Vinju , and Eelco Visser . 2005. Generalized Type-Based Disambiguation of Meta Programs with Concrete Object Syntax . In Generative Programming and Component Engineering (Lecture Notes in Computer Science), Robert Gl\u00fcck and Michael Lowry (Eds.) . Springer , Berlin, Heidelberg , 157-172. htps:\/\/doi.org\/10.1007\/11561347_12 Martin Bravenboer, Rob Vermaas, Jurgen Vinju, and Eelco Visser. 2005. Generalized Type-Based Disambiguation of Meta Programs with Concrete Object Syntax. In Generative Programming and Component Engineering (Lecture Notes in Computer Science), Robert Gl\u00fcck and Michael Lowry (Eds.). Springer, Berlin, Heidelberg, 157-172. htps:\/\/doi.org\/10.1007\/11561347_12","key":"e_1_3_2_1_9_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/3357766.3359531"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/321138.321145"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/351240.351266"},{"volume-title":"Engineering a Compiler","author":"Cooper Keith","unstructured":"Keith Cooper and Linda Torczon . 2011. Engineering a Compiler ( second ed.). Elsevier . Keith Cooper and Linda Torczon. 2011. Engineering a Compiler (second ed.). Elsevier.","key":"e_1_3_2_1_13_1"},{"volume-title":"Implementation and Application of Functional Languages (Lecture Notes in Computer Science), Sven-Bodo Scholz and Olaf Chitil (Eds.)","author":"Danielsson Nils Anders","unstructured":"Nils Anders Danielsson and Ulf Norell . 2011. Parsing Mixfix Operators . In Implementation and Application of Functional Languages (Lecture Notes in Computer Science), Sven-Bodo Scholz and Olaf Chitil (Eds.) . Springer Berlin Heidelberg , 80-99. htps:\/\/doi.org\/10.1007\/978-3-642-24452-0_5 Nils Anders Danielsson and Ulf Norell. 2011. Parsing Mixfix Operators. In Implementation and Application of Functional Languages (Lecture Notes in Computer Science), Sven-Bodo Scholz and Olaf Chitil (Eds.). Springer Berlin Heidelberg, 80-99. htps:\/\/doi.org\/10.1007\/978-3-642-24452-0_5","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","article-title":"Towards Zero-Overhead Disambiguation of Deep Priority Conflicts","volume":"2","author":"de Souza Amorim Lu\u00eds Eduardo","year":"2018","unstructured":"Lu\u00eds Eduardo de Souza Amorim , Michael J. Steindorfer , and Eelco Visser . 2018 . Towards Zero-Overhead Disambiguation of Deep Priority Conflicts . Programming Journal 2 , 3 ( 2018 ), 13. htps:\/\/doi.org\/10. 22152\/programming-journal.org\/ 2018 \/2\/13 Lu\u00eds Eduardo de Souza Amorim, Michael J. Steindorfer, and Eelco Visser. 2018. Towards Zero-Overhead Disambiguation of Deep Priority Conflicts. Programming Journal 2, 3 ( 2018 ), 13. htps:\/\/doi.org\/10. 22152\/programming-journal.org\/ 2018 \/2\/13","journal-title":"Programming Journal"},{"volume-title":"Software Engineering and Formal Methods (Lecture Notes in Computer Science), Frank de Boer and Antonio Cerone (Eds.)","author":"de Souza Amorim Lu\u00eds Eduardo","unstructured":"Lu\u00eds Eduardo de Souza Amorim and Eelco Visser . 2020. Multi-Purpose Syntax Definition with SDF3 . In Software Engineering and Formal Methods (Lecture Notes in Computer Science), Frank de Boer and Antonio Cerone (Eds.) . Springer International Publishing , Cham , 1-23. htps:\/\/doi.org\/10.1007\/978-3-030-58768-0_1 Lu\u00eds Eduardo de Souza Amorim and Eelco Visser. 2020. Multi-Purpose Syntax Definition with SDF3. In Software Engineering and Formal Methods (Lecture Notes in Computer Science), Frank de Boer and Antonio Cerone (Eds.). Springer International Publishing, Cham, 1-23. htps:\/\/doi.org\/10.1007\/978-3-030-58768-0_1","key":"e_1_3_2_1_16_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/362007.362035"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1016\/j.scico.2007.02.003"},{"volume-title":"Software Language Engineering (Lecture Notes in Computer Science), Krzysztof Czarnecki and G\u00f6rel Hedin (Eds.)","author":"Erdweg Sebastian","unstructured":"Sebastian Erdweg , Tillmann Rendel , Christian K\u00e4stner , and Klaus Ostermann . 2013. Layout-Sensitive Generalized Parsing . In Software Language Engineering (Lecture Notes in Computer Science), Krzysztof Czarnecki and G\u00f6rel Hedin (Eds.) . Springer Berlin Heidelberg , 244-263. htps:\/\/doi.org\/10.1007\/978-3-642-36089-3_14 Sebastian Erdweg, Tillmann Rendel, Christian K\u00e4stner, and Klaus Ostermann. 2013. Layout-Sensitive Generalized Parsing. In Software Language Engineering (Lecture Notes in Computer Science), Krzysztof Czarnecki and G\u00f6rel Hedin (Eds.). Springer Berlin Heidelberg, 244-263. htps:\/\/doi.org\/10.1007\/978-3-642-36089-3_14","key":"e_1_3_2_1_19_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/964001.964011"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/321312.321313"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/71605.71607"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1016\/j.entcs.2010.08.037"},{"volume-title":"Software Language Engineering (Lecture Notes in Computer Science), Krzysztof Czarnecki and G\u00f6rel Hedin (Eds.)","author":"Kaminski Ted","unstructured":"Ted Kaminski and Eric Van Wyk . 2013. Modular Well-Definedness Analysis for Attribute Grammars . In Software Language Engineering (Lecture Notes in Computer Science), Krzysztof Czarnecki and G\u00f6rel Hedin (Eds.) . Springer Berlin Heidelberg , 352-371. htps:\/\/doi.org\/10. 1007\/978-3-642-36089-3_20 Ted Kaminski and Eric Van Wyk. 2013. Modular Well-Definedness Analysis for Attribute Grammars. In Software Language Engineering (Lecture Notes in Computer Science), Krzysztof Czarnecki and G\u00f6rel Hedin (Eds.). Springer Berlin Heidelberg, 352-371. htps:\/\/doi.org\/10. 1007\/978-3-642-36089-3_20","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","first-page":"444","volume-title":"Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA '10)","author":"Lennart","year":"1869","unstructured":"Lennart C.L. Kats and Eelco Visser. 2010. The Spoofax Language Workbench: Rules for Declarative Specification of Languages and IDEs . In Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA '10) . ACM, New York, NY, USA , 444 - 463 . htps:\/\/doi.org\/10.1145\/ 1869 459.1869497 Lennart C.L. Kats and Eelco Visser. 2010. The Spoofax Language Workbench: Rules for Declarative Specification of Languages and IDEs. In Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA '10). ACM, New York, NY, USA, 444-463. htps:\/\/doi.org\/10.1145\/1869459.1869497"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the ASMICS Workshop on Parsing Theory. Tech. Rep. 126-1994","author":"Klint Paul","year":"1994","unstructured":"Paul Klint and Eelco Visser . 1994 . Using Filters for the Disambiguation of Context-Free Grammars . In Proceedings of the ASMICS Workshop on Parsing Theory. Tech. Rep. 126-1994 , Dipartimento di Scienze dell'Informazione, Universit\u00e0 di Milano, Milano, Italy. Paul Klint and Eelco Visser. 1994. Using Filters for the Disambiguation of Context-Free Grammars. In Proceedings of the ASMICS Workshop on Parsing Theory. Tech. Rep. 126-1994, Dipartimento di Scienze dell'Informazione, Universit\u00e0 di Milano, Milano, Italy."},{"volume-title":"Automata, Languages and Programming (Lecture Notes in Computer Science)","author":"Lang Bernard","unstructured":"Bernard Lang . 1974. Deterministic Techniques for Eficient NonDeterministic Parsers . In Automata, Languages and Programming (Lecture Notes in Computer Science) , Jacques Loeckx (Ed.). Springer , Berlin, Heidelberg , 255-269. htps:\/\/doi.org\/10.1007\/978-3-662-21545-6_18 Bernard Lang. 1974. Deterministic Techniques for Eficient NonDeterministic Parsers. In Automata, Languages and Programming (Lecture Notes in Computer Science), Jacques Loeckx (Ed.). Springer, Berlin, Heidelberg, 255-269. htps:\/\/doi.org\/10.1007\/978-3-662-21545-6_18","key":"e_1_3_2_1_27_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1016\/0304-3975(91)90180-A"},{"unstructured":"Xavier Leroy Damien Doligez Alain Frisch Jacques Garrigue Didier R\u00e9my and J\u00e9r\u00f4me Vouillon. 2018. The OCaml System Release 4.07: Documentation and User's Manual. Report.  Xavier Leroy Damien Doligez Alain Frisch Jacques Garrigue Didier R\u00e9my and J\u00e9r\u00f4me Vouillon. 2018. The OCaml System Release 4.07: Documentation and User's Manual. Report.","key":"e_1_3_2_1_29_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/2837614.2837644"},{"volume-title":"Practical Aspects of Declarative Languages (Lecture Notes in Computer Science), Jos\u00e9 J\u00falio Alferes and Moa Johansson (Eds.)","author":"Palmkvist Viktor","unstructured":"Viktor Palmkvist and David Broman . 2019. Creating Domain-Specific Languages by Composing Syntactical Constructs . In Practical Aspects of Declarative Languages (Lecture Notes in Computer Science), Jos\u00e9 J\u00falio Alferes and Moa Johansson (Eds.) . Springer International Publishing , 187-203. htps:\/\/doi.org\/10.1007\/978-3-030-05998-9_12 Viktor Palmkvist and David Broman. 2019. Creating Domain-Specific Languages by Composing Syntactical Constructs. In Practical Aspects of Declarative Languages (Lecture Notes in Computer Science), Jos\u00e9 J\u00falio Alferes and Moa Johansson (Eds.). Springer International Publishing, 187-203. htps:\/\/doi.org\/10.1007\/978-3-030-05998-9_12","key":"e_1_3_2_1_31_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/1993498.1993548"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/2660193.2660202"},{"volume-title":"Automata, Languages and Programming (Lecture Notes in Computer Science), Lars Arge, Christian Cachin, Tomasz Jurdzi?ski","author":"Schmitz Sylvain","unstructured":"Sylvain Schmitz . 2007. Conservative Ambiguity Detection in ContextFree Grammars . In Automata, Languages and Programming (Lecture Notes in Computer Science), Lars Arge, Christian Cachin, Tomasz Jurdzi?ski , and Andrzej Tarlecki (Eds.). Springer Berlin Heidelberg , 692-703. htps:\/\/doi.org\/10.1007\/978-3-540-73420-8_60 Sylvain Schmitz. 2007. Conservative Ambiguity Detection in ContextFree Grammars. In Automata, Languages and Programming (Lecture Notes in Computer Science), Lars Arge, Christian Cachin, Tomasz Jurdzi?ski, and Andrzej Tarlecki (Eds.). Springer Berlin Heidelberg, 692-703. htps:\/\/doi.org\/10.1007\/978-3-540-73420-8_60","key":"e_1_3_2_1_34_1"},{"key":"e_1_3_2_1_35_1","first-page":"199","volume-title":"Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '09)","author":"August","unstructured":"August C. Schwerdfeger and Eric R. Van Wyk. 2009. Verifiable Composition of Deterministic Grammars . In Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '09) . ACM, New York, NY, USA , 199 - 210 . htps: \/\/doi.org\/10.1145\/1542476.1542499 August C. Schwerdfeger and Eric R. Van Wyk. 2009. Verifiable Composition of Deterministic Grammars. In Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '09). ACM, New York, NY, USA, 199-210. htps: \/\/doi.org\/10.1145\/1542476.1542499"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1016\/j.entcs.2008.03.044"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1016\/j.entcs.2010.08.041"},{"volume-title":"Languages and Machines: An Introduction to the Theory of Computer Science","author":"Sudkamp Thomas A.","unstructured":"Thomas A. Sudkamp . 1997. Languages and Machines: An Introduction to the Theory of Computer Science . Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA . Thomas A. Sudkamp. 1997. Languages and Machines: An Introduction to the Theory of Computer Science. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.","key":"e_1_3_2_1_38_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.5555\/1623611.1623625"},{"key":"e_1_3_2_1_40_1","first-page":"1","article-title":"Silver: An Extensible Attribute Grammar System","volume":"75","author":"Wyk Eric Van","year":"2010","unstructured":"Eric Van Wyk , Derek Bodin , Jimin Gao , and Lijesh Krishnan . 2010 . Silver: An Extensible Attribute Grammar System . Science of Computer Programming 75 , 1 (Jan. 2010 ), 39-54. htps:\/\/doi.org\/10.1016\/j.scico. 2009. 07.004 Eric Van Wyk, Derek Bodin, Jimin Gao, and Lijesh Krishnan. 2010. Silver: An Extensible Attribute Grammar System. Science of Computer Programming 75, 1 (Jan. 2010 ), 39-54. htps:\/\/doi.org\/10.1016\/j.scico. 2009. 07.004","journal-title":"Science of Computer Programming"},{"key":"e_1_3_2_1_41_1","first-page":"63","volume-title":"Proceedings of the 6th International Conference on Generative Programming and Component Engineering (GPCE '07)","author":"Eric","unstructured":"Eric R. Van Wyk and August C. Schwerdfeger. 2007. Context-Aware Scanning for Parsing Extensible Languages . In Proceedings of the 6th International Conference on Generative Programming and Component Engineering (GPCE '07) . ACM, New York, NY, USA , 63 - 72 . htps: \/\/doi.org\/10.1145\/1289971.1289983 Eric R. Van Wyk and August C. Schwerdfeger. 2007. Context-Aware Scanning for Parsing Extensible Languages. In Proceedings of the 6th International Conference on Generative Programming and Component Engineering (GPCE '07). ACM, New York, NY, USA, 63-72. htps: \/\/doi.org\/10.1145\/1289971.1289983"},{"unstructured":"Adam Brooks Webber. 2003. Modern Programming Languages: A Practical Introduction. Franklin Beedle & Associates.  Adam Brooks Webber. 2003. Modern Programming Languages: A Practical Introduction. Franklin Beedle & Associates.","key":"e_1_3_2_1_43_1"}],"event":{"sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"acronym":"CC '21","name":"CC '21: 30th ACM SIGPLAN International Conference on Compiler Construction","location":"Virtual Republic of Korea"},"container-title":["Proceedings of the 30th ACM SIGPLAN International Conference on Compiler Construction"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446804.3446846","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3446804.3446846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:31Z","timestamp":1750193251000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446804.3446846"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,27]]},"references-count":41,"alternative-id":["10.1145\/3446804.3446846","10.1145\/3446804"],"URL":"https:\/\/doi.org\/10.1145\/3446804.3446846","relation":{},"subject":[],"published":{"date-parts":[[2021,2,27]]},"assertion":[{"value":"2021-02-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}