Conference item icon

Conference item

Fixing incremental computation: derivatives of fixpoints, and the recursive semantics of datalog

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 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.
Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Publisher copy:
10.1007/978-3-030-17184-1_19

Authors

More by this author
Oxford college:
Wolfson College
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
Merton College
Role:
Author
ORCID:
0000-0001-7509-680X


Publisher:
Springer
Host title:
European Symposium on Programming
Journal:
Lecture Notes in Computer Science More from this journal
Volume:
11432
Pages:
525-552
Series:
Lecture Notes in Computer Science
Publication date:
2019-04-06
Acceptance date:
2019-02-18
DOI:


Keywords:
Pubs id:
pubs:974362
UUID:
uuid:2afcaaba-3729-4905-b0fe-8b7f73f6fb33
Local pid:
pubs:974362
Source identifiers:
974362
Deposit date:
2019-02-18
ARK identifier:

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP