Learn More
In his influential letter "Go to statement considered harmful" [2], Edsger Dijkstra asserts that goto's make a program difficult to understand. He argues that arbitrary changes of the program control point are difficult to follow in conjunction with dynamic changes to the state of the program data. The abstract control structures of high level languages(More)
Side-effects are forbidden in applicative languages like Prolog [3], FP [2], pure Lisp [9], and SISAL [8]. Algorithms can often be reformulated applicatively with no loss of efficiency. It is not known whether this is always the case. Here are seven problems which have been resistant to efficient reformulation. The reader is invited to produce an efficient(More)
<bold>Prolog has become a subject of much discussion of late. It has been suggested as the logical language for programming expert systems. A parallel variant is said to be the language of the Japanese 5th Generation Project. In this paper the standard Prolog language is defined and shown to be a restriction of Logic Programming. Several alternative(More)
  • Carl Ponder
  • SIGMETRICS Performance Evaluation Review
  • 1990
The performance ratio between two systems tends to vary across different benchmarks. Here we study this variation as a "signature" or "fingerprint" of the systems under consideration. This "fingerprint" can be used to guess the performance of programs not represented in a benchmark suite, assess the breadth and credibility of the benchmark suite, and infer(More)
Comparing the speed of computation in algebra systems is a perennial occupation of system designers, algorithm implementors, and, more recently, marketing personnel. At least some people have observed that for many problems, the choice of a system makes much less difference than the approach used to represent the problem. The mapping from mathematics to a(More)