Automatic and semiautomatic optimization of SETL

  • Authors:
  • J. T. Schwartz

  • Affiliations:
  • -

  • Venue:
  • Proceedings of the ACM SIGPLAN symposium on Very high level languages
  • Year:
  • 1974

Quantified Score

Hi-index 0.00

Visualization

Abstract

The compilation of SETL, a programming language of high level based upon the dictions and semantic concepts of the mathematical theory of sets, raises optimization problems connected with the copying, representation, type-checking and indexing of composite data objects and subobjects. Methods are prescribed for treating some of these problems by adapting known techniques of global program analysis and optimization. A programmer-assisted approach to related, less tractable optimization problems is suggested.