LOOP(ID:4392/loo008)

Tennant 1975

Paper language for explaining denotational syntax
References:
  • Schwartz, J. T. "Automatic data structure choice in a language of very high level" view details Abstract: 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.
          in [ACM] CACM 18(12) (Dec 1975) view details
  • Pagan, FG "ALGOL 68 as a metalanguage for denotational semantics" view details
          in The Computer Journal 22(1) view details