Many applications need to respond to incremental modifications to data. Being incremental,
such modification often require incremental modifications to the output, making it possible to …

The LF logical framework codifies a methodology for representing deductive systems, such
as programming languages and logics, within a dependently typed λ-calculus. In this …

Self-adjusting computation enables writing programs that can automatically and efficiently
respond to changes to their data (eg, inputs). The idea behind the approach is to store all …

Build systems are awesome, terrifying--and unloved. They are used by every developer
around the world, but are rarely the object of study. In this paper we offer a systematic, and …

Recent work on adaptive functional programming (AFP) developed techniques for writing
programs that can respond to modifications to their data by performing change propagation …

Build systems are awesome, terrifying–and unloved. They are used by every developer
around the world, but are rarely the object of study. In this paper, we offer a systematic, and …

Kinetic data structures provide a framework for computing combinatorial properties of
continuously moving objects. Although kinetic data structures for many problems have been …

Computational problems that involve dynamic data, such as physics simulations and
program development environments, have been an important subject of study in …

In self-adjusting computation, programs respond automatically and efficiently to
modifications to their data by tracking the dynamic data dependences of the computation …

Self-adjusting computation is a paradigm for programming incremental computations that
efficiently respond to input changes by updating the output in time proportional to the …