Fungi: A typed functional language for programs that name their own cached dependency graphs 
Fungi: A typed functional language for programs that name their own cached dependency graphs Fungi programs are demand-driven incremental computations, in the spirit of Adapton. In particular, Fungi provides two sub-languages for expressing the interactions of incremental computations, which it divides into two roles:
The archivist role computes incremental output from input on demand, and the editor role incrementally mutates this input over time, and may also change demand for output in the process (e.g., placing or removing focus on different outputs).
The semantics of Fungi programs are effectful, as they allocate programmer-named values and computations, and read these objects from memory later. However, due to Fungi's type and effect system for names, the behavior of Fungi archivists is functional: the key invariant of its type-and-effects system.
In particular, Fungi provides language affordances for - first-class names, - first class name-functions, - nominal, incremental collections, whose types are indexed by sets of names (e.g., to uniquely identify positions in a list), and - nominal, incremental functions over collections, whose types are indexed by what cached data and computations they read and write.
Fungi serves as the target language for IODyn. Unlike IODyn, the incremental features of Fungi are explicit.
src/ast.rs, and test/ast.rs