An Automatic Technique for Selection of Data Structures in SETL Programs

Abstract

SETL is a very-high-level programming language supporting set-theoretic syntax and semantics.It allows algorithms to be programmed rapidly and succinctly without requiring data-structure declarations to be supplied.Such declarations can be manually specified later, without recoding the program, to improve the efficiency of program execution.We describe a new technique for automatic selection of appropriate data representations during compile time for programs with omitted declarations and present an efficient data representation selection algorithm, whose complexity is comparable with those of the fastest known general data-flow algorithms of Tarjan and Reif.