论文信息 - The selection of efficient implementations for a high-level language

The selection of efficient implementations for a high-level language

This paper considers the problem of identifying an efficient set of implementations for the abstract constructs in a very high level program description. LIBRA is a system that prunes and expands a tree of partially implemented program descriptions, given a set of refinement rules for generating the tree. Several sets of rules group, order, and select refinements. The analysis of the cost of a program (or program part) at any level of refinement is maintained for cost comparisons between different refinements, for bottleneck identification, and for branch and bound search.

Elaine Kant

[1] Robert Balzer,et al. On the Transformational Implementation approach to programming , 1976, ICSE '76.

[2] Ben Wegbreit,et al. Mechanical program analysis , 1975, CACM.

[3] Jacob T. Schwartz. Automatic Data Structure Choice in a Language of Very High Level , 1975, POPL.

[4] David R. Barstow,et al. Observations on the interaction between coding and efficiency knowledge in the PSI Program Synthesis System , 1976, ICSE '76.

[5] Thomas E. Cheatham,et al. A laboratory for the study of automating programming , 1971, AFIPS '72 (Spring).

[6] C. Cordell Green. The design of the PSI program synthesis system , 1976, ICSE '76.

[7] John Darlington,et al. Some transformations for developing recursive programs , 1975 .

[8] Paul D. Rovner,et al. Automatic representation selection for associative data structures , 1899, AFIPS National Computer Conference.

[9] David R. Barstow. A Knowledge-Based System for Automatic Program Construction , 1977, IJCAI.