Fixing incremental computation: derivatives of fixpoints, and the recursive semantics of datalog
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 alge...
Main Authors: | Alvarez-Picallo, M, Eyers-Taylor, A, Peyton Jones, M, Ong, C |
---|---|
Format: | Conference item |
Published: |
Springer
2019
|
Similar Items
-
A fixpoint semantics for "memory cells" in synchronous dataflows
by: Catalin Dima
Published: (2008-01-01) -
Fixpoint Characterizations for Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
by: Lukasiewicz, T
Published: (2001) -
Datalog and its extensions for the semantic web
by: Gottlob, G, et al.
Published: (2012) -
Incremental update of datalog materialisation: the backward/forward algorithm
by: Motik, B, et al.
Published: (2015) -
Incremental update of datalog materialisation : the backward/forward algorithm
by: Motik, B, et al.
Published: (2015)