“Pure” SETL is a language of very high level allowing algorithms to be programmed rapidly and succintly. SETL's representation sublanguage adds a system of declarations which allow the user of the language to control the data structures that will be used to implement an algorithm which has already been written in pure SETL, so as to improve its… (More)
An efficient arrangement for interpretive code is described. It is related to Bell's notion of threaded code but requires less space and is more amenable to machine independent implementations.
Transformational programming is a relatively new programming technique intended to derive complex algorithms automatically. Initially, a set of transformational rules is described, and an initial specification of the problem to be programmed is given. The specification is written in a high-level language in a fairly compact form possibly ignoring… (More)
This paper shows that a programming language compiler can perform many kinds of tasks that are generally viewed as the domain of separate static analysis tools and, in the other direction, identifies certain kinds of analysis that are best left to separate tools.
Stylistic and layout changes as well as typographical corrections have been made, but the content is substantially identical to the initial publication. The text for this edition was provided courtesy of The Internet Archive. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not… (More)