On Program Transformations for Abstract Data Types and Concurrency,

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. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1981
Accession Number
ADA112492

Entities

People

  • P. Pepper

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computational Science
  • Computer Programming
  • Computer Science
  • Computers
  • Concrete
  • Databases
  • Environment
  • Language
  • Literature
  • Mathematics
  • Multiprogramming
  • Notation
  • Programming Languages
  • Software Development
  • Standards
  • Trees (Data Structures)

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Linguistics