Adapton Project Homepage

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.

Code

Latest: This is the latest implementation of Adapton:

• Adapton for OCaml

Legacy: These were the two first implementations of Adapton:

• Adapton for OCaml (legacy, circa 2014)
• Adapton for Python (legacy, circa 2014)

Coming soon:

• Adapton for Rust
• Adapton for Racket

Videos

Incremental Computation with Adapton

Matthew A. Hammer
University of Colorado, Boulder. March 2015.
https://vimeo.com/122066659

Publications

Incremental Computation with Names

• Paper: http://arxiv.org/abs/1503.07792
• Artifact: Guide, VM Image

Matthew A. Hammer, Joshua Dunfield, Kyle Headley, Nicholas Labich, Jeffrey S. Foster, Michael Hicks, David Van Horn
Adapton: Composable, Demand-Driven Incremental Computation

• Paper: http://www.cs.umd.edu/~hammer/adapton/
• Artifact Website

Matthew A. Hammer, Yit Phang Khoo, Michael Hicks and Jeffrey S. Foster
Programming Language Design and Implementation (PLDI 2014).
Edinburgh, Scotland. June 2014.

People

Faculty

• Matthew A Hammer - University of Colorado; University of Maryland
• Michael Hicks - University of Maryland
• Jeff Foster - University of Maryland
• Joshua Dunfield - University of British Columbia
• David Van Horn - University of Maryland

Students

• Kyle Headley - University of Maryland
• Nicholas Labich - University of Maryland

Alumni

• Khoo Yit Phang - MathWorks
• James Parker - University of Maryland, research programmer