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.
- 1 standish, T.A. A data definition facility for programming languages Ph.D. Th., Carnegie-Mellon U., 1967.Google Scholar
- 2 Pratt, T.W. Semantic modeling by hierarchical graphs. U. of Texas, 1969.Google Scholar
- 3 Holt, A.W. n-Theory, a mathematical method for the description and analysis of discrete finite information systems. Applied Data Research, Inc., 1965.Google Scholar
- 4 Reynolds, J.C. Automatic computation of data set definitions. Proc. IFIP Congress 1968, Vol. 1, North Holland Pub. Co., Amsterdam, pp. 456-461.Google Scholar
- 5 Reynolds, J.C. OEDANKEN-A simple typeless language which permits functional data structures and coroutines. Comm. ACM 13, 5 (May 1970), 308-319. Google ScholarDigital Library
- 6 Childs, D.C. Feasibility of a set-theoretic data structure. Proc. IFIP Congress 1968, Vol. 1, North Holland Pub. Co., Amsterdam, pp. 420-430.Google Scholar
- 7 Strachey, C. Towards a formal semantics. In Formal Language Description Languages. North-Holland Pub. Co., Amsterdam, 1966.Google Scholar
- 8 McCarthy, J., et al. Lisp 1.5 programmers manual. MIT Press, 1968. Google ScholarDigital Library
- 9 McCarthy, J. Recursive functions of symbolic expressions and their computation by machine, Part I. Comm. ACM 3, 4 (Apr. 1960), 184-195. Google ScholarDigital Library
- 10 Knuth, D.E. Fundamental Algorithms. Addison Wesley, Reading, Mass., 1968.Google Scholar
- 11 Floyd, R.W. Assigning meaning to programs. Proc. Symp. Appl. Math., Vol. 19, pp. 19-31.Google Scholar
- 12 Knowlton, K. A programmer's description of L. Comm. ACM 9, 8 (Aug. 1966), 616-625. Google ScholarDigital Library
- 13 Wirth, N. PL360, a programming language of the 360 computers. J. ACM 15, (Jan. 1968), 37-74. Google ScholarDigital Library
- 14 Deutsch, P., and Lampson, B. QSPL reference manual. U. of California, Berkeley, 1968.Google Scholar
- 15 Richards, M. BCPL: A tool for compiler writing and system programming. Proc. AFIPS 1969 SJCC, Vol. 34, AFIPS Press, Montvale, N.J., pp. 557-566.Google Scholar
- 16 Balzer, R. Dataless programming. Proc. AFIPS 1967 FJCC, Vol. AFIPS Press, Montvale, N.J., pp. 535-544.Google Scholar
- 17 Holt, A.W., et al. Final report for the information system theory project. Applied Data Research, Inc., 1968.Google Scholar
- 18 Earley, J. VERS-An extensible language with an implementation facility. Comput. Sci. Dep., U. of California, Berkeley, 1969.Google Scholar
- 19 Christensen, Carlos. An example of the manipulation of directed graphs in the AMBIT/G programming language. In Interactive Systems for Applied Mathematics. Klerer and Reinfelds (Eds.) Academic Press, New York, 1968.Google Scholar
- 20 Reynolds, J.C. A set-theoretic approach to the concept of type. Argonne Nat. Lab., 1969.Google Scholar
- 21 Dennis, J.B. Programming generality, parallelism, and computer architecture. Project MAC, UlT, 1968.Google Scholar
- 22 Mealy, George H. Another look at data. Proc. AFIPS 1967 FJCC, Vol. 31, AVIPS Press, Montvale, N.J., pp. 525-534.Google Scholar
- 23 Ross, D.T. A generalized technique for symbol manipulation and numerical calculation. Comm. ACM 4, 3 (Mar. 1961), 147-150. Google ScholarDigital Library
- 24 Codd, E.F. A relational model of data for large shared data banks. Comm. ACM 13, 6 (June 1970), 377-387. Google ScholarDigital Library
- 25 Earley, J. and Caizergues, P. VERS Manual. Comput. Sci. Dep., U. of California, Berkeley, 1971.Google Scholar
- 26 Schwartz, J. Set theory as a language for program specification and programming. New York U., 1970.Google Scholar
Index Terms
- Toward an understanding of data structures
Recommendations
Toward an understanding of data structures
SIGFIDET '70: Proceedings of the 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and ControlThis 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, we describe an implementation facility, which could be part ...
Gypsy: A language for specification and implementation of verifiable programs
Proceedings of an ACM conference on Language design for reliable softwareAn introduction to the Gypsy programming and specification language is given. Gypsy is a high-level programming language with facilities for general programming and also for systems programming that is oriented toward communications processing. This ...
Gypsy: A language for specification and implementation of verifiable programs
Proceedings of an ACM conference on Language design for reliable softwareAn introduction to the Gypsy programming and specification language is given. Gypsy is a high-level programming language with facilities for general programming and also for systems programming that is oriented toward communications processing. This ...
Comments