Affiliation:
1. Univ. of California, Berkeley
Abstract
This paper presents a notation and formalism for describing the semantics of data structures. This is based on directed graphs with named edges and transformations on these graphs. In addition, and implementation facility is described which could be part of a programming language, which allows a programmer who has expressed the semantics of an algorithm in terms of the graphs to then specify the implementation of some of his data structures in order to gain efficiency.
Publisher
Association for Computing Machinery (ACM)
Reference26 articles.
1. Pratt T.W. Semantic modeling by hierarchical graphs. U. of Texas 1969. Pratt T.W. Semantic modeling by hierarchical graphs. U. of Texas 1969.
2. GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
Cited by
78 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Incremental Computation: What Is the Essence? (Invited Contribution);Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation;2024-01-11
2. A Science of Operations;History of Computing;2011
3. The Algol Research Programme;A Science of Operations;2011
4. Level-2 fuzzy sets and their usefulness in object-oriented database modelling;Fuzzy Sets and Systems;2003-11
5. Modelling of Fuzzy and Uncertain Spatio-Temporal Information in Databases;Intelligent Systems for Information Processing;2003