Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Applications of Categories in Computer Science

Applications of Categories in Computer Science

Applications of Categories in Computer Science

Proceedings of the London Mathematical Society Symposium, Durham 1991
Editors:
M. P. Fourman, University of Edinburgh
P. T. Johnstone, University of Cambridge
A. M. Pitts, University of Cambridge
S. Brookes, S. Geva, J. R. B. Cockett, R. A. G. Seely, P.-L. Curien, P. J. Freyd, E. P. Robinson, G. Rosolini, B. Jacob, C. B. Jay, G. M. Kelly, Y. Lafont, P. S. Mulry, P. W. O'Hearn, R. D. Tennant, W. Phoa, K. Sieber, M. B. Smyth, S. Vickers, P. T. Johnstone
Published:
June 1992
Availability:
Available
Format:
Paperback
ISBN:
9780521427265

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] providing details of the course you are teaching.

$82.00
USD
Paperback
$82.00 USD
eBook

    Applications of category theory and related topics of mathematics to computer science have been a growing area in recent years. This book contains selected papers on the subject from the London Mathematical Society Symposium held at the University of Durham in July 1991.

    • Potentially wide market - relevant to computer scientists as well as mathematicians

    Product details

    January 2011
    Adobe eBook Reader
    9780511892677
    0 pages
    0kg
    1 b/w illus.
    This ISBN is for an eBook version which is distributed on our behalf by a third party.

    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.
      Contributors
    • S. Brookes, S. Geva, J. R. B. Cockett, R. A. G. Seely, P.-L. Curien, P. J. Freyd, E. P. Robinson, G. Rosolini, B. Jacob, C. B. Jay, G. M. Kelly, Y. Lafont, P. S. Mulry, P. W. O'Hearn, R. D. Tennant, W. Phoa, K. Sieber, M. B. Smyth, S. Vickers, P. T. Johnstone

    • Editors
    • M. P. Fourman , University of Edinburgh
    • P. T. Johnstone , University of Cambridge
    • A. M. Pitts , University of Cambridge

      Andrew Pitts FACM FBCS is Professor of Theoretical Computer Science at the University of Cambridge and a Fellow of Darwin College.