BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-81-883
       ENTRY:: June 05, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: On program transformations for abstract data types and
               concurrency
        TYPE:: Technical Report
      AUTHOR:: Pepper, P.
        DATE:: October 1981
       PAGES:: 40
    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.
       NOTES:: [Adminitrivia V1/Prg/19950605]
         END:: STAN//CS-TR-81-883