“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.
The NYU-Ada project is engaged in the design and implementation of a translator-interpreter for the Ada language. The objectives of this project are twofold: a) to provide an executable semantic model for the full Ada language, that can be used for teaching, and serve as a starting point for the design of an efficient Ada compiler; b) to serve as a testing… (More)
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)
Associated with every programming language is a style of programming which is encouraged by the semantic and syntactic features of this language. We are all familiar with the phenomenon of a FORTRAN programmer approaching APL for the first time and writing correct APL programs which are nevertheless emphatically criticized for not displaying the proper APL… (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.