✳flâneur — a map of the web's best reading

Adjunctions | Bartosz Milewski's Programming Cafe

bartoszmilewski.com · 7,868 words · saved by 1 readers

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

Explore this link on the map →

related reading