Surprise Castle
Basic Category Theory for Computer Scientists

Basic Category Theory for Computer Scientists - Paperback

$38.99
Quantity
01

Pay over time for orders over $35.00 with

Offers & Perks

Earn 38 points with this purchase

Added to your rewards balance after checkout.

100 points welcome bonus

Create an account and start with extra points.

Join now

Availability:In StockContributor:Benjamin C. PierceSeries:Foundations of ComputingAudience:Young AdultPublish date:1991-08-07Pages:116

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