Categories and Computer Science: Cambridge Computer Science Texts, cartea 28
Autor R. F. C. Waltersen Limba Engleză Paperback – 26 aug 1992
Toate formatele și edițiile
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 302.93 lei 6-8 săpt. | |
Cambridge University Press – 26 aug 1992 | 302.93 lei 6-8 săpt. | |
Hardback (1) | 574.67 lei 6-8 săpt. | |
Cambridge University Press – 26 aug 1992 | 574.67 lei 6-8 săpt. |
Preț: 302.93 lei
Preț vechi: 378.66 lei
-20% Nou
Puncte Express: 454
Preț estimativ în valută:
57.99€ • 59.64$ • 48.11£
57.99€ • 59.64$ • 48.11£
Carte tipărită la comandă
Livrare economică 19 februarie-05 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780521422260
ISBN-10: 0521422264
Pagini: 180
Dimensiuni: 152 x 229 x 11 mm
Greutate: 0.23 kg
Ediția:Revised
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge Computer Science Texts
Locul publicării:Cambridge, United Kingdom
ISBN-10: 0521422264
Pagini: 180
Dimensiuni: 152 x 229 x 11 mm
Greutate: 0.23 kg
Ediția:Revised
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge Computer Science Texts
Locul publicării:Cambridge, United Kingdom
Cuprins
Introduction; 1. The algebra of functions; 2. Products and sums; 3. Distributive categories; 4. Data types; 5. Categories of functors; 6. More about products; 7. Computational category theory; References; Index.
Recenzii
"Nice, crisp introduction to category theory, motivated by examples and use in computer science. Mathematical sophistication blends nicely with fundamental concepts and examples to make the connections (and usefulness) understandable to good undergraduates." The American Mathematical Monthly
"Within the setting of distributive categories, nicely explained here, one sees data structure abstractions done properly. The example of queues is the most compelling in that all of the structure of distributive categories is used....strongly recommend[ed]. David B. Benson, Computing Reviews
"...probably the clearest introduction to category theory written to date." The Bulletin of Mathematics Books
"Within the setting of distributive categories, nicely explained here, one sees data structure abstractions done properly. The example of queues is the most compelling in that all of the structure of distributive categories is used....strongly recommend[ed]. David B. Benson, Computing Reviews
"...probably the clearest introduction to category theory written to date." The Bulletin of Mathematics Books
Descriere
Provides an introduction to category theory whilst retaining a level of mathematical correctness, thus appealing to students of both computer science and mathematics.