Incrementalizing Polynomial Functors
Incremental computing promises to lead to faster and more efficient programs by avoiding unnecessary recomputations, but existing approaches are often ad-hoc. We consider a more generic approach to incrementality using the idea of data types as polynomial functors and investigate how this approach can lead to constructions of changes and incrementalizations.
Authors
- Mira Mezini (ORCID: https://orcid.org/0000-0001-6563-7537)
- Timon Böhler (ORCID: https://orcid.org/0009-0002-9964-7367)
- David Richter (ORCID: https://orcid.org/0000-0002-8672-0265)
Institutions
- Technische Universität Darmstadt (DE)
- Hessian Center for Artificial Intelligence (DE)
Publication Details
- Published
- 2024-09-13
- DOI
- https://doi.org/10.1145/3678721.3686231
- Primary Topic
- Polynomial and algebraic computation
- Type
- article
- Field-Weighted Citation Impact
- 0.00