John Cocke
Abstract
When considering compiler optimization, there are two questions that immediately come to mind; one, why and to what extent is optimization necessary and two, to what extent is it possible.
When considering the second question, one might immediately become discouraged since it is well known that the program equivalency problem is recursively unsolvable. It is, of course, clear from this that there will never be techniques for generating a completely optimum program. These unsolvability results, however, do not preclude the possibility of ad hoc techniques for program improvement or even a partial theory which produces a class of equivalent programs optimized in varying degrees.
The reasons why optimization is required seem to me to fall in two major categories. The first I will call “local” and the second “global”.
Index Terms
- Global common subexpression elimination
Recommendations
Global common subexpression elimination
Proceedings of a symposium on Compiler optimizationWhen considering compiler optimization, there are two questions that immediately come to mind; one, why and to what extent is optimization necessary and two, to what extent is it possible.
When considering the second question, one might immediately ...
Using the new common Lisp pretty printer
Although not part of the initial definition of the language, pretty printing has been an important feature of Lisp programming environments for twenty years or more [1]. By the time Common Lisp was being defined, the importance of pretty printing was ...
Scientific foundation for global computing
Transactions on Computational Systems Biology IVIt is a big honour to be able to speak at one of the most exciting conferences I have been to for 20 years.
I feel in some ways daunted because, although the development of connections between biology and computer science may seem wonderful from outside,...
Comments