Automatic coding: choice of data structures.
James R. Low
- 01 Jan 1974
TL;DR: In this paper, a system is described which automatically chooses representations for high-level information structures, such as sets, sequences, and relations for a given computer program, by attempting to minimize the predicted space-time integral of the user's program execution.
read more
Abstract: : A system is described which automatically chooses representations for high-level information structures, such as sets, sequences, and relations for a given computer program. Representations are picked from a fixed library of low- level data structures including linked-lists, binary trees and hash tables. The representations are chosen by attempting to minimize the predicted space-time integral of the user's program execution. Predictions are based upon statistics of information structure use provided directly by the user and collected by monitoring executions of the user program using default representations for the high-level structures. A demonstration system has been constructed. Results using that system are presented.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
High level programming for distributed computing
TL;DR: An approach to distributed computing at the level of general purpose programming languages is described, based on primitive notions of module, message, and transaction key, which appears to be useful for programming a wide range of tasks.
186
Synthesis: Dreams → Programs
Zohar Manna,Richard Waldinger +1 more
TL;DR: Deductive techniques are presented for deriving programs systematically from given specifications and have been incorporated in a running program-synthesis system, called DEDALUS.
165
Program developments: formal explanations of implementations
TL;DR: This report discusses the documentation requirements of the development process and describes a prototype system for constructing and maintaining this documentation information and indicates the many remaining open issues and the direction to be taken in the pursuit of solutions.
137
Decision theory and artificial intelligence II: The hungry monkey
TL;DR: A problem-solving framework in which aspects of mathematical decision theory are incorporated into symbolic problem-resolution techniques currently predominant in artificial intelligence is described, illustrated by application to the classic monkey and bananas problem.
134
Programming by Refinement, as Exemplified by the SETL Representation Sublanguage
TL;DR: The facilities provided by the representation sublanguage and the run-time data structures that it can generate are described and a heuristic which uses some of the methods of global program analysis and which should be capable of selecting an acceptably efficient representation automatically is given.
107
Related Papers (5)
Cordell Green,David R. Barstow +1 more
- 03 Sep 1975
David R. Barstow
- 01 Jan 1979
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974