Algebraic structures which are generated by a collection of constructors| like natural
numbers (generated by a zero and a successor) or nite lists and trees| are of well …

This book is a textbook in basic category theory, written specifically to be read by
researchers and students in computing science. We expound the constructions we feel are …

In Chapter 1, we have seen how the algebra of the polynomial rings k [x1,..., xn] and the
geometry of affine algebraic varieties are linked. In this chapter, we will study the method of …

Much current research in computer science is concerned with two questions: is a program
correct? And how can we improve a correct program preserving correctness? This latter …

Unification is a fundamental process upon which many methods for automated deduction
are based. Unification theory abstracts from the specific applications of this process: it …

This is, we believe, the final version of a chaper for the Handbook of Logic and the
Foundations of Computer Science, vol. IV, Oxford University Press. It surveys a range of …

Semantics of Programming Languages exposes the basic motivations and philosophy
underlying the applications of semantic techniques in computer science. It introduces the …

Monads have become very popular for structuring functional programs since Wadler
introduced their use in 1990. In particular, libraries of combinators are often based on a …

Nominal sets provide a promising new mathematical analysis of names in formal languages
based upon symmetry, with many applications to the syntax and semantics of programming …

Combinatory logic and lambda-calculus, originally devised in the 1920s, have since
developed into linguistic tools, especially useful in programming languages. The authors' …