P
is incremental
if repeating P
with a changed input is
faster than from-scratch recomputation.
Incremental computations
are ubiquitous in everyday computer systems.
Latest: This is the latest implementation of Adapton:
Legacy: These were the first implementations of Adapton and Nominal Adapton:
Contributed:
Matthew A. Hammer, Joshua Dunfield, Kyle Headley, Nicholas Labich, Jeffrey S. Foster, Michael Hicks, David Van Horn Object-oriented Programming, Systems, Languages, and Applications (OOPSLA 2015) Pittsburgh, USA. October 2015.
Adapton: Composable, Demand-Driven Incremental Computation (PLDI 2014)
Matthew A. Hammer, Yit Phang Khoo, Michael Hicks and Jeffrey S. Foster
Programming Language Design and Implementation (PLDI 2014).
Edinburgh, Scotland. June 2014.
|
|
|
CU Programming Languages and Verification | Programming Languages at University of Maryland |