BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Basic Category Theory for Computer Scientists (Foundations of Computing)

Basic Category Theory for Computer Scientists (Foundations of Computing)

Basic Category Theory for Computer Scientists (Foundations of Computing)
Stock photo: cover may vary

Basic Category Theory for Computer Scientists (Foundations of Computing) Paperback - 1991 - 1st Edition

by Pierce, Benjamin C

Add to wish list
  • New
  • Paperback
New

Description

The MIT Press, 1991-08-07. Paperback. New. In shrink wrap. Looks like an interesting title!
Ask the seller a question Add to wish list
A$172.94
A$8.53 Delivery within USA
Standard delivery: 2 to 21 days
More delivery options
Ships from GridFreed LLC (California, United States)
The BIBLIO Guarantee

Details

  • Title Basic Category Theory for Computer Scientists (Foundations of Computing)
  • Author Pierce, Benjamin C
  • Binding Paperback
  • Edition number 1st
  • Edition 1
  • Condition New
  • Pages 116
  • Volumes 1
  • Language ENG
  • Publisher The MIT Press, Cambridge, MA
  • Publication date 1991-08-07
  • Bookseller's Inventory # Q-0262660717
  • ISBN 9780262660716 / 0262660717
  • Weight 0.49 lbs (0.22 kg)
  • Dimensions 8.98 x 7.1 x 0.38 in (22.81 x 18.03 x 0.97 cm)
  • Age range 18 to UP years
  • Grade levels 13 - UP
  • Category Mathematics
  • Library of Congress subjects Computer science - Mathematics, Categories (Mathematics)
  • Library of Congress Catalogue Number 91-8489
  • Dewey Decimal Code 511.3
  • Quantity available 1

About GridFreed LLC California, United States

Biblio member since 2021

We sell primarily non-fiction, many new books, some collectible first editions and signed books. We operate 100% online and have been in business since 2005.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from GridFreed LLC

Reader reviews for Basic Category Theory for Computer Scientists (Foundations of Computing)

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories.

Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts.

Contents
Tutorial - Applications - Further Reading

About the author

Benjamin C. Pierce is Professor of Computer and Information Science at the University of Pennsylvania.

Please wait a moment while we load the requested page.

tracking-