Cambridge Tracts in Theoretical Computer Science – serie

Programs, Recursion and Unbounded Choice

Nets, Terms and Formulas

Three Views of Concurrent Processes and their Relationship

Two-Level Functional Languages

Extensions of First-Order Logic

Free Choice Petri Nets

The Logic of Typed Feature Structures

With Applications to Unification Grammars, Logic Programs and Constraint Resolution

Deductive and Declarative Programming

The Uncertain Reasoner's Companion

A Mathematical Perspective

Understanding Z

A Specification Language and its Formal Semantics

Basic Simple Type Theory

Domains and Lambda-Calculi

Mathematical Theory of Domains

Information Flow

The Logic of Distributed Systems

Algebraic Specification of Communication Protocols

Data Refinement

Model-Oriented Proof Methods and their Comparison

Hybrid Graph Theory and Network Analysis

Lambda-calculus, Combinators and Functional Programming

Higher Order Logic and Hardware Verification

A Unifying Framework for Structured Analysis and Design Models

An Approach Using Initial Algebra Semantics and Category Theory

The Clausal Theory of Types

Design Theory and Computer Science

Concurrency Verification

Introduction to Compositional and Non-compositional Methods

Nonmonotonic Reasoning

Logical Foundations of Commonsense

Nonmonotonic Reasoning

Logical Foundations of Commonsense

Design Theory and Computer Science

Term Rewriting Systems

A Unifying Framework for Structured Analysis and Design Models

An Approach Using Initial Algebra Semantics and Category Theory

The Clausal Theory of Types

Logic and Computation

Interactive Proof with Cambridge LCF