The unified data structure capability in Madcap VI

@article{Wells1972TheUD,
  title={The unified data structure capability in Madcap VI},
  author={Mark B. Wells and James B. Morris},
  journal={International Journal of Computer \& Information Sciences},
  year={1972},
  volume={1},
  pages={193-208}
}
  • M. WellsJames B. Morris
  • Published 1 September 1972
  • Computer Science
  • International Journal of Computer & Information Sciences
The data structures which form an integral part of the Madcap VI programming language are described. The initialization (declarationand constructor) expressions and selector expressions of these structures are defined and their implementation using “codewords” is discussed. Structures, since they can contain references to other structures (including themselves), have the form of directed trees (graphs). Variables of primitive data type (real, complex, etc.) are naturally considered as… 

Relational level data structures for programming languages

  • J. Earley
  • Computer Science
    Acta Informatica
  • 2004
A high level of data structure description for programming languages which is called the relational level is described, which involves the use of an implementation facility to allow the programmer to specify the implementation of his relational level structures in terms of access path and machine level structures using a “structured programming” approach.

References

SHOWING 1-10 OF 11 REFERENCES

Generalized data structures in Madcap VI

The Madcap VI generalized data structures are compared to data structure concepts in PL/1 and their implementation using "codewords" is discussed.

Storage organization in programming systems

The system of program and data representation that has been in use on the Rice University computer for five years is described and the application of labeled blocks may be extended to areas of time-sharing and multi-media storage control.

Revised report on the algorithm language ALGOL 60

a survey of the basic coustituents arid fcuturcs of the language is given, and the formal notation, by which the syntactic structure is defined, is esplaincd. The sccnnd chapter lists all the basic

MADCAP: a scientific compiler for a displayed formula textbook language

The compiler, MADCAP, is an attempt to eliminate the disparity between the textbook presentation of a problem and that presentation which serves as input for a compiler.

Aspects of Language Design for Combinatorial Computing

  • M. Wells
  • Computer Science
    IEEE Trans. Electron. Comput.
  • 1964
Experience in the area of combinatorial computing acquired by the Maniac group at Los Alamos has motivated language development in this direction, and the bit manipulation facilities of Maniac II are discussed.

Review of "Programming Languages: History and Fundamentals, by (Miss) Jean E. Sammet." Prentice-Hall, Inc. (1969)

The introduction of DATA BASE as a new quarterly journa l of SIGBDP to replace the former Newsletter provided a n opportunity to reconsider the style, format, and functio n of a "Book Reviews" column

Reflections on a systems programming language

A critical evaluation of the Bliss systems implementation language is attempted - its failures as well as its successes - with an eye toward the development of future systems implementation languages.

Programming languages - history and fundamentals

  • J. Sammet
  • Psychology
    Prentice-Hall series in automatic computation
  • 1969
We may not be able to make you love reading, but programming languages history and fundamentals will lead you to love reading starting from now. Book is the window to open the new world. The world

Informal Introduction to Algol 68

By reading informal introduction to algol 68, you can take more advantages with limited budget.

The Art of Computer Programming

The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.