The Yoneda Lemma | Bartosz Milewski's Programming Cafe

This is part 15 of Categories for Programmers. Previously: Representable Functors. See the Table of Contents. Most constructions in category theory are generalizations of results from other more sp…

The Yoneda Lemma | Bartosz Milewski's Programming Cafe Home About Bartosz Milewski's Programming Cafe Category Theory, Haskell, Concurrency, C++ September 1, 2015 The Yoneda Lemma Posted by Bartosz Milewski under Category Theory , Haskell , Programming [30] Comments This is part 15 of Categories for Programmers. Previously: Representable Functors . See the Table of Contents . Most constructions in category theory are generalizations of results from other more specific areas of mathematics. Things like products, coproducts, monoids, exponentials, etc., have been known long before cate

related reading

• Yoneda lemma - Wikipediaen.wikipedia.org
• Category Theory on Math3mamath3ma.com
• Bartosz Milewski's Programming Cafe | Category Theory, Haskell, Concurrency, C++bartoszmilewski.com
• A Neighborhood of Infinity: Reverse Engineering Machines with the Yoneda Lemmablog.sigfpe.com
• Representable Functors | Bartosz Milewski's Programming Cafebartoszmilewski.com
• Natural Transformations | Bartosz Milewski's Programming Cafebartoszmilewski.com
• Adjunctions | Bartosz Milewski's Programming Cafebartoszmilewski.com
• Functor - Wikipediaen.wikipedia.org
• 4. Sets and Functions - Mathematics in Lean v4.19.0 documentationleanprover-community.github.io
• Infinity Category Theory Offers a Bird's-Eye View of Mathematics | Scientific Americanscientificamerican.com
• Thinking Categoricallyderangedmathematician.substack.com
• What is Category Theory Anyway?math3ma.com