Report Number: CS-TR-81-883
Institution: Stanford University, Department of Computer Science
Title: On program transformations for abstract data types and concurrency
Author: Pepper, P.
Date: October 1981
Abstract: We study transformation rules for a particular class of abstract data types, namely types that are representable by recursive mode declarations. The transformations are tailored to the development of efficient tree traversal and they allow for concurrency. The techniques are exemplified by an implementation of concurrent insertion and deletion in 2-3-trees.