{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:31:07Z","timestamp":1792787467647,"version":"4.5.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA1","license":[{"start":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T00:00:00Z","timestamp":1775779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"LOEWE initiative","award":["LOEWE\/4a\/\/519\/05\/00.002(0013)\/95"],"award-info":[{"award-number":["LOEWE\/4a\/\/519\/05\/00.002(0013)\/95"]}]},{"name":"German Federal Ministry of Education and Research","award":["National Research Center for Applied Cybersecurity ATHENE"],"award-info":[{"award-number":["National Research Center for Applied Cybersecurity ATHENE"]}],"id":[{"id":"https:\/\/ror.org\/04pz7b180","id-type":"ROR","asserted-by":"crossref"}]},{"name":"Hessian Ministry of Higher Education, Research and the Arts","award":["National Research Center for Applied Cybersecurity ATHENE"],"award-info":[{"award-number":["National Research Center for Applied Cybersecurity ATHENE"]}]},{"name":"Deutsche Forschungsgemeinschaft","award":["Germany\u2019s Excellence Strategy (EXC-3057\/1 \u201eReasonable Artificial Intelligence\u201c, Project No. 533677015)"],"award-info":[{"award-number":["Germany\u2019s Excellence Strategy (EXC-3057\/1 \u201eReasonable Artificial Intelligence\u201c, Project No. 533677015)"]}],"id":[{"id":"https:\/\/ror.org\/018mejw64","id-type":"ROR","asserted-by":"crossref"}]},{"name":"Deutsche Forschungsgemeinschaft","award":["SFB 1119 \u2013 236615297"],"award-info":[{"award-number":["SFB 1119 \u2013 236615297"]}],"id":[{"id":"https:\/\/ror.org\/018mejw64","id-type":"ROR","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2026,4,10]]},"abstract":"<jats:p>Incrementalization speeds up computations by avoiding unnecessary recomputations and by efficiently reusing previous results. While domain-specific techniques achieve impressive speedups, e.g., in the context of database queries, they are difficult to generalize. Meanwhile, general approaches offer little support for incrementalizing domain-specific operations.<\/jats:p>\n                  <jats:p>\n                    In this work, we present\n                    <jats:sc>DeCo<\/jats:sc>\n                    , a novel core calculus for incremental functional programming with support for a wide range of user-defined data types. Despite its generic nature, our approach statically incrementalizes domain-specific operations on user-defined data types. It is, hence, more fine-grained than other generic techniques which resort to treating domain-specific operations as black boxes.\n                  <\/jats:p>\n                  <jats:p>We mechanized our work in Lean and proved it sound, meaning incrementalized execution computes the same result as full reevaluation. We also provide an executable implementation with case studies featuring examples from linear algebra, relational algebra, dictionaries, trees, and conflict-free replicated data types, plus a brief performance evaluation on linear and relational algebra and on trees.<\/jats:p>","DOI":"10.1145\/3798264","type":"journal-article","created":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T14:33:43Z","timestamp":1775831623000},"page":"1763-1789","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["DeCo: A Core Calculus for Incremental Functional Programming with Generic Data Types"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9964-7367","authenticated-orcid":false,"given":"Timon","family":"B\u00f6hler","sequence":"first","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1048-8735","authenticated-orcid":false,"given":"Tobias","family":"Reinhard","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8672-0265","authenticated-orcid":false,"given":"David","family":"Richter","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6563-7537","authenticated-orcid":false,"given":"Mira","family":"Mezini","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Darmstadt, Germany"},{"name":"hessian.AI, Darmstadt, Germany"},{"name":"National Research Center for Applied Cybersecurity ATHENE, Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2005.06.002"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3695249"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.JPDC.2017.08.003"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3678721.3686231"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.14778\/3587136.3587137"},{"key":"e_1_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Timon B\u00f6hler Tobias Reinhard David Richter and Mira Mezini. 2026. DeCo: A Core Calculus for Incremental Functional Programming with Generic Data Types. arXiv:2602.20866 [cs.PL] https:\/\/arxiv.org\/abs\/2602.20866","DOI":"10.1145\/3798264"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Timon B\u00f6hler Tobias Reinhard David Richter and Mira Mezini. 2026. DeCo: A Core Calculus for Incremental Functional Programming with Generic Data Types. doi:10.5281\/zenodo.18757667","DOI":"10.5281\/zenodo.18757667"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594304"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007205"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391230"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-79876-5_37"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3110271"},{"key":"e_1_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Dan R. Ghica George Kaye and David Sprunger. 2025. A Complete Theory of Sequential Digital Circuits: Denotational Operational and Algebraic Semantics. arXiv:2201.10456 [cs.LO] https:\/\/arxiv.org\/abs\/2201.10456","DOI":"10.46298\/lmcs-22(2:34)2026"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17184-1_20"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594324"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ECOOP.2025.20"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2502323.2502326"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3704845"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680999027X"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026547031739"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3607830"},{"key":"e_1_3_1_24_2","unstructured":"Frank McSherry Derek Gordon Murray Rebecca Isaacs and Michael Isard. 2013. Differential Dataflow. In Sixth Biennial Conference on Innovative Data Systems Research CIDR 2013 Asilomar CA USA January 6-9 2013 Online Proceedings. www.cidrdb.org. http:\/\/cidrdb.org\/cidr2013\/Papers\/CIDR13_Paper111.pdf"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2790449.2790525"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.SNAPL.2019.11"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/J.SCICO.2017.04.001"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511530104"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2001.11334"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454032"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3385398"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3527333"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24550-3_29"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3632878"},{"key":"e_1_3_1_35_2","volume-title":"Symmetric edit lenses: a new foundation for bidirectional languages","author":"Wagner Daniel","year":"2014","unstructured":"Daniel Wagner. 2014. Symmetric edit lenses: a new foundation for bidirectional languages. University of Pennsylvania."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T11:21:14Z","timestamp":1790421674000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,10]]},"references-count":34,"journal-issue":{"issue":"OOPSLA1","published-print":{"date-parts":[[2026,4,10]]}},"alternative-id":["10.1145\/3798264"],"URL":"https:\/\/doi.org\/10.1145\/3798264","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,10]]},"assertion":[{"value":"2025-10-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}