types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share abstract types with the corresponding nodes of the other structures. For example, consider a list of arguments, and a separate list of functions, where the n -th function of the second list should be applied only to the n -th argument of the first list. We can guarantee that this invariant is obeyed by coordinating the two lists, such that the type of the n -th argument is existentially Quantified and identical to the argument type of the n -th function. In this paper, we describe a minimal set of features sufficient for a type system to support coordinated data structures. We also demonstrate that two known type systems (Crary and Weirich's LX [6] and Xi, Chen and Chen's guarded recursive datatypes [24]) have these features, even though the systems were developed for other purposes. We illustrate the power of coordinated data structures as a programming idiom with three examples: (1) a list of function closures stored as a list of environments and a separate list of code pointers, (2) a "tagless" list, and (3) a red-black tree where the values and colors are stored in separate trees that are guaranteed to have the same shape.
types coordination coordinated data structures data structures data structure sharing abstraction examples argument functional invariance paper minimal feature type system systems support demonstrate recursion power program environments code pointers tree tree values color shape trees