Storage organization in programming systems
Communications of the ACM
MADCAP: a scientific compiler for a displayed formula textbook language
Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
Programming Languages: History and Fundamentals
Programming Languages: History and Fundamentals
A facility for defining and manipulating generalized data structures
ACM Transactions on Database Systems (TODS)
Fen—an axiomatic basis for program semantics
Communications of the ACM
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 0.02 |
The data structures proposed for the Madcap VI programming language are described. The declaration, value specification, and referencing of these structures are defined formally and their implementation using "codewords" is discussed. A structure declaration has the form of a directed tree, and a structure itself, since it can contain references to other structures, including itself, has the form of a directed graph. Levels of the tree may be ordered or unordered. Variables of primitive data-type (real, complex, etc.) are naturally considered as empty structures. The possibility for both multi-and fractional-word representation of structures is evident, but, of course the language itself is implementation independent. Thus a field is equivalent to a sub-structure. The Madcap VI generalized data structures are compared to data structure concepts in PL/1.