Results by title

Reflection, the capacity to represent our ideas and to make them the object of our own thoughts, has for many centuries been recognized as a key mark of human intelligence. The very success and extension of reflective ideas in logic and computer science underscores the need for conceptual foundations.

This book proposes a general theory of reflective logics and reflective declarative programming languages. This theory provides a conceptual foundation for judging the extent to which a computational system is reflective. Manuel Clavel presents a proof of the reflective nature of rewriting logic and provides examples of the potential for reflective programming in a number of novel computer applications. These applications are implemented in Maude, a reflective programming language and environment based on rewriting logic that can define, represent and execute a breadth of logics, languages and models of computation. A general method to easily build theorem-proving tools in Maude is also proposed and illustrated. The book goes on to promote the notion of a "universal theory" that can simulate the deductions of all representable theories within any given logic.

Analysis of Algorithms is the fourth in a series of collected works by world-renowned computer scientist Donald Knuth. This volume is devoted to an important subfield of Computer Science that Knuth founded in the 1960s and still considers his main life's work. This field, to which he gave the name Analysis of Algorithms, deals with quantitative studies of computer techniques, leading to methods for understanding and predicting the efficiency of computer programs. Analysis of Algorithms, which has grown to be a thriving international discipline, is the unifying theme underlying Knuth's well known book The Art of Computer Programming. More than 30 of the fundamental papers that helped to shape this field are reprinted and updated in the present collection, together with historical material that has not previously been published. Although many ideas come and go in the rapidly changing world of computer science, the basic concepts and techniques of algorithmic analysis will remain important as long as computers are used.