Fixing incremental computation. Derivatives of fixpoints, and the recursive semantics of Datalog
From MaRDI portal
Publication:6070796
DOI10.1007/978-3-030-17184-1_19zbMATH Open1524.68069arXiv1811.06069OpenAlexW2901959279MaRDI QIDQ6070796
Author name not available (Why is that?)
Publication date: 24 November 2023
Published in: (Search for Journal in Brave)
Abstract: Incremental computation has recently been studied using the concepts of change structures and derivatives of programs, where the derivative of a function allows updating the output of the function based on a change to its input. We generalise change structures to change actions, and study their algebraic properties. We develop change actions for common structures in computer science, including directed-complete partial orders and Boolean algebras. We then show how to compute derivatives of fixpoints. This allows us to perform incremental evaluation and maintenance of recursively defined functions with particular application to generalised Datalog programs. Moreover, unlike previous results, our techniques are modular in that they are easy to apply both to variants of Datalog and to other programming languages.
Full work available at URL: https://arxiv.org/abs/1811.06069
No records found.
No records found.
This page was built for publication: Fixing incremental computation. Derivatives of fixpoints, and the recursive semantics of Datalog
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6070796)
