2014 · 72 citations · 34 references
ComputingComputer ScienceFormal MethodsProgramming LanguagesSystems ProgrammingData-flow AnalysisIncremental ChangeIncremental ComputationIncremental Processing
Many researchers have proposed programming languages that support incremental computation (IC), which allows programs to be efficiently re-executed after a small change to the input. However, existing implementations of such languages have two important drawbacks. First, recomputation is oblivious to specific demands on the program output; that is, if a program input changes, all dependencies will be recomputed, even if an observer no longer requires certain outputs. Second, programs are made incremental as a unit, with little or no support for reusing results outside of their original context, e.g., when reordered.
34
Constructing Induction Rules for Deductive Synthesis Proofs
Alan Bundy, Lucas Dixon, Jeremy Gow et al. · Electronic Notes in Theoretical Computer Science · 2006 · 2.8K citations · Full text
Dependency Structures of Data Base Relationships.
William W. Armstrong · IFIP Congress · 1974 · 739 citations
“Memo” Functions and Machine Learning
Donald Michie · Nature · 1968 · 554 citations
Two algorithms for maintaining order in a list
Paul F. Dietz, Daniel D. Sleator · 1987 · 324 citations · Full text
Incremental computation via function caching
William Pugh, Tim Teitelbaum · 1989 · 197 citations