category theory using haskell von yukita shuichi (13 Ergebnisse)

Buch. Zustand: 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.

Buch. Zustand: 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.

Zustand: New. In.

Zustand: New.

Hardcover. Zustand: 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.

Hardcover. Zustand: 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.

Zustand: New.

Hardcover. Zustand: 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.

Hardcover. Zustand: Brand New. 308 pages. 9.25x6.10x9.25 inches. In Stock.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt.

Buch. Zustand: 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.

Zustand: New. Print on Demand.

Zustand: New. PRINT ON DEMAND.