東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Category theory using Haskell = an i...

Yukita, Shuichi.

Linked to FindBook

Google Book

Amazon

博客來

Category theory using Haskell = an introduction with Moggi and Yoneda /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Category theory using Haskell/ by Shuichi Yukita.
Reminder of title:	an introduction with Moggi and Yoneda /
Author:	Yukita, Shuichi.
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	xi, 297 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	1. Catetory, Functor, Natural Transformation -- 2. Equivalence of categories -- 3. Universality and Limits -- 4. Functors and Limits -- 5. Adjoints -- 6. Monads -- 7. Representable Functors.
Contained By:	Springer Nature eBook
Subject:	Categories (Mathematics) -
Online resource:	https://doi.org/10.1007/978-3-031-68538-5
ISBN:	9783031685385

Category theory using Haskell = an introduction with Moggi and Yoneda /
Yukita, Shuichi.

Category theory using Haskellan introduction with Moggi and Yoneda /[electronic resource] :by Shuichi Yukita. - Cham :Springer Nature Switzerland :2025. - xi, 297 p. :ill. (some col.), digital ;24 cm. - Computer science foundations and applied logic,2731-5762. - Computer science foundations and applied logic..

1. Catetory, Functor, Natural Transformation -- 2. Equivalence of categories -- 3. Universality and Limits -- 4. Functors and Limits -- 5. Adjoints -- 6. Monads -- 7. Representable Functors.

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.

ISBN: 9783031685385

Standard No.: 10.1007/978-3-031-68538-5doiSubjects--Topical Terms:

525955
Categories (Mathematics)

LC Class. No.: QA76.9.M35 / Y85 2025

Dewey Class. No.: 004.0151

Category theory using Haskell = an introduction with Moggi and Yoneda /
LDR:02888nmm a2200337 a 4500 001 2407768
003 DE-He213
005 20241207115230.0
006 m o d
007 cr nn 008maaau
008 260204s2025 sz s 0 eng d
020 $a 9783031685385 $q (electronic bk.)
020 $a 9783031685378 $q (paper)
024 7 $a 10.1007/978-3-031-68538-5 $2 doi
035 $a 978-3-031-68538-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35 $b Y85 2025
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b Y94 2025
100 1 $a Yukita, Shuichi. $3 3779800
245 1 0 $a Category theory using Haskell $h [electronic resource] : $b an introduction with Moggi and Yoneda / $c by Shuichi Yukita.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Birkhäuser, $c 2025.
300 $a xi, 297 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Computer science foundations and applied logic, $x 2731-5762
505 0 $a 1. Catetory, Functor, Natural Transformation -- 2. Equivalence of categories -- 3. Universality and Limits -- 4. Functors and Limits -- 5. Adjoints -- 6. Monads -- 7. Representable Functors.
520 $a 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.
650 0 $a Categories (Mathematics) $3 525955
650 0 $a Haskell (Computer program language) $3 913448
650 0 $a Computer science $x Mathematics. $3 532725
650 1 4 $a Computer Science Logic and Foundations of Programming. $3 3538531
650 2 4 $a Category Theory, Homological Algebra. $3 899944
650 2 4 $a Programming Techniques. $3 892496
650 2 4 $a Algebraic Topology. $3 891269
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Computer science foundations and applied logic. $3 3625395
856 4 0 $u https://doi.org/10.1007/978-3-031-68538-5
950 $a Computer Science (SpringerNature-11645)