We formalize our programming model in the context of a typed lambda calculus with records. Figure 1 shows the abstract syntax of our core language. Besides standard terms, the language includes terms related to (a) spores, (b) silos, and (c) futures. The spore term creates a new spore. It contains a list of variable definitions, the spore header, and a closure which may only refer to its parame...