Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Categories in Computer Science and Logic
 
Categories in Computer Science and Logic
Softcover ISBN:  978-0-8218-5100-5
Product Code:  CONM/92
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-7680-0
Product Code:  CONM/92.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-5100-5
eBook: ISBN:  978-0-8218-7680-0
Product Code:  CONM/92.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
Categories in Computer Science and Logic
Click above image for expanded view
Categories in Computer Science and Logic
Softcover ISBN:  978-0-8218-5100-5
Product Code:  CONM/92
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-7680-0
Product Code:  CONM/92.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-5100-5
eBook ISBN:  978-0-8218-7680-0
Product Code:  CONM/92.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
  • Book Details
     
     
    Contemporary Mathematics
    Volume: 921989; 382 pp
    MSC: Primary 18; Secondary 00; 03; 68

    Category theory has had important uses in logic since the invention of topos theory in the early 1960s, and logic has always been an important component of theoretical computer science. A new development has been the increase in direct interactions between category theory and computer science. In June 1987, an AMS-IMS-SIAM Summer Research Conference on Categories in Computer Science and Logic was held at the University of Colorado in Boulder. The aim of the conference was to bring together researchers working on the interconnections between category theory and computer science or between computer science and logic. The conference emphasized the ways in which the general machinery developed in category theory could be applied to specific questions and be used for category-theoretic studies of concrete problems. This volume represents the proceedings of the conference. (Some of the participants' contributions have been published elsewhere.)

    The papers published here relate to three different aspects of the conference. The first concerns topics relevant to all three fields, including, for example, Horn logic, lambda calculus, normal form reductions, algebraic theories, and categorical models for computability theory. In the area of logic, topics include semantical approaches to proof-theoretical questions, internal properties of specific objects in (pre-) topoi and their representations, and categorical sharpening of model-theoretic notions. Finally, in the area of computer science, the use of category theory in formalizing aspects of computer programming and program design is discussed.

  • Table of Contents
     
     
    • Articles
    • Michael Barr — Models of Horn theories [ MR 1003191 ]
    • Andreas Blass — Geometric invariance of existential fixed-point logic [ MR 1003192 ]
    • J. R. B. Cockett — On the decidability of objects in a locos [ MR 1003193 ]
    • V. C. V. de Paiva — The Dialectica categories [ MR 1003194 ]
    • Peter Freyd — Combinators [ MR 1003195 ]
    • Peter Freyd — POLYNAT in PER [ MR 1003196 ]
    • Jean-Yves Girard — Towards a geometry of interaction [ MR 1003197 ]
    • John W. Gray — The category of sketches as a model for algebraic semantics [ MR 1003198 ]
    • J. Martin E. Hyland and Andrew M. Pitts — The theory of constructions: categorical semantics and topos-theoretic models [ MR 1003199 ]
    • François Lamarche — A simple model of the theory of constructions [ MR 1003200 ]
    • J. Lambek — Multicategories revisited [ MR 1003201 ]
    • Dana May Latch — An application of minimal context-free intersection partitions to rewrite rule consistency checking [ MR 1003202 ]
    • F. William Lawvere — Qualitative distinctions between some toposes of generalized graphs [ MR 1003203 ]
    • John C. Mitchell and Philip J. Scott — Typed lambda models and Cartesian closed categories (preliminary version) [ MR 1003204 ]
    • Philip S. Mulry — Some connections between models of computation [ MR 1003205 ]
    • Robert Paré — Some applications of categorical model theory [ MR 1003206 ]
    • A. J. Power — Coherence for bicategories with finite bilimits. I [ MR 1003207 ]
    • Leopoldo Román — On partial Cartesian closed categories [ MR 1003208 ]
    • Andre Scedrov — Normalization revisited [ MR 1003209 ]
    • R. A. G. Seely — Linear logic, $*$-autonomous categories and cofree coalgebras [ MR 1003210 ]
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 921989; 382 pp
MSC: Primary 18; Secondary 00; 03; 68

Category theory has had important uses in logic since the invention of topos theory in the early 1960s, and logic has always been an important component of theoretical computer science. A new development has been the increase in direct interactions between category theory and computer science. In June 1987, an AMS-IMS-SIAM Summer Research Conference on Categories in Computer Science and Logic was held at the University of Colorado in Boulder. The aim of the conference was to bring together researchers working on the interconnections between category theory and computer science or between computer science and logic. The conference emphasized the ways in which the general machinery developed in category theory could be applied to specific questions and be used for category-theoretic studies of concrete problems. This volume represents the proceedings of the conference. (Some of the participants' contributions have been published elsewhere.)

The papers published here relate to three different aspects of the conference. The first concerns topics relevant to all three fields, including, for example, Horn logic, lambda calculus, normal form reductions, algebraic theories, and categorical models for computability theory. In the area of logic, topics include semantical approaches to proof-theoretical questions, internal properties of specific objects in (pre-) topoi and their representations, and categorical sharpening of model-theoretic notions. Finally, in the area of computer science, the use of category theory in formalizing aspects of computer programming and program design is discussed.

  • Articles
  • Michael Barr — Models of Horn theories [ MR 1003191 ]
  • Andreas Blass — Geometric invariance of existential fixed-point logic [ MR 1003192 ]
  • J. R. B. Cockett — On the decidability of objects in a locos [ MR 1003193 ]
  • V. C. V. de Paiva — The Dialectica categories [ MR 1003194 ]
  • Peter Freyd — Combinators [ MR 1003195 ]
  • Peter Freyd — POLYNAT in PER [ MR 1003196 ]
  • Jean-Yves Girard — Towards a geometry of interaction [ MR 1003197 ]
  • John W. Gray — The category of sketches as a model for algebraic semantics [ MR 1003198 ]
  • J. Martin E. Hyland and Andrew M. Pitts — The theory of constructions: categorical semantics and topos-theoretic models [ MR 1003199 ]
  • François Lamarche — A simple model of the theory of constructions [ MR 1003200 ]
  • J. Lambek — Multicategories revisited [ MR 1003201 ]
  • Dana May Latch — An application of minimal context-free intersection partitions to rewrite rule consistency checking [ MR 1003202 ]
  • F. William Lawvere — Qualitative distinctions between some toposes of generalized graphs [ MR 1003203 ]
  • John C. Mitchell and Philip J. Scott — Typed lambda models and Cartesian closed categories (preliminary version) [ MR 1003204 ]
  • Philip S. Mulry — Some connections between models of computation [ MR 1003205 ]
  • Robert Paré — Some applications of categorical model theory [ MR 1003206 ]
  • A. J. Power — Coherence for bicategories with finite bilimits. I [ MR 1003207 ]
  • Leopoldo Román — On partial Cartesian closed categories [ MR 1003208 ]
  • Andre Scedrov — Normalization revisited [ MR 1003209 ]
  • R. A. G. Seely — Linear logic, $*$-autonomous categories and cofree coalgebras [ MR 1003210 ]
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.