Programming over a Persistent Data Space

Author:Pfaltz, John, Institute for Parallel ComputationUniversity of Virginia

The purpose of this report is to describe semantic properties of languages that support direct access to items in persistent data spaces. These languages differ in non-trivial ways from more familiar languages which describe processes operating over data represented in a transient memory. These semantics are presented with respect to a formal Turing machine model, which we first develop. Then, we examine issues associated with type and class inheritance which we regard as distinct concepts, with symbolic naming, with set operation semantics which are somewhat surprising, and with data deletion which is quite difficult. Finally, we hint at a few of the differences in programming psychology which are engendered by such semantics.
Note: Abstract extracted from PDF text

All rights reserved (no additional license for public reuse)
Source Citation:

Pfaltz, John. "Programming over a Persistent Data Space." University of Virginia Institute for Parallel Computation Tech Report (1992).

University of Virginia, Institute for Parallel Computation
Published Date: