Böcker i Cambridge Tracts in Theoretical Computer Science-serien

Recent research on the physical technologies of very large scale integration (VLSI).

Describes the use of computer programs to check several proofs in the foundations of mathematics.

This book gives applications of the theory of process algebra. or Algebra of Comunicating Processes (ACS).

This book tackles the problems of update algorithms for databases. How can one construct and maintain a database of facts, capable of incorporating new information and getting rid of all outdated information, and yet in the process not disturb any other information in the database?

Action Semantics is a comprehensive introduction to the semantics of programming languages. It will be of use to graduates of computer science and mathematics.

A study of techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). The book is aimed at graduate students and researchers in theoretical computer science.

This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in ways independent of both language and platform. To do this the authors explain denotational and operational semantics and exploit the duality between them.

This 2001 book is an introduction to verifying concurrent programs scaling up to a realistic size. It is self-contained and comprehensive, guiding the reader from advanced undergraduate level. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text.

A comprehensive 2003 treatment of term rewriting systems from an elementary to an advanced level. Much of this material appeared here for the first time in book form. Ideal for teaching or research, it features numerous exercises with selected solutions on the web, an extensive bibliography and a chapter on applications.

This 1993 book shows how formal logic can be used to specify the behaviour of hardware designs and reason about their correctness. The book is based in part on the author's own research as well as on graduate teaching. Thus it can be used to accompany courses on hardware verification and as a resource for research workers.

The logic and methodology of design is examined in this book from the perspective of computer science. Computers provide the context for this both by discussion of the design process for hardware and software systems and by consideration of the role of computers in design in general. The question is whether we can construct a theory of design.

The author presents a theory whereby nets, terms and formulas represent concurrent processes at three levels of abstraction. The use of transformations in a series of case studies and the author identifies directions for research.

The authors describe here a framework in which the type notation of functional languages is extended to include a distinguishing notation for run-times and compile-times. Consequently the ability to specify code and verify program correctness can be improved.

This book introduces and teaches the techniques of type theory by focusing on one particularly neat system and studying it in detail. In this way, all the key ideas are covered without getting involved in the complications of more advanced systems, but concentrating rather on the principles that make the theory work in practice.

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.

Information is a central topic in computer science, cognitive science and philosophy. In spite of its importance in the 'information age', there is no consensus on what information is, what makes it possible, and what it means for one medium to carry information about another. Drawing on ideas from mathematics, computer science and philosophy, this book addresses the definition and place of information in society. The authors, observing that information flow is possible only within a connected distribution system, provide a mathematically rigorous, philosophically sound foundation for a science of information. They illustrate their theory by applying it to a wide range of phenomena, from file transfer to DNA, from quantum mechanics to speech act theory.

This book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science.

A complete account of the predicate transformation calculus semantics of sequential programs.

Classical logic has proved inadequate in various areas of computer science, artificial intelligence, mathematics, philosopy and linguistics. This is an introduction to extensions of first-order logic, based on the principle that many-sorted logic (MSL) provides a unifying framework in which to work.