Become a Readings Member to make your shopping experience even easier. Sign in or sign up for free!

Become a Readings Member. Sign in or sign up for free!

Hello Readings Member! Go to the member centre to view your orders, change your details, or view your lists, or sign out.

Hello Readings Member! Go to the member centre or sign out.

Basic Category Theory for Computer Scientists
Paperback

Basic Category Theory for Computer Scientists

$102.99
Sign in or become a Readings Member to add this title to your wishlist.

Category theory is a branch of pure mathematics that is an important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Theory for Computer Scientists provides a 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.

Read More
In Shop
Out of stock
Shipping & Delivery

$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout

MORE INFO
Format
Paperback
Publisher
MIT Press Ltd
Country
United States
Date
30 September 1991
Pages
116
ISBN
9780262660716

Category theory is a branch of pure mathematics that is an important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Theory for Computer Scientists provides a 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.

Read More
Format
Paperback
Publisher
MIT Press Ltd
Country
United States
Date
30 September 1991
Pages
116
ISBN
9780262660716