Applications of Categories in Computer Science
Category theory and related topics of mathematics have been increasingly applied to computer science in recent years. This book contains selected papers from the London Mathematical Society Symposium on the subject which was held at the University of Durham. Participants at the conference were leading computer scientists and mathematicians working in the area and this volume reflects the excitement and importance of the meeting. All the papers have been refereed and represent some of the most important and current ideas. Hence this book will be essential to mathematicians and computer scientists working in the applications of category theory.
- Potentially wide market - relevant to computer scientists as well as mathematicians
Product details
No date availablePaperback
9780521427265
352 pages
229 × 152 × 20 mm
0.505kg
1 b/w illus.
Table of Contents
- Preface
- Computational comonads and intensional semantics S. Brookes and S. Geva
- Weakly distributed categories J. R. B. Cockett and R. A. G. Seely
- Sequentiality and full abstraction P.-L. Curien
- Remarks on algebraically compact categories P. J. Freyd
- Dinaturality for free P. J. Freyd, E. P. Robinson and G. Rosolini
- Simply typed and untyped l-calculus revisited B. Jacobs
- Modelling reduction in confluent categories C. B. Jay
- On clubs and data-type constructors G. M. Kelly
- Penrose diagrams and 2-dimensional rewriting Y. Lafont
- Strong monads, algebras and fixed points P. S. Mulry
- Semantics of local variables P. W. O'Hearn and R. D. Tennant
- Using fibrations to understand subtypes W. Phoa
- Reasoning about sequential functions via logical relations K. Sieber
- I-categories and duality M. B. Smyth
- Geometric theories and databases S. Vickers
- Partial products, bagdomains and hyperlocal toposes P. T. Johnstone.