miniAdapton: A Minimal Implementation of Incremental Computation in Scheme
Dakota Fisher, Matthew A. Hammer, William Byrd, Matthew Might

TL;DR
miniAdapton provides a simple, understandable Scheme implementation of incremental computation, enabling safe mutation and memoization, and introduces adapton variables for expression representation.
Contribution
It presents miniAdapton, a minimal, portable Scheme implementation of Adapton's core features, including a new adapton variables interface.
Findings
Easy to understand and extend implementation
Supports safe mutation and memoization in Scheme
Introduces adapton variables for expression management
Abstract
We describe a complete Scheme implementation of miniAdapton, which implements the core functionality of the Adapton system for incremental computation (also known as self-adjusting computation). Like Adapton, miniAdapton allows programmers to safely combine mutation and memoization. miniAdapton is built on top of an even simpler system, microAdapton. Both miniAdapton and microAdapton are designed to be easy to understand, extend, and port to host languages other than Scheme. We also present adapton variables, a new interface in Adapton for variables intended to represent expressions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Parallel Computing and Optimization Techniques · Evolutionary Algorithms and Applications
