Series: Cambridge Tracts in Theoretical Computer Science

Two-Level Functional Languages

Hybrid Graph Theory and Network Analysis

Algorithmic Information Theory

Rippling

A Unifying Framework for Structured Analysis and Design Models

Domains and Lambda-Calculi

Modal Logic

Understanding Z

Nonmonotonic Reasoning

Topology Via Logic

Finite-State Techniques

Higher Order Logic and Hardware Verification

Formal Semantics and Pragmatics for Natural Language Querying

The Optimal Implementation of Functional Programming Languages

Applications of Process Algebra

Epistemic Logic for AI and Computer Science

Data Refinement

Nets, Terms and Formulas

Updating Logical Databases

Temporal Logics in Computer Science

Logic and Computation

Higher Order Logic and Hardware Verification

Lambda-Calculus, Combinators and Functional Programming

The Uncertain Reasoner''s Companion

Topological Duality for Distributive Lattices

Belief Revision

Mathematical Theory of Domains

Basic Proof Theory

The Clausal Theory of Types

Design Theory and Computer Science

Predicate Transformer Semantics

Nonmonotonic Reasoning

Deductive and Declarative Programming

Extensions of First-Order Logic

Initial Algebras and Terminal Coalgebras

Syntax and Semantics of Petri Nets

Computational Learning Theory

Information Flow

Algebraic Specification of Communication Protocols

A Unifying Framework for Structured Analysis and Design Models

Data Refinement

Introduction to Coalgebra

Programs, Recursion and Unbounded Choice

Metamathematics, Machines and Godel''s Proof

Nominal Sets

Information Flow

Formal Specification and Design

The Clausal Theory of Types

Nets, Terms and Formulas

Formal Methods in Artificial Intelligence