skip to main content
article
Free Access

Automatic data structure choice in a language of very high level

Published:01 December 1975Publication History
Skip Abstract Section

Abstract

SETL is a set-theoretically oriented language of very high level whose repertoire of semantic objects includes finite sets, ordered n-tuples, and sets of ordered n-tuples usable as mappings. This paper describes the structure of an optimizer for this language. Among other methods of interest, the optimizer uses techniques which allow relations of inclusion and membership to be established, the domains and ranges of (tabulated) mappings to be estimated from above and below, and the single-valuedness of (tabulated) mappings to be proved. Once facts of this kind have been established, automatic choice of data structures becomes possible. The methods employed are based upon, and extend, known techniques of data flow analysis.

References

  1. 1 Allen, F.E. A basis for program optimization. Proc. IFIP Congress 71, North-Holland Pub. Co., Amsterdam, 1971.Google ScholarGoogle Scholar
  2. 2 Allen, F.E. Interprocedural data flow analysis. Proc. IFIP Congress 74, North-Holland Publishing Co. Amsterdam, 1974.Google ScholarGoogle Scholar
  3. 3 Low, J.R. Automatic coding: choice of data structures. Ph.D. Th., Stanford U., 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Morris, J.B. A Comparison of MADCAP and SETL. Los Alamos Scientific Lab., U. of California, Los Alamos, N. M., 1973.Google ScholarGoogle Scholar
  5. 5 Schaefer, M. A Mathematical Theory of Global Program Optimization. Prentice-Hall Publishing Co., Englewood Cliffs, N.J., 1973. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Schwartz, J.T. On Programming: An htterim Report on the SETL Project: Installment 1. Generalities; hlstallment 2. The SETL Language and Examples of its Use. New York U., 1973.Google ScholarGoogle Scholar
  7. 7 Schwartz, J.T. Deducing relationships of inclusion and membership in SETL programs. SETL Newsletter No. 130, New York U., 1974.Google ScholarGoogle Scholar
  8. 8 Schwartz, J.T. More on copy optimization of SETL programs. SETL Newsletter No. 131, New York U., June 1974.Google ScholarGoogle Scholar
  9. 9 Schwartz, J.T. Deducing the logical structure of objects appearing in SETL programs. SETL Newsletter No. 71, New York U., Apr. 1972.Google ScholarGoogle Scholar
  10. 10 Schwartz, J.T. Inter-procedural optimization. SETL Newsletter No. 134, New York U., July 1974.Google ScholarGoogle Scholar
  11. 11 Schwartz, J.T. Optimization of very high level languages. J. Prog. Languages (1975), 161-194 (Part I), 197-218 (Part ll).Google ScholarGoogle Scholar
  12. 12 Sintzoff, M. Calculating properties of programs by valuations on specific models. ACM SIGPLAN Notices (Newsletter), 7, 1 (1972). Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 Tenenbaum, A. Revised and extended algorithms for deducing the types of objects appearing in SETL programs. SETL Newsletter No. 118, New York U., Oct. 1973.Google ScholarGoogle Scholar
  14. 14 Tenenbaum, A. Automatic type analysis in a very high level language. Th., New York U., Oct. 1974.Google ScholarGoogle Scholar

Index Terms

  1. Automatic data structure choice in a language of very high level

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image Communications of the ACM
                Communications of the ACM  Volume 18, Issue 12
                Dec. 1975
                62 pages
                ISSN:0001-0782
                EISSN:1557-7317
                DOI:10.1145/361227
                Issue’s Table of Contents

                Copyright © 1975 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 December 1975

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader