Calculating properties of programs by valuations on specific models
Proceedings of ACM conference on Proving assertions about programs
Automatic coding: choice of data structures.
Automatic coding: choice of data structures.
A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)
A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study
Journal of Symbolic Computation
Binding performance at language design time
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Widening the representation bottleneck: a functional implementation of relational programming
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Towards increased productivity of algorithm implementation
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
A MATLAB to Fortran 90 translator and its effectiveness
ICS '96 Proceedings of the 10th international conference on Supercomputing
High level reading and data structure compilation
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Techniques for the translation of MATLAB programs into Fortran 90
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program Transformation Systems
ACM Computing Surveys (CSUR)
Programming by Refinement, as Exemplified by the SETL Representation Sublanguage
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Improving and refining programs by program manipulation
ACM '76 Proceedings of the 1976 annual conference
Introduction to relational programming
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
On the Transformational Implementation approach to programming
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Pseudo-oracles for non-testable programs
ACM '81 Proceedings of the ACM '81 conference
Aspects of the ALGOL 68 mode structure
ACM SIGPLAN Notices
Competitive algorithms for the dynamic selection of component implementations
IBM Systems Journal
Higher-Order and Symbolic Computation
Relational programming with CrocoPat
Proceedings of the 28th international conference on Software engineering
| Hi-index | 48.22 |
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.