Work

Chess

Year: 1975
Type: article
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-lime 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 lhe high-level structures.A demonstration system has been constructed.Results using that system are presented.
Author: Lee Erman
Language: English
Subfield: Software
Open Access status: bronze
OpenAlex ID: W4245457169
FWCI:
Cites:
Cited by:
Related to: 10