An Automatic Technique for Selection of Data Representations in SETL Programs
- 1 April 1981
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 3 (2), 126-143
- https://doi.org/10.1145/357133.357135
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Fast Algorithms for Solving Path ProblemsJournal of the ACM, 1981
- A Unified Approach to Path ProblemsJournal of the ACM, 1981
- Programming by Refinement, as Exemplified by the SETL Representation SublanguageACM Transactions on Programming Languages and Systems, 1979
- Automatic data structure selectionCommunications of the ACM, 1978
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Data structures and accessing in data-base systems, I: Evolution of information systemsIBM Systems Journal, 1973
- Toward an understanding of data structuresCommunications of the ACM, 1971
- Optimization aspects of compiler-compilersACM SIGPLAN Notices, 1970
- Data structures and their representation in storageAnnual Review in Automatic Programming, 1969