{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:21:14Z","timestamp":1750220474820,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,10,17]]},"DOI":"10.1145\/3486609.3487204","type":"proceedings-article","created":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T22:14:41Z","timestamp":1637619281000},"page":"123-129","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Compiling pattern matching to in-place modifications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4961-4316","authenticated-orcid":false,"given":"Paul","family":"Iannetta","sequence":"first","affiliation":[{"name":"University of Lyon, France \/ ENS Lyon, France \/ University of Lyon 1, France \/ CNRS, France \/ Inria, France \/ LIP, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8013-1611","authenticated-orcid":false,"given":"Laure","family":"Gonnord","sequence":"additional","affiliation":[{"name":"Grenoble Alps University, France \/ Grenoble INP, France \/ LCIS, France \/ LIP, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2107-7678","authenticated-orcid":false,"given":"Gabriel","family":"Radanne","sequence":"additional","affiliation":[{"name":"Inria, France \/ ENS Lyon, France \/ University of Lyon 1, France \/ CNRS, France \/ LIP, France"}]}],"member":"320","published-online":{"date-parts":[[2021,11,22]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"263","article-title":"An algorithm for organization of information","volume":"146","author":"Adel\u2019son-Vel\u2019skii G. M.","year":"1962","unstructured":"G. M. Adel\u2019son-Vel\u2019skii and E. M. Landis . 1962 . An algorithm for organization of information . Dokladi Akademia Nauk SSSR , 146 , 2 (1962), April , 263 \u2013 266 . G. M. Adel\u2019son-Vel\u2019skii and E. M. Landis. 1962. An algorithm for organization of information. Dokladi Akademia Nauk SSSR, 146, 2 (1962), April, 263\u2013266.","journal-title":"Dokladi Akademia Nauk SSSR"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15769-1"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2004.1342537"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074009"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545386"},{"key":"e_1_3_2_2_6_1","volume-title":"Practical Methods for Proving Program Termination. In 14th International Conference on Computer Aided Verification (CAV) (Lecture Notes in Computer Science","volume":"454","author":"Michael","unstructured":"Michael A. Col\u00f3n and Henny B. Sipma. 2002 . Practical Methods for Proving Program Termination. In 14th International Conference on Computer Aided Verification (CAV) (Lecture Notes in Computer Science , Vol. 2404). Springer Verlag, 442\u2013 454 . Michael A. Col\u00f3n and Henny B. Sipma. 2002. Practical Methods for Proving Program Termination. In 14th International Conference on Computer Aided Verification (CAV) (Lecture Notes in Computer Science, Vol. 2404). Springer Verlag, 442\u2013454."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01379404"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503223"},{"key":"e_1_3_2_2_10_1","volume-title":"Gonnet and Ricardo Baeza-Yates","author":"Gaston","year":"1991","unstructured":"Gaston H. Gonnet and Ricardo Baeza-Yates . 1991 . Handbook of Algorithms and Data Structures in Pascal and C (2nd ed.). Addison-Wesley Pub (Sd) . Gaston H. Gonnet and Ricardo Baeza-Yates. 1991. Handbook of Algorithms and Data Structures in Pascal and C (2nd ed.). Addison-Wesley Pub (Sd)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3408989"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048066.2048104"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384643"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/321406.321418"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411304.1411311"},{"volume-title":"Purely functional data structures","author":"Okasaki Chris","key":"e_1_3_2_2_16_1","unstructured":"Chris Okasaki . 1999. Purely functional data structures . Cambridge University Press . isbn:978-0-521-66350-2 Chris Okasaki. 1999. Purely functional data structures. Cambridge University Press. isbn:978-0-521-66350-2"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007554627716"},{"key":"e_1_3_2_2_18_1","volume-title":"Fine-Grained Traversal Fusion for Heterogeneous Trees - Extended Version. CoRR, abs\/1904.07061","author":"Sakka Laith","year":"2019","unstructured":"Laith Sakka , Kirshanthan Sundararajah , Ryan R. Newton , and Milind Kulkarni . 2019. Sound , Fine-Grained Traversal Fusion for Heterogeneous Trees - Extended Version. CoRR, abs\/1904.07061 ( 2019 ), arxiv:1904.07061. arxiv:1904.07061 Laith Sakka, Kirshanthan Sundararajah, Ryan R. Newton, and Milind Kulkarni. 2019. Sound, Fine-Grained Traversal Fusion for Heterogeneous Trees - Extended Version. CoRR, abs\/1904.07061 (2019), arxiv:1904.07061. arxiv:1904.07061"},{"volume-title":"Theory of linear and integer programming","author":"Schrijver A.","key":"e_1_3_2_2_19_1","unstructured":"A. Schrijver . 1986. Theory of linear and integer programming . Wiley , New York . A. Schrijver. 1986. Theory of linear and integer programming. Wiley, NewYork."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314592"}],"event":{"name":"GPCE '21: Concepts and Experiences","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Chicago IL USA","acronym":"GPCE '21"},"container-title":["Proceedings of the 20th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3486609.3487204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3486609.3487204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:40Z","timestamp":1750193320000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3486609.3487204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":20,"alternative-id":["10.1145\/3486609.3487204","10.1145\/3486609"],"URL":"https:\/\/doi.org\/10.1145\/3486609.3487204","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]},"assertion":[{"value":"2021-11-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}