Articoli correlati a Category Theory Using Haskell: An Introduction with...
Sinossi
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 theory
- Provides numerous Haskell code-implementing examples
- Engages with plentiful diagram chasing, with special emphasis on the design patterns for constructing a large diagram out of basic small pieces
- Offers insights into category theory to quantum computing and the foundation of computing discipline
- Serves as a preparatory course for monoidal categories and higher categories
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull?autore
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.
Dalla quarta di copertina
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 theory
- Provides numerous Haskell code-implementing examples
- Engages with plentiful diagram chasing, with special emphasis on the design patterns for constructing a large diagram out of basic small pieces
- Offers insights into category theory to quantum computing and the foundation of computing discipline
- Serves as a preparatory course for monoidal categories and higher categories
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.
Prof. Shuichi Yukita is with the Faculty of Computer and Information Sciences at Hosei University, Hosei, Japan.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 175,51
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiRisultati della ricerca per Category Theory Using Haskell: An Introduction with...
Immagini fornite dal venditore
Category Theory Using Haskell
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Codice articolo 1743120110
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Category Theory Using Haskell
Editore:
Springer, Berlin, Springer Nature Switzerland, Birkhäuser, 2024
ISBN 10: 3031685377
ISBN 13: 9783031685378
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783031685378
Quantità: 2 disponibili
Immagini fornite dal venditore
Category Theory Using Haskell : An Introduction with Moggi and Yoneda
Editore:
Springer Nature Switzerland, Springer Nature Switzerland, 2024
ISBN 10: 3031685377
ISBN 13: 9783031685378
Nuovo
Rilegato
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783031685378
Quantità: 1 disponibili
Immagini fornite dal venditore
Category Theory Using Haskell
ISBN 10: 3031685377
ISBN 13: 9783031685378
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 312 pp. Englisch. Codice articolo 9783031685378
Quantità: 2 disponibili
Foto dell'editore
Category Theory Using Haskell: An Introduction with Moggi and Yoneda (Computer Science Foundations and Applied Logic)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9783031685378
Quantità: Più di 20 disponibili
Foto dell'editore
Category Theory Using Haskell: An Introduction with Moggi and Yoneda (Computer Science Foundations and Applied Logic)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783031685378_new
Quantità: Più di 20 disponibili
Foto dell'editore
Category Theory Using Haskell (Hardcover)
Editore:
Birkhauser Verlag AG, Basel, 2024
ISBN 10: 3031685377
ISBN 13: 9783031685378
Nuovo
Rilegato
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9783031685378
Quantità: 1 disponibili
Foto dell'editore
Category Theory Using Haskell: An Introduction with Moggi and Yoneda
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo 26401517839
Quantità: 4 disponibili
Foto dell'editore
Category Theory Using Haskell (Hardcover)
Editore:
Birkhauser Verlag AG, Basel, 2024
ISBN 10: 3031685377
ISBN 13: 9783031685378
Nuovo
Rilegato
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Codice articolo 9783031685378
Quantità: 1 disponibili
Foto dell'editore
Category Theory Using Haskell (Hardcover)
Editore:
Birkhauser Verlag AG, Basel, 2024
ISBN 10: 3031685377
ISBN 13: 9783031685378
Nuovo
Rilegato
Da: Grand Eagle Retail, Mason, OH, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9783031685378
Quantità: 1 disponibili