|
You are here |
bartoszmilewski.com | ||
| | | | |
www.jeremykun.com
|
|
| | | | | Previously in this series we've seen the definition of a category and a bunch of examples, basic properties of morphisms, and a first look at how to represent categories as types in ML. In this post we'll expand these ideas and introduce the notion of a universal property. We'll see examples from mathematics and write some programs which simultaneously prove certain objects have universal properties and construct the morphisms involved. | |
| | | | |
cronokirby.com
|
|
| | | | | - Read more: https://cronokirby.com/posts/2020/10/categorical-graphs/ | |
| | | | |
degoes.net
|
|
| | | | | Functional programming has a bit of jargon, but that doesn't have to stop you from understanding core concepts | |
| | | | |
dominiczypen.wordpress.com
|
|
| | | Suppose you want to have a graph $latex G = (V,E)$ with chromatic number $latex \chi(G)$ equaling some value $latex k$, such that $latex G$ is minimal with this property. So you end up with a $latex k$-(vertex-)critical graph. It is easy to construct critical graphs by starting with some easy-to-verify example like $latex C_5$... | ||