Table of Contents

1. First order reasoning; 2. Types and induction; 3. Posets and lattices; 4. Cartesian closed categories; 5. Limits and colimits; 6. Structural recursion; 7. Adjunctions; 8. Algebra with dependent types; 9. The quantifiers.

Promotional Information

This book is about the basis of mathematical reasoning both in pure mathematics itself and in computing.

Reviews

From the hardback review: 'This is a fascinating and rewarding book ... each chapter has several pages of subtle, provocative and imaginative exercises. In summary, it is a magnificent compilation of ideas and techniques: it is a mine of (well-organised) information suitable for the graduate student and experienced researcher alike.' Roy Dyckhoff, Bulletin of the London Mathematical Society