A computation is incremental if repeating it with a changed input is faster than from-scratch recomputation. Incremental computations are ubiquitous in everyday computer systems.
Adapton offers programming language abstractions for incremental computation.
Latest: This is the latest implementation of Adapton:
Legacy: These were the first implementations of Adapton and Nominal Adapton:
- Adapton for OCaml (for OOPSLA 2015 paper)
- Adapton for OCaml (legacy, circa 2014)
- Adapton for Python (legacy, circa 2014)
- Incremental Computation with Adapton Matthew A Hammer University of Colorado, Boulder. March 2015.
- Sparse Adapton Kyle Headley ICFP Student Research Contest. September 2015.
Incremental Computation with Names
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
Matthew A. Hammer, Yit Phang Khoo, Michael Hicks and Jeffrey S. Foster
Programming Language Design and Implementation (PLDI 2014).
Edinburgh, Scotland. June 2014.
- Matthew A Hammer - University of Colorado Boulder
- Michael Hicks - University of Maryland
- Jeff Foster - University of Maryland
- Joshua Dunfield - University of British Columbia
- David Van Horn - University of Maryland