Some TIME ago a group of mathematicians and computer scientists (including the editors of this volume) thought of making a scientific pilgrimage to the birthplace of al-Khw&rizmf, the outstanding ninth-century mathematician who gave his name to the word "algorithm". As his name indicates, al-Khwarizmi came from the Khorezm...

These proceedings of the ACM SIGPLAN History of Programming Languages (HOPL) conference are a record, in the words of those who helped make the history, of a baker's dozen of the languages that set the tone of most of today's programming. It is difficult to describe the feeling that prevailed at the conference. There were no parallel...

This book is an introduction to theoretical computer science emphasizing two interrelated areas: the theory of computability {how to tell whether problems are algorithmically solvable) and the theory of formal languages (how to design and use special languages, as for algorithms). Automata {idealized computer devices) are used as precise...

About four years ago David Luckham hinted to me the possibility of verifying a "real" compiler. At that time the idea seemed unrealistic, even absurd. After looking closer at the problem and getting more familiar with the possibilities of the Stanford verifier a verified compiler appeared not so impossible after all. In...

The first question which the reader, taking this book in his hands, asks himself is: for whom is this book "for everyone"? Of course, there is some exaggeration in the title. An acquaintance with the fundamentals of high school algebra is sufficient for the reader of this book. No knowledge of physics is needed: it can be your first...