HackerPapers

arXiv:1609.05337cs.PL

miniAdapton: A Minimal Implementation of Incremental Computation in Scheme

Dakota Fisher, Matthew A. Hammer, William Byrd, Matthew Might

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.

arXiv comments
Journal reference
DOI
Subjects
cs.PLProgramming Languages

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from Jun 2019 to Jul 2019.

Comments linking this paper, per year.

Discussed in comments2 threads

  1. The Art of the Propagator (2009) [pdf] 1 comment
  2. Scaling to 1M active GraphQL subscriptions on Postgres 1 comment

    • They built other libraries on top of this [1] [2], and when compared to mobx [3] it indeed looks very similar, however I think the target ideal of having a small core on top of which one would build more complex computation is essential. Since Clojure is pervasively built on…

      GorgeRondeView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.