PL360, a Programming Language for the 360 Computers
Journal of the ACM (JACM)
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
A programmer's description of L6
Communications of the ACM
A generalized technique for symbol manipulation and numerical calculation
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
LISP 1.5 Programmer's Manual
HOPL-II The second ACM SIGPLAN conference on History of programming languages
A facility for defining and manipulating generalized data structures
ACM Transactions on Database Systems (TODS)
Allocating Storage for Extendible Arrays
Journal of the ACM (JACM)
Progress in Picture Processing: 1969--71
ACM Computing Surveys (CSUR)
An Automatic Technique for Selection of Data Representations in SETL Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Final Data Types and Their Specification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
A method for incrementally compiling languages with nested statement structure
Communications of the ACM
Final data type specifications: a new data type specification method
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An analyzable annotation language
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Programming with abstract data types
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems
Specification techniques for data abstractions
Proceedings of the international conference on Reliable software
Logical Structure Specification and data type definition
ACM '79 Proceedings of the 1979 annual conference
Techniques for the automatic selection of data structures
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
IUHM: a hypermedia-based model for integrating open services, data and metadata
Proceedings of the fourteenth ACM conference on Hypertext and hypermedia
On the development of data structures
ACM SIGPLAN Notices
Suggestions about a specification technique
ACM SIGPLAN Notices
Limits of the "algebraic" specification of abstract data types
ACM SIGPLAN Notices
Bringing data base technology to the programmer
ACM SIGMOD Record
A graduate course in database management
ACM SIGMOD Record
Data types and program correctness
ACM SIGPLAN Notices - Special issue on programming language design
History of programming languages---II
A graph theoretic model of data structures
ACM SIGIR Forum
Final report of the ANSI/X3/SPARC DBS-SG relational database task group
ACM SIGMOD Record
LOGOS and the software engineer
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Data structures in the extensible programming language AEPL
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Data types and program correctness
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
A formal representation for plans in the programmer's apprentice
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
IBM Journal of Research and Development
Recent developments in the theory of data structures
Computer Languages
Implementing a data definition facility driven by graph grammars
Computer Languages
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 48.25 |
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.