This unique book offers an introductory course on category theory, which became a working language in algebraic geometry and number theory in the 1950s and began to spread to logic and computer science soon after it was created.
Offering excellent use of helpful examples in Haskell, the work covers (among other things) concepts of functors, natural transformations, monads, adjoints, universality, category equivalence, and many others. The main goal is to understand the Yoneda lemma, which can be used to reverse-engineer the implementation of a function. Later chapters offer more insights into computer science, including computation with output, nondeterministic computation, and continuation passing.
Topics and features:
The work will be useful to undergraduate students in computer science who have enough background in college mathematics such as linear algebra and basics in Haskell polymorphic functions. Further, it will appeal to graduate students and researchers in computing disciplines who want to newly acquire serious knowledge of category theory.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Shuichi YUKITA was born in 1954. He received the B.S. degree in physics, M.S. degree in mathematics from the University of Tokyo in 1976 and 1978, respectively. He received the Ph.D. degree in information science from Tohoku University, Sendai, Japan in 2000. He is now with the Faculty of Computer and Information Sciences at Hosei University, Japan.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. N° de réf. du vendeur 1743120110
Quantité disponible : Plus de 20 disponibles
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9783031685378
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783031685378_new
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This unique book offers an introductory course on category theory, which became a working language in algebraic geometry and number theory in the 1950s and began to spread to logic and computer science soon after it was created.Offering excellent use of helpful examples in Haskell, the work covers (among other things) concepts of functors, natural transformations, monads, adjoints, universality, category equivalence, and many others. The main goal is to understand the Yoneda lemma, which can be used to reverse-engineer the implementation of a function. Later chapters offer more insights into computer science, including computation with output, nondeterministic computation, and continuation passing.Topics and features:Contains rigorous mathematical arguments to support the theoryProvides numerous Haskell code-implementing examplesEngages with plentiful diagram chasing, with special emphasis on the design patterns for constructing a large diagram out of basic small piecesOffers insights into category theory to quantum computing and the foundation of computing disciplineServes as a preparatory course for monoidal categories and higher categoriesThe work will be useful to undergraduate students in computer science who have enough background in college mathematics such as linear algebra and basics in Haskell polymorphic functions. Further, it will appeal to graduate students and researchers in computing disciplines who want to newly acquire serious knowledge of category theory. 297 pp. Englisch. N° de réf. du vendeur 9783031685378
Quantité disponible : 2 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Buch. Etat : Neu. Category Theory Using Haskell | An Introduction with Moggi and Yoneda | Shuichi Yukita | Buch | xi | Englisch | 2024 | Springer | EAN 9783031685378 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. N° de réf. du vendeur 129766768
Quantité disponible : 5 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26401517839
Quantité disponible : 4 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -This unique book offers an introductory course on category theory, which became a working language in algebraic geometry and number theory in the 1950s and began to spread to logic and computer science soon after it was created.Offering excellent use of helpful examples in Haskell, the work covers (among other things) concepts of functors, natural transformations, monads, adjoints, universality, category equivalence, and many others. The main goal is to understand the Yoneda lemma, which can be used to reverse-engineer the implementation of a function. Later chapters offer more insights into computer science, including computation with output, nondeterministic computation, and continuation passing.Topics and features:Contains rigorous mathematical arguments to support the theoryProvides numerous Haskell code-implementing examplesEngages with plentiful diagram chasing, with special emphasis on the design patterns for constructing a large diagram out of basic small piecesOffers insights into category theory to quantum computing and the foundation of computing disciplineServes as a preparatory course for monoidal categories and higher categoriesThe work will be useful to undergraduate students in computer science who have enough background in college mathematics such as linear algebra and basics in Haskell polymorphic functions. Further, it will appeal to graduate students and researchers in computing disciplines who want to newly acquire serious knowledge of category theory.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 312 pp. Englisch. N° de réf. du vendeur 9783031685378
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This unique book offers an introductory course on category theory, which became a working language in algebraic geometry and number theory in the 1950s and began to spread to logic and computer science soon after it was created.Offering excellent use of helpful examples in Haskell, the work covers (among other things) concepts of functors, natural transformations, monads, adjoints, universality, category equivalence, and many others. The main goal is to understand the Yoneda lemma, which can be used to reverse-engineer the implementation of a function. Later chapters offer more insights into computer science, including computation with output, nondeterministic computation, and continuation passing.Topics and features:Contains rigorous mathematical arguments to support the theoryProvides numerous Haskell code-implementing examplesEngages with plentiful diagram chasing, with special emphasis on the design patterns for constructing a large diagram out of basic small piecesOffers insights into category theory to quantum computing and the foundation of computing disciplineServes as a preparatory course for monoidal categories and higher categoriesThe work will be useful to undergraduate students in computer science who have enough background in college mathematics such as linear algebra and basics in Haskell polymorphic functions. Further, it will appeal to graduate students and researchers in computing disciplines who want to newly acquire serious knowledge of category theory. N° de réf. du vendeur 9783031685378
Quantité disponible : 1 disponible(s)
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Hardcover. Etat : new. Hardcover. This unique book offers an introductory course on category theory, which became a working language in algebraic geometry and number theory in the 1950s and began to spread to logic and computer science soon after it was created.Offering excellent use of helpful examples in Haskell, the work covers (among other things) concepts of functors, natural transformations, monads, adjoints, universality, category equivalence, and many others. The main goal is to understand the Yoneda lemma, which can be used to reverse-engineer the implementation of a function. Later chapters offer more insights into computer science, including computation with output, nondeterministic computation, and continuation passing. Topics and features:Contains rigorous mathematical arguments to support the theoryProvides numerous Haskell code-implementing examplesEngages with plentiful diagram chasing, with special emphasis on the design patterns for constructing a large diagram out of basic small piecesOffers insights into category theory to quantum computing and the foundation of computing disciplineServes as a preparatory course for monoidal categories and higher categoriesThe work will be useful to undergraduate students in computer science who have enough background in college mathematics such as linear algebra and basics in Haskell polymorphic functions. Further, it will appeal to graduate students and researchers in computing disciplines who want to newly acquire serious knowledge of category theory. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9783031685378
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand. N° de réf. du vendeur 395907792
Quantité disponible : 4 disponible(s)