Adjunctions | Bartosz Milewski's Programming Cafe

This is part 18 of Categories for Programmers. Previously: It’s All About Morphisms. See the Table of Contents. In mathematics we have various ways of saying that one thing is like another. T…

Adjunctions | Bartosz Milewski's Programming Cafe Home About Bartosz Milewski's Programming Cafe Category Theory, Haskell, Concurrency, C++ April 18, 2016 Adjunctions Posted by Bartosz Milewski under Category Theory , Functional Programming , Haskell , Programming [56] Comments This is part 18 of Categories for Programmers. Previously: It’s All About Morphisms . See the Table of Contents . In mathematics we have various ways of saying that one thing is like another. The strictest is equality. Two things are equal if there is no way to distinguish one from another. One can be su

related reading

• Bartosz Milewski's Programming Cafe | Category Theory, Haskell, Concurrency, C++bartoszmilewski.com
• Category Theory on Math3mamath3ma.com
• Thinking Categoricallyderangedmathematician.substack.com
• Natural Transformations | Bartosz Milewski's Programming Cafebartoszmilewski.com
• Universal property - Wikipediaen.wikipedia.org
• The Yoneda Lemma | Bartosz Milewski's Programming Cafebartoszmilewski.com
• What is Category Theory Anyway?math3ma.com
• Representable Functors | Bartosz Milewski's Programming Cafebartoszmilewski.com
• Functor - Wikipediaen.wikipedia.org
• Introducing Categories || Math ∩ Programmingjeremykun.com
• Category theory - Wikipediaen.wikipedia.org
• Infinity Category Theory Offers a Bird's-Eye View of Mathematics | Scientific Americanscientificamerican.com