Bøger i Cambridge Tracts in Theoretical Computer Science serien

This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics. Seven chapters deal with various aspects of bisimulation and coinduction: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities.

This is a self contained volume in which the authors concentrate on the 'probably approximately correct model'. It will therefore form an introduction to the theory of computational learning, suitable for a broad spectrum of graduate students from theoretical computer science and mathematics.

This book, the first in the subject, is a comprehensive account of optimal reduction by two of its leading exponents. Practical implementation aspects are fully covered as are its mathematical underpinnings. The book is essentially self-contained, requiring no more than basic familiarity with functional languages. It will be welcomed by graduate students and research workers.

This is an advanced textbook on topology for computer scientists. It is based on a course given by the author to postgraduate students of computer science at Imperial College.

In this book the authors use the formal specification language PSF to provide descriptions of several communication protocols.

Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book presents a comprehensive overview of the various process algebras in use, and sets the standard for the field. Features include numerous exercises and an accompanying website.

An introduction to the mathematical foundations of the subject. This work will be welcomed by graduate students and research workers in logic, philosophy and computer science as a textbook for beginners.

Originally published in 1988, this book presents an introduction to lambda-calculus and combinators without getting lost in the details of mathematical aspects of their theory. Lambda-calculus is treated here as a functional language and its relevance to computer science is clearly demonstrated.

This book develops the theory of typed feature structures, a data structure that generalizes both first-order terms and feature structures of unification-based grammars to include inheritance, typing, inequality, cycles and intensionality. The resulting synthesis serves as a logical foundation for grammars, logic programming and constraint-based reasoning systems.

Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques.

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.

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 book presents a rigorous foundation for defining Boolean categories and will appeal to graduate students and researchers in theoretical computer science.

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 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?

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

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

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

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

Belief revision is a topic of much interest in theoretical computer science and logic, and it forms a central problem in research into artificial intelligence. This book contains a collection of research articles on belief revision that are right up to date and an introductory chapter that presents a survey of current research in the area and the fundamentals of the theory.