initial commit see my ykeynote repo for history
This commit is contained in:
commit
60135c8697
1119
categories.html
Normal file
1119
categories.html
Normal file
File diff suppressed because it is too large
Load diff
BIN
categories.pdf
Normal file
BIN
categories.pdf
Normal file
Binary file not shown.
16
categories/10_Introduction/010_.html
Normal file
16
categories/10_Introduction/010_.html
Normal file
|
@ -0,0 +1,16 @@
|
|||
<div style="text-align:center; position:absolute; top: 2em; font-size: .9em; width: 100%">
|
||||
<h1 style="position: relative;">Category Theory & Programming</h1>
|
||||
<author><em class="base01">by</em> Yann Esposito</author>
|
||||
<div style="font-size:.5em">
|
||||
<twitter>
|
||||
<a href="http://twitter.com/yogsototh">@yogsototh</a>,
|
||||
</twitter>
|
||||
<googleplus>
|
||||
<a href="https://plus.google.com/117858550730178181663">+yogsototh</a>
|
||||
</googleplus>
|
||||
</div>
|
||||
<div class="base01" style="font-size: .5em; font-weight: 400; font-variant:italic">
|
||||
<div class="button" style="margin: .5em auto;border: solid 2px; padding: 5px; width: 8em; border-radius: 1em; background:rgba(255,255,255,0.05);" onclick="javascript:gofullscreen();">ENTER FULLSCREEN</div>
|
||||
HTML presentation: use arrows, space to navigate.
|
||||
</div>
|
||||
</div>
|
6
categories/10_Introduction/020_Plan.html
Normal file
6
categories/10_Introduction/020_Plan.html
Normal file
|
@ -0,0 +1,6 @@
|
|||
<h2>Plan</h2>
|
||||
<ul style="font-size: 2em; font-weight:bold">
|
||||
<li><span class="yellow">General overview</li>
|
||||
<li>Definitions</li>
|
||||
<li>Applications</li>
|
||||
</ul>
|
16
categories/10_Introduction/030_General_Overview.html
Normal file
16
categories/10_Introduction/030_General_Overview.html
Normal file
|
@ -0,0 +1,16 @@
|
|||
<h2 id="general-overview">General Overview</h2>
|
||||
<div style="float:right; width: 18%">
|
||||
<img src="categories/img/eilenberg.gif" alt="Samuel Eilenberg"/> <img src="categories/img/maclaine.jpg" alt="Saunders Mac Lane"/>
|
||||
</div>
|
||||
|
||||
<p><em>Recent Math Field</em><br />1942-45, Samuel Eilenberg & Saunders Mac Lane</p>
|
||||
<p>Certainly one of the more abstract branches of math</p>
|
||||
<ul>
|
||||
<li><em>New math foundation</em><br /> formalism abstraction, package entire theory<sup>★</sup></li>
|
||||
<li><em>Bridge between disciplines</em><br /> Physics, Quantum Physics, Topology, Logic, Computer Science<sup>☆</sup></li>
|
||||
</ul>
|
||||
<p class="smaller base01" style="border-top: solid 1px">
|
||||
★: <a href="http://www.math.harvard.edu/~mazur/preprints/when_is_one.pd">When is one thing equal to some other thing?, Barry Mazur, 2007</a><br/> ☆: <a href="http://math.ucr.edu/home/baez/rosetta.pdf">Physics, Topology, Logic and Computation: A Rosetta Stone, John C. Baez, Mike Stay, 2009</a>
|
||||
</p>
|
||||
|
||||
|
20
categories/10_Introduction/030_General_Overview.md
Normal file
20
categories/10_Introduction/030_General_Overview.md
Normal file
|
@ -0,0 +1,20 @@
|
|||
General Overview
|
||||
----------------
|
||||
|
||||
<div style="float:right; width: 18%">
|
||||
<img src="categories/img/eilenberg.gif" alt="Samuel Eilenberg"/>
|
||||
<img src="categories/img/maclaine.jpg" alt="Saunders Mac Lane"/>
|
||||
</div>
|
||||
|
||||
_Recent Math Field_
|
||||
1942-45, Samuel Eilenberg & Saunders Mac Lane
|
||||
|
||||
Certainly one of the more abstract branches of math
|
||||
|
||||
- _New math foundation_
|
||||
formalism abstraction, package entire theory<sup>★</sup>
|
||||
- _Bridge between disciplines_
|
||||
Physics, Quantum Physics, Topology, Logic, Computer Science<sup>☆</sup>
|
||||
|
||||
<p class="smaller base01" style="border-top: solid 1px">★: <a href="http://www.math.harvard.edu/~mazur/preprints/when_is_one.pd">When is one thing equal to some other thing?, Barry Mazur, 2007</a><br/>
|
||||
☆: <a href="http://math.ucr.edu/home/baez/rosetta.pdf">Physics, Topology, Logic and Computation: A Rosetta Stone, John C. Baez, Mike Stay, 2009</a></p>
|
|
@ -0,0 +1,4 @@
|
|||
<h2 id="from-a-programmer-perspective">From a Programmer perspective</h2>
|
||||
<blockquote>
|
||||
<p>Category Theory is a new language/framework for Math</p>
|
||||
</blockquote>
|
|
@ -0,0 +1,4 @@
|
|||
From a Programmer perspective
|
||||
----------------
|
||||
|
||||
> Category Theory is a new language/framework for Math
|
|
@ -0,0 +1,5 @@
|
|||
<h2 id="math-programming-relation">Math Programming relation</h2>
|
||||
<img class="right" src="categories/img/buddha.gif" alt="Buddha Fractal"/>
|
||||
<p>Programming <em><span class="yellow">is</span></em> doing Math</p>
|
||||
<p>Not convinced?<br />Certainly a <em>vocabulary</em> problem.</p>
|
||||
<p>One of the goal of Category Theory is to create a <em>homogeneous vocabulary</em> between different disciplines.</p>
|
11
categories/10_Introduction/050_Math_Programming_relation.md
Normal file
11
categories/10_Introduction/050_Math_Programming_relation.md
Normal file
|
@ -0,0 +1,11 @@
|
|||
Math Programming relation
|
||||
-------------------------
|
||||
|
||||
<img class="right" src="categories/img/buddha.gif" alt="Buddha Fractal"/>
|
||||
|
||||
Programming *<span class="yellow">is</span>* doing Math
|
||||
|
||||
Not convinced?
|
||||
Certainly a _vocabulary_ problem.
|
||||
|
||||
One of the goal of Category Theory is to create a _homogeneous vocabulary_ between different disciplines.
|
6
categories/10_Introduction/060_Vocabulary.html
Normal file
6
categories/10_Introduction/060_Vocabulary.html
Normal file
|
@ -0,0 +1,6 @@
|
|||
<h2 id="vocabulary">Vocabulary</h2>
|
||||
<img class="right" src="categories/img/mindblown.gif" alt="mind blown"/>
|
||||
<p>Math vocabulary used in this presentation:</p>
|
||||
<blockquote>
|
||||
<p>Category, Morphism, Associativity, Preorder, Functor, Endofunctor, Categorial property, Commutative diagram, Isomorph, Initial, Dual, Monoid, Natural transformation, Monad, Klesli arrows, κατα-morphism, ...</p>
|
||||
</blockquote>
|
23
categories/10_Introduction/060_Vocabulary.md
Normal file
23
categories/10_Introduction/060_Vocabulary.md
Normal file
|
@ -0,0 +1,23 @@
|
|||
Vocabulary
|
||||
----------
|
||||
|
||||
<img class="right" src="categories/img/mindblown.gif" alt="mind blown"/>
|
||||
|
||||
Math vocabulary used in this presentation:
|
||||
|
||||
> Category,
|
||||
> Morphism,
|
||||
> Associativity,
|
||||
> Preorder,
|
||||
> Functor, Endofunctor,
|
||||
> Categorial property,
|
||||
> Commutative diagram,
|
||||
> Isomorph,
|
||||
> Initial,
|
||||
> Dual,
|
||||
> Monoid,
|
||||
> Natural transformation,
|
||||
> Monad,
|
||||
> Klesli arrows,
|
||||
> κατα-morphism,
|
||||
> ...
|
41
categories/10_Introduction/070_Programmer_Translation.html
Normal file
41
categories/10_Introduction/070_Programmer_Translation.html
Normal file
|
@ -0,0 +1,41 @@
|
|||
<h2 id="programmer-translation">Programmer Translation</h2>
|
||||
<img class="right" src="categories/img/readingcat.jpg" alt="lolcat"/>
|
||||
<table style="width:60%">
|
||||
<tr><th>
|
||||
Mathematician
|
||||
</th><th>
|
||||
Programmer
|
||||
</th></tr>
|
||||
<tr><td>
|
||||
Morphism
|
||||
</td><td>
|
||||
Arrow
|
||||
</td></tr>
|
||||
<tr><td>
|
||||
Monoid
|
||||
</td><td>
|
||||
String-like
|
||||
</td></tr>
|
||||
<tr><td>
|
||||
Preorder
|
||||
</td><td>
|
||||
Acyclic graph
|
||||
</td></tr>
|
||||
<tr><td>
|
||||
Isomorph
|
||||
</td><td>
|
||||
The same
|
||||
</td></tr>
|
||||
<tr><td>
|
||||
Natural transformation
|
||||
</td><td>
|
||||
rearrangement function
|
||||
</td></tr>
|
||||
<tr><td>
|
||||
Funny Category
|
||||
</td><td>
|
||||
LOLCat
|
||||
</td></tr>
|
||||
</table>
|
||||
|
||||
|
14
categories/10_Introduction/070_Programmer_Translation.md
Normal file
14
categories/10_Introduction/070_Programmer_Translation.md
Normal file
|
@ -0,0 +1,14 @@
|
|||
Programmer Translation
|
||||
----------------------
|
||||
|
||||
<img class="right" src="categories/img/readingcat.jpg" alt="lolcat"/>
|
||||
|
||||
<table style="width:60%">
|
||||
<tr><th>Mathematician</th><th>Programmer</th></tr>
|
||||
<tr><td>Morphism</td><td>Arrow</td></tr>
|
||||
<tr><td>Monoid</td><td>String-like</td></tr>
|
||||
<tr><td>Preorder</td><td>Acyclic graph</td></tr>
|
||||
<tr><td>Isomorph</td><td>The same</td></tr>
|
||||
<tr><td>Natural transformation</td><td>rearrangement function</td></tr>
|
||||
<tr><td>Funny Category</td><td>LOLCat</td></tr>
|
||||
</table>
|
14
categories/20_What/010_Plan.html
Normal file
14
categories/20_What/010_Plan.html
Normal file
|
@ -0,0 +1,14 @@
|
|||
<h2>Plan</h2>
|
||||
<ul style="font-size: 2em; font-weight: bold">
|
||||
<li>General overview</li>
|
||||
<li> <span class="yellow">Definitions</span>
|
||||
<ul class="base01" style="border-left: 2px solid; padding-left: 1em; font-size: .6em; float: right; font-weight: bold; margin: 0 0 0 1em">
|
||||
<li>Category</li>
|
||||
<li>Intuition</li>
|
||||
<li>Examples</li>
|
||||
<li>Functor</li>
|
||||
<li>Examples</li>
|
||||
</ul>
|
||||
</li>
|
||||
<li>Applications</li>
|
||||
</ul>
|
11
categories/20_What/020_Category.html
Normal file
11
categories/20_What/020_Category.html
Normal file
|
@ -0,0 +1,11 @@
|
|||
<h2>Category</h2>
|
||||
|
||||
<p>A way of representing <strong><em>things</em></strong> and <strong><em>ways to go between things</em></strong>.</p>
|
||||
|
||||
<p> A Category \(\mathcal{C}\) is defined by:</p>
|
||||
<ul>
|
||||
<li> <em>Objects <span class="yellow">\(\ob{C}\)</span></em>,</li>
|
||||
<li> <em>Morphisms <span class="yellow">\(\hom{C}\)</span></em>,</li>
|
||||
<li> a <em>Composition law <span class="yellow">(∘)</span></em></li>
|
||||
<li> obeying some <em>Properties</em>.</li>
|
||||
</ul>
|
5
categories/20_What/030_Category_Objects.html
Normal file
5
categories/20_What/030_Category_Objects.html
Normal file
|
@ -0,0 +1,5 @@
|
|||
<h2>Category: Objects</h2>
|
||||
|
||||
<img src="categories/img/mp/objects.png" alt="objects" />
|
||||
|
||||
<p>\(\ob{\mathcal{C}}\) is a collection</p>
|
8
categories/20_What/040_Category_Morphisms.html
Normal file
8
categories/20_What/040_Category_Morphisms.html
Normal file
|
@ -0,0 +1,8 @@
|
|||
<h2>Category: Morphisms</h2>
|
||||
|
||||
<img src="categories/img/mp/morphisms.png" alt="morphisms"/>
|
||||
|
||||
<p>\(A\) and \(B\) objects of \(\C\)<br/>
|
||||
\(\hom{A,B}\) is a collection of morphisms<br/>
|
||||
\(f:A→B\) denote the fact \(f\) belongs to \(\hom{A,B}\)</p>
|
||||
<p>\(\hom{\C}\) the collection of all morphisms of \(\C\)</p>
|
5
categories/20_What/050_Category_Composition.html
Normal file
5
categories/20_What/050_Category_Composition.html
Normal file
|
@ -0,0 +1,5 @@
|
|||
<h2>Category: Composition</h2>
|
||||
<p>Composition (∘): associate to each couple \(f:A→B, g:B→C\)
|
||||
$$g∘f:A\rightarrow C$$
|
||||
</p>
|
||||
<img src="categories/img/mp/composition.png" alt="composition"/>
|
|
@ -0,0 +1,4 @@
|
|||
<h2>Category laws: neutral element</h2>
|
||||
<p>for each object \(X\), there is an \(\id_X:X→X\),<br/>
|
||||
such that for each \(f:A→B\):</p>
|
||||
<img src="categories/img/mp/identity.png" alt="identity"/>
|
3
categories/20_What/070_Category_laws_Associativity.html
Normal file
3
categories/20_What/070_Category_laws_Associativity.html
Normal file
|
@ -0,0 +1,3 @@
|
|||
<h2>Category laws: Associativity</h2>
|
||||
<p> Composition is associative:</p>
|
||||
<img src="categories/img/mp/associativecomposition.png" alt="associative composition"/>
|
19
categories/20_What/080_Commutative_diagrams.html
Normal file
19
categories/20_What/080_Commutative_diagrams.html
Normal file
|
@ -0,0 +1,19 @@
|
|||
<h2>Commutative diagrams</h2>
|
||||
|
||||
<p>Two path with the same source and destination are equal.</p>
|
||||
<figure class="left" style="max-width: 40%;margin-left: 10%;">
|
||||
<img
|
||||
src="categories/img/mp/commutative-diagram-assoc.png"
|
||||
alt="Commutative Diagram (Associativity)"/>
|
||||
<figcaption>
|
||||
\((h∘g)∘f = h∘(g∘f) \)
|
||||
</figcaption>
|
||||
</figure>
|
||||
<figure class="right" style="max-width:31%;margin-right: 10%;">
|
||||
<img
|
||||
src="categories/img/mp/commutative-diagram-id.png"
|
||||
alt="Commutative Diagram (Identity law)"/>
|
||||
<figcaption>
|
||||
\(id_B∘f = f = f∘id_A \)
|
||||
</figcaption>
|
||||
</figure>
|
8
categories/20_What/090_Question_Time.html
Normal file
8
categories/20_What/090_Question_Time.html
Normal file
|
@ -0,0 +1,8 @@
|
|||
<h2>Question Time!</h2>
|
||||
|
||||
<figure style="width:70%; margin:0 auto">
|
||||
<img src="categories/img/batquestion.jpg" width="100%"/>
|
||||
<figcaption>
|
||||
<em>- French-only joke -</em>
|
||||
</figcaption>
|
||||
</figure>
|
21
categories/20_What/100_Can_this_be_a_category.html
Normal file
21
categories/20_What/100_Can_this_be_a_category.html
Normal file
|
@ -0,0 +1,21 @@
|
|||
<h2>Can this be a category?</h2>
|
||||
<p>\(\ob{\C},\hom{\C}\) fixed, is there a valid ∘?</p>
|
||||
<figure class="left">
|
||||
<img src="categories/img/mp/cat-example1.png" alt="Category example 1"/>
|
||||
<figcaption class="slide">
|
||||
<span class="green">YES</span>
|
||||
</figcaption>
|
||||
</figure>
|
||||
<figure class="left">
|
||||
<img src="categories/img/mp/cat-example2.png" alt="Category example 2"/>
|
||||
<figcaption class="slide">
|
||||
no candidate for \(g∘f\)
|
||||
<br/><span class="red">NO</span>
|
||||
</figcaption>
|
||||
</figure>
|
||||
<figure class="left">
|
||||
<img src="categories/img/mp/cat-example3.png" alt="Category example 3"/>
|
||||
<figcaption class="slide">
|
||||
<span class="green">YES</span>
|
||||
</figcaption>
|
||||
</figure>
|
17
categories/20_What/110_Can_this_be_a_category.html
Normal file
17
categories/20_What/110_Can_this_be_a_category.html
Normal file
|
@ -0,0 +1,17 @@
|
|||
<h2>Can this be a category?</h2>
|
||||
<figure class="left">
|
||||
<img src="categories/img/mp/cat-example4.png" alt="Category example 4"/>
|
||||
<figcaption class="slide">
|
||||
no candidate for \(f:C→B\)
|
||||
<br/><span class="red">NO</span>
|
||||
</figcaption>
|
||||
</figure>
|
||||
<figure class="right" style="min-width: 59%">
|
||||
<img src="categories/img/mp/cat-example5.png" alt="Category example 5"/>
|
||||
<figcaption class="slide">
|
||||
\((h∘g)∘f=\id_B∘f=f\)<br/>
|
||||
\(h∘(g∘f)=h∘\id_A=h\)<br/>
|
||||
but \(h≠f\)<br/>
|
||||
<span class="red">NO</span>
|
||||
</figcaption>
|
||||
</figure>
|
8
categories/20_What/120_Categories_Examples.html
Normal file
8
categories/20_What/120_Categories_Examples.html
Normal file
|
@ -0,0 +1,8 @@
|
|||
<h2>Categories Examples</h2>
|
||||
|
||||
<figure style="width:70%; margin:0 auto">
|
||||
<img src="categories/img/basket_of_cats.jpg" alt="Basket of cats"/>
|
||||
<figcaption>
|
||||
<em>- Basket of Cats -</em>
|
||||
</figcaption>
|
||||
</figure>
|
13
categories/20_What/130_Category_Set.html
Normal file
13
categories/20_What/130_Category_Set.html
Normal file
|
@ -0,0 +1,13 @@
|
|||
<h2>Category \(\Set\)</h2>
|
||||
|
||||
<ul>
|
||||
<li> \(\ob{\Set}\) are <em>all</em> the sets</li>
|
||||
<li> \(\hom{E,F}\) are <em>all</em> functions from \(E\) to \(F\)</li>
|
||||
<li> ∘ is functions composition </li>
|
||||
</ul>
|
||||
|
||||
<ul class="slide">
|
||||
<li>\(\ob{\Set}\) is a proper class ; not a set</li>
|
||||
<li>\(\hom{E,F}\) is a set</li>
|
||||
<li>\(\Set\) is then a <em>locally <b>small</b> category</em></li>
|
||||
</ul>
|
11
categories/20_What/140_Categories_Everywhere.html
Normal file
11
categories/20_What/140_Categories_Everywhere.html
Normal file
|
@ -0,0 +1,11 @@
|
|||
<h2>Categories Everywhere?</h2>
|
||||
<img class="right" src="categories/img/cats-everywhere.jpg" alt="Cats everywhere"/>
|
||||
<ul>
|
||||
<li>\(\Mon\): (monoids, monoid morphisms,∘)</li>
|
||||
<li>\(\Vec\): (Vectorial spaces, linear functions,∘)</li>
|
||||
<li>\(\Grp\): (groups, group morphisms,∘)</li>
|
||||
<li>\(\Rng\): (rings, ring morphisms,∘)</li>
|
||||
<li>Any deductive system <i>T</i>: (theorems, proofs, proof concatenation)</li>
|
||||
<li>\( \Hask\): (Haskell types, functions, <code>(.)</code> )</li>
|
||||
<li>...</li>
|
||||
</ul>
|
13
categories/20_What/150_Smaller_Examples.html
Normal file
13
categories/20_What/150_Smaller_Examples.html
Normal file
|
@ -0,0 +1,13 @@
|
|||
<h2>Smaller Examples</h2>
|
||||
|
||||
<h3>Strings</h3>
|
||||
<img class="right" style="max-width:17%" src="categories/img/mp/strings.png" alt="Monoids are one object categories"/>
|
||||
<ul>
|
||||
<li> \(\ob{Str}\) is a singleton </li>
|
||||
<li> \(\hom{Str}\) each string </li>
|
||||
<li> ∘ is concatenation <code>(++)</code> </li>
|
||||
</ul>
|
||||
<ul>
|
||||
<li> <code>"" ++ u = u = u ++ ""</code> </li>
|
||||
<li> <code>(u ++ v) ++ w = u ++ (v ++ w)</code> </li>
|
||||
</ul>
|
15
categories/20_What/160_Finite_Example.html
Normal file
15
categories/20_What/160_Finite_Example.html
Normal file
|
@ -0,0 +1,15 @@
|
|||
<h2>Finite Example?</h2>
|
||||
|
||||
<h3>Graph</h3>
|
||||
<figure class="right" style="max-width:40%" >
|
||||
<img src="categories/img/mp/graph-category.png" alt="Each graph is a category"/>
|
||||
</figure>
|
||||
<ul>
|
||||
<li> \(\ob{G}\) are vertices</li>
|
||||
<li> \(\hom{G}\) each path</li>
|
||||
<li> ∘ is path concatenation</li>
|
||||
</ul>
|
||||
<ul><li>\(\ob{G}=\{X,Y,Z\}\),
|
||||
</li><li>\(\hom{G}=\{ε,α,β,γ,αβ,βγ,...\}\)
|
||||
</li><li>\(αβ∘γ=αβγ\)
|
||||
</li></ul>
|
4
categories/20_What/170_Number_construction.html
Normal file
4
categories/20_What/170_Number_construction.html
Normal file
|
@ -0,0 +1,4 @@
|
|||
<h2>Number construction</h2>
|
||||
|
||||
<h3>Each Numbers as a whole category</h3>
|
||||
<img src="categories/img/mp/numbers.png" alt="Each number as a category"/>
|
|
@ -0,0 +1,9 @@
|
|||
<h2>Degenerated Categories: Monoids</h2>
|
||||
|
||||
<img class="right" style="max-width:17%" src="categories/img/mp/monoid.png" alt="Monoids are one object categories"/>
|
||||
<p>Each Monoid \((M,e,⊙): \ob{M}=\{∙\},\hom{M}=M,\circ = ⊙\)</p>
|
||||
<p class="yellow">Only one object.</p>
|
||||
<p>Examples:</p>
|
||||
<ul><li><code>(Integer,0,+)</code>, <code>(Integer,1,*)</code>,
|
||||
</li><li><code>(Strings,"",++)</code>, for each <code>a</code>, <code>([a],[],++)</code>
|
||||
</li></ul>
|
|
@ -0,0 +1,10 @@
|
|||
<h2>Degenerated Categories: Preorders \((P,≤)\)</h2>
|
||||
|
||||
<ul><li>\(\ob{P}={P}\),
|
||||
</li><li>\(\hom{x,y}=\{x≤y\} ⇔ x≤y\),
|
||||
</li><li>\((y≤z) \circ (x≤y) = (x≤z) \)
|
||||
</li></ul>
|
||||
|
||||
<p><em class="yellow">At most one morphism between two objects.</em></p>
|
||||
|
||||
<img src="categories/img/mp/preorder.png" alt="preorder category"/>
|
|
@ -0,0 +1,6 @@
|
|||
<h2>Degenerated Categories: Discrete Categories</h2>
|
||||
|
||||
<img class="right" src="categories/img/mp/set.png" alt="Any set can be a category"/>
|
||||
<h3>Any Set</h3>
|
||||
<p>Any set \(E: \ob{E}=E, \hom{x,y}=\{x\} ⇔ x=y \)</p>
|
||||
<p class="yellow">Only identities</p>
|
11
categories/20_What/210_Categorical_Properties.html
Normal file
11
categories/20_What/210_Categorical_Properties.html
Normal file
|
@ -0,0 +1,11 @@
|
|||
<h2 class="base1">Categorical Properties</h2>
|
||||
|
||||
<p class="base1">Any property which can be expressed in term of category, objects, morphism and composition.</p>
|
||||
|
||||
<ul><li> <em class="yellow">Dual</em>: \(\D\) is \(\C\) with reversed morphisms.
|
||||
</li><li> <em class="yellow">Initial</em>: \(Z\in\ob{\C}\) s.t. \(∀Y∈\ob{\C}, \#\hom{Z,Y}=1\)
|
||||
<br/> Unique ("up to isormophism")
|
||||
</li><li> <em class="yellow">Terminal</em>: \(T\in\ob{\C}\) s.t. \(T\) is initial in the dual of \(\C\)
|
||||
</li><li> <em class="yellow">Functor</em>: structure preserving mapping between categories
|
||||
</li><li> ...
|
||||
</li></ul>
|
3
categories/20_What/220_Isomorph.html
Normal file
3
categories/20_What/220_Isomorph.html
Normal file
|
@ -0,0 +1,3 @@
|
|||
<h2 id="isomorph">Isomorph</h2>
|
||||
<p><img class="right" alt="isomorph cats" src="categories/img/isomorph-cats.jpg" /> <em class="yellow">isomorphism</em>: \(f:A→B\) which can be "undone" <em>i.e.</em><br />\(∃g:B→A\), \(g∘f=id_A\) & \(f∘g=id_B\)<br />in this case, \(A\) & \(B\) are <em class="yellow">isomorphic</em>.</p>
|
||||
<p><span class="yellow">A≌B</span> means A and B are essentially the same.<br />In Category Theory, <span class="yellow">=</span> is in fact mostly <span class="yellow">≌</span>.<br />For example in commutative diagrams.</p>
|
11
categories/20_What/220_Isomorph.md
Normal file
11
categories/20_What/220_Isomorph.md
Normal file
|
@ -0,0 +1,11 @@
|
|||
Isomorph
|
||||
--------
|
||||
<img class="right" alt="isomorph cats" src="categories/img/isomorph-cats.jpg" />
|
||||
<em class="yellow">isomorphism</em>:
|
||||
\\(f:A→B\\) which can be "undone" _i.e._
|
||||
\\(∃g:B→A\\), \\(g∘f=id\_A\\) & \\(f∘g=id\_B\\)
|
||||
in this case, \\(A\\) & \\(B\\) are <em class="yellow">isomorphic</em>.
|
||||
|
||||
<span class="yellow">A≌B</span> means A and B are essentially the same.
|
||||
In Category Theory, <span class="yellow">=</span> is in fact mostly <span class="yellow">≌</span>.
|
||||
For example in commutative diagrams.
|
15
categories/20_What/230_Functor.html
Normal file
15
categories/20_What/230_Functor.html
Normal file
|
@ -0,0 +1,15 @@
|
|||
<h2>Functor</h2>
|
||||
|
||||
<p> A functor is a mapping between two categories.
|
||||
Let \(\C\) and \(\D\) be two categories.
|
||||
A <em>functor</em> <span class="yellow">\(\F\)</span> from <span class="blue">\(\C\)</span> to <span class="green">\(\D\)</span>:</p>
|
||||
<ul>
|
||||
<li> Associate objects: <span class="backblue">\(A\in\ob{\C}\)</span> to <span class="backgreen">\(\F(A)\in\ob{\D}\)</span> </li>
|
||||
<li> Associate morphisms: <span class="backblue">\(f:A\to B\)</span> to <span class="backgreen">\(\F(f) : \F(A) \to \F(B)\)</span>
|
||||
such that
|
||||
<ul>
|
||||
<li>\( \F (\)<span class="backblue blue">\(\id_X\)</span>\()= \)<span class="backgreen"><span class="green">\(\id\)</span>\(\vphantom{\id}_{\F(}\)<span class="blue">\(\vphantom{\id}_X\)</span>\(\vphantom{\id}_{)} \)</span>,</li>
|
||||
<li>\( \F (\)<span class="backblue blue">\(g∘f\)</span>\()= \)<span class="backgreen">\( \F(\)<span class="blue">\(g\)</span>\() \)<span class="green">\(\circ\)</span>\( \F(\)<span class="blue">\(f\)</span>\() \)</span></li>
|
||||
</ul>
|
||||
</li>
|
||||
</ul>
|
3
categories/20_What/240_Functor_Example_ob_ob.html
Normal file
3
categories/20_What/240_Functor_Example_ob_ob.html
Normal file
|
@ -0,0 +1,3 @@
|
|||
<h2>Functor Example (ob → ob)</h2>
|
||||
|
||||
<img width="65%" src="categories/img/mp/functor.png" alt="Functor"/>
|
3
categories/20_What/250_Functor_Example_hom_hom.html
Normal file
3
categories/20_What/250_Functor_Example_hom_hom.html
Normal file
|
@ -0,0 +1,3 @@
|
|||
<h2>Functor Example (hom → hom)</h2>
|
||||
|
||||
<img width="65%" src="categories/img/mp/functor-morphism.png" alt="Functor"/>
|
3
categories/20_What/260_Functor_Example.html
Normal file
3
categories/20_What/260_Functor_Example.html
Normal file
|
@ -0,0 +1,3 @@
|
|||
<h2>Functor Example</h2>
|
||||
|
||||
<img width="65%" src="categories/img/mp/functor-morphism-color.png" alt="Functor"/>
|
4
categories/20_What/270_Endofunctors.html
Normal file
4
categories/20_What/270_Endofunctors.html
Normal file
|
@ -0,0 +1,4 @@
|
|||
<h2>Endofunctors</h2>
|
||||
|
||||
<p>An <em>endofunctor</em> for \(\C\) is a functor \(F:\C→\C\).</p>
|
||||
<img width="75%" src="categories/img/mp/endofunctor.png" alt="Endofunctor"/>
|
9
categories/20_What/280_Category_of_Categories.html
Normal file
9
categories/20_What/280_Category_of_Categories.html
Normal file
|
@ -0,0 +1,9 @@
|
|||
<h2>Category of Categories</h2>
|
||||
|
||||
<img style="min-width:43%; width: 43%" class="right" src="categories/img/fractalcat.jpg" />
|
||||
|
||||
<p>Categories and functors form a category: \(\Cat\)</p>
|
||||
<ul><li>\(\ob{\Cat}\) are categories
|
||||
</li><li>\(\hom{\Cat}\) are functors
|
||||
</li><li>∘ is functor composition
|
||||
</li></ul>
|
13
categories/30_How/010_Plan.html
Normal file
13
categories/30_How/010_Plan.html
Normal file
|
@ -0,0 +1,13 @@
|
|||
<h2>Plan</h2>
|
||||
<ul style="font-size: 2em; font-weight:bold">
|
||||
<li>Why?</li>
|
||||
<li>What?</li>
|
||||
<li><span class="yellow">How?
|
||||
<ul class="base01" style="border-left: 2px solid; padding-left: 1em; font-size: .6em; float: right; font-weight: bold; margin: -2em 0 0 1em">
|
||||
<li>\(\Hask\) category
|
||||
</li><li> Functors
|
||||
</li><li> Monads
|
||||
</li><li> κατα-morphisms
|
||||
</li></ul>
|
||||
</li>
|
||||
</ul>
|
15
categories/30_How/020_Hask.html
Normal file
15
categories/30_How/020_Hask.html
Normal file
|
@ -0,0 +1,15 @@
|
|||
<h2>Hask</h2>
|
||||
|
||||
<p>Category \(\Hask\):</p>
|
||||
|
||||
<img class="right" style="max-width:30%" src="categories/img/mp/hask.png" alt="Haskell Category Representation"/>
|
||||
|
||||
<ul><li>
|
||||
\(\ob{\Hask} = \) Haskell types
|
||||
</li><li>
|
||||
\(\hom{\Hask} = \) Haskell functions
|
||||
</li><li>
|
||||
∘ = <code>(.)</code> Haskell function composition
|
||||
</li></ul>
|
||||
|
||||
<p>Forget glitches because of <code>undefined</code>.</p>
|
7
categories/30_How/030_Haskell_Kinds.html
Normal file
7
categories/30_How/030_Haskell_Kinds.html
Normal file
|
@ -0,0 +1,7 @@
|
|||
<h2 id="haskell-kinds">Haskell Kinds</h2>
|
||||
<p>In Haskell some types can take type variable(s). Typically: <code>[a]</code>.</p>
|
||||
<p>Types have <em>kinds</em>; The kind is to type what type is to function. Kind are the types for types (so meta).</p>
|
||||
<pre><code>Int, Char :: *
|
||||
[], Maybe :: * -> *
|
||||
(,) :: * -> * -> *
|
||||
[Int], Maybe Char, Maybe [Int] :: *</code></pre>
|
16
categories/30_How/030_Haskell_Kinds.md
Normal file
16
categories/30_How/030_Haskell_Kinds.md
Normal file
|
@ -0,0 +1,16 @@
|
|||
Haskell Kinds
|
||||
-------------
|
||||
|
||||
In Haskell some types can take type variable(s).
|
||||
Typically: `[a]`.
|
||||
|
||||
Types have _kinds_;
|
||||
The kind is to type what type is to function.
|
||||
Kind are the types for types (so meta).
|
||||
|
||||
~~~
|
||||
Int, Char :: *
|
||||
[], Maybe :: * -> *
|
||||
(,) :: * -> * -> *
|
||||
[Int], Maybe Char, Maybe [Int] :: *
|
||||
~~~
|
15
categories/30_How/040_Haskell_Types.html
Normal file
15
categories/30_How/040_Haskell_Types.html
Normal file
|
@ -0,0 +1,15 @@
|
|||
<h2 id="haskell-types">Haskell Types</h2>
|
||||
<p>Sometimes, the type determine a lot about the function<sup>★</sup>:</p>
|
||||
<pre class="haskell"><code>fst :: (a,b) -> a -- Only one choice
|
||||
snd :: (a,b) -> b -- Only one choice
|
||||
f :: a -> [a] -- Many choices
|
||||
-- Possibilities: f x=[], or [x], or [x,x] or [x,...,x]
|
||||
|
||||
? :: [a] -> [a] -- Many choices
|
||||
-- can only rearrange: duplicate/remove/reorder elements
|
||||
-- for example: the type of addOne isn't [a] -> [a]
|
||||
addOne l = map <span class="red">(+1)</span> l
|
||||
-- The (+1) force 'a' to be a Num.</code></pre>
|
||||
|
||||
<p>
|
||||
<p><span class="small base01">★:<a href="http://ttic.uchicago.edu/~dreyer/course/papers/wadler.pdf">Theorems for free!, Philip Wadler, 1989</a></span></p>
|
17
categories/30_How/040_Haskell_Types.md
Normal file
17
categories/30_How/040_Haskell_Types.md
Normal file
|
@ -0,0 +1,17 @@
|
|||
Haskell Types
|
||||
-------------
|
||||
|
||||
Sometimes, the type determine a lot about the function<sup>★</sup>:
|
||||
|
||||
<pre class="haskell"><code>fst :: (a,b) -> a -- Only one choice
|
||||
snd :: (a,b) -> b -- Only one choice
|
||||
f :: a -> [a] -- Many choices
|
||||
-- Possibilities: f x=[], or [x], or [x,x] or [x,...,x]
|
||||
|
||||
? :: [a] -> [a] -- Many choices
|
||||
-- can only rearrange: duplicate/remove/reorder elements
|
||||
-- for example: the type of addOne isn't [a] -> [a]
|
||||
addOne l = map <span class="red">(+1)</span> l
|
||||
-- The (+1) force 'a' to be a Num.</code></pre>
|
||||
|
||||
<p><span class="small base01">★:<a href="http://ttic.uchicago.edu/~dreyer/course/papers/wadler.pdf">Theorems for free!, Philip Wadler, 1989</a></span>
|
|
@ -0,0 +1,11 @@
|
|||
<h2>Haskell Functor vs \(\Hask\) Functor</h2>
|
||||
|
||||
<p>A Haskell Functor is a type <code>F :: * -> *</code> which belong to the type class <code>Functor</code> ; thus instantiate
|
||||
<code>fmap :: (a -> b) -> (F a -> F b)</code>.
|
||||
|
||||
<p><span style="visibility:hidden">&</span> <code>F</code>: \(\ob{\Hask}→\ob{\Hask}\)<br/> & <code>fmap</code>: \(\hom{\Hask}→\hom{\Hask}\)
|
||||
|
||||
<p>The couple <code>(F,fmap)</code> is a \(\Hask\)'s functor if for any <code>x :: F a</code>:</p>
|
||||
<ul><li><code>fmap id x = x</code>
|
||||
</li><li><code>fmap (f.g) x= (fmap f . fmap g) x</code>
|
||||
</li></ul>
|
|
@ -0,0 +1,10 @@
|
|||
<h2>Haskell Functors Example: Maybe</h2>
|
||||
|
||||
<pre class="haskell"><code>data Maybe a = Just a | Nothing
|
||||
instance Functor Maybe where
|
||||
fmap :: (a -> b) -> (Maybe a -> Maybe b)
|
||||
fmap f (Just a) = Just (f a)
|
||||
fmap f Nothing = Nothing</code></pre>
|
||||
<pre class="haskell"><code>fmap (+1) (Just 1) == Just 2
|
||||
fmap (+1) Nothing == Nothing
|
||||
fmap head (Just [1,2,3]) == Just 1</code></pre>
|
|
@ -0,0 +1,8 @@
|
|||
<h2>Haskell Functors Example: List</h2>
|
||||
|
||||
<pre class="haskell"><code>instance Functor ([]) where
|
||||
fmap :: (a -> b) -> [a] -> [b]
|
||||
fmap = map</pre></code>
|
||||
<pre class="haskell"><code>fmap (+1) [1,2,3] == [2,3,4]
|
||||
fmap (+1) [] == []
|
||||
fmap head [[1,2,3],[4,5,6]] == [1,4]</code></pre>
|
|
@ -0,0 +1,10 @@
|
|||
<h2 id="haskell-functors-for-the-programmer">Haskell Functors for the programmer</h2>
|
||||
<p><code>Functor</code> is a type class used for types that can be mapped over.</p>
|
||||
<ul>
|
||||
<li>Containers: <code>[]</code>, Trees, Map, HashMap...</li>
|
||||
<li>"Feature Type":
|
||||
<ul>
|
||||
<li><code>Maybe a</code>: help to handle absence of <code>a</code>.<br />Ex: <code>safeDiv x 0 ⇒ Nothing</code></li>
|
||||
<li><code>Either String a</code>: help to handle errors<br />Ex: <code>reportDiv x 0 ⇒ Left "Division by 0!"</code></li>
|
||||
</ul></li>
|
||||
</ul>
|
|
@ -0,0 +1,11 @@
|
|||
Haskell Functors for the programmer
|
||||
------------------------------
|
||||
|
||||
`Functor` is a type class used for types that can be mapped over.
|
||||
|
||||
- Containers: `[]`, Trees, Map, HashMap...
|
||||
- "Feature Type":
|
||||
- `Maybe a`: help to handle absence of `a`.
|
||||
Ex: `safeDiv x 0 ⇒ Nothing`
|
||||
- `Either String a`: help to handle errors
|
||||
Ex: `reportDiv x 0 ⇒ Left "Division by 0!"`
|
|
@ -0,0 +1,5 @@
|
|||
<h2>Haskell Functor intuition</h2>
|
||||
|
||||
<p>Put normal function inside a container. Ex: list, trees...<p>
|
||||
|
||||
<img width="70%" src="categories/img/mp/boxfunctor.png" alt="Haskell Functor as a box play"/>
|
|
@ -0,0 +1,7 @@
|
|||
<h2>Haskell Functor properties</h2>
|
||||
|
||||
<p>Haskell Functors are:</p>
|
||||
|
||||
<ul><li><em>endofunctors</em> ; \(F:\C→\C\) here \(\C = \Hask\),
|
||||
</li><li>a couple <b>(Object,Morphism)</b> in \(\Hask\).
|
||||
</li></ul>
|
6
categories/30_How/100_Functors/070_Functor_as_boxes.html
Normal file
6
categories/30_How/100_Functors/070_Functor_as_boxes.html
Normal file
|
@ -0,0 +1,6 @@
|
|||
<h2>Functor as boxes</h2>
|
||||
|
||||
<p>Haskell functor can be seen as boxes containing all Haskell types and functions.
|
||||
Haskell types is fractal:</p>
|
||||
|
||||
<img width="70%" src="categories/img/mp/hask-endofunctor.png" alt="Haskell functor representation"/>
|
6
categories/30_How/100_Functors/080_Functor_as_boxes.html
Normal file
6
categories/30_How/100_Functors/080_Functor_as_boxes.html
Normal file
|
@ -0,0 +1,6 @@
|
|||
<h2>Functor as boxes</h2>
|
||||
|
||||
<p>Haskell functor can be seen as boxes containing all Haskell types and functions.
|
||||
Haskell types is fractal:</p>
|
||||
|
||||
<img width="70%" src="categories/img/mp/hask-endofunctor-objects.png" alt="Haskell functor representation"/>
|
6
categories/30_How/100_Functors/090_Functor_as_boxes.html
Normal file
6
categories/30_How/100_Functors/090_Functor_as_boxes.html
Normal file
|
@ -0,0 +1,6 @@
|
|||
<h2>Functor as boxes</h2>
|
||||
|
||||
<p>Haskell functor can be seen as boxes containing all Haskell types and functions.
|
||||
Haskell types is fractal:</p>
|
||||
|
||||
<img width="70%" src="categories/img/mp/hask-endofunctor-morphisms.png" alt="Haskell functor representation"/>
|
|
@ -0,0 +1,11 @@
|
|||
<h2 id="non-haskell-hasks-functors">"Non Haskell" Hask's Functors</h2>
|
||||
<p>A simple basic example is the \(id_\Hask\) functor. It simply cannot be expressed as a couple (<code>F</code>,<code>fmap</code>) where</p>
|
||||
<ul>
|
||||
<li><code>F::* -> *</code></li>
|
||||
<li><code>fmap :: (a -> b) -> (F a) -> (F b)</code></li>
|
||||
</ul>
|
||||
<p>Another example:</p>
|
||||
<ul>
|
||||
<li>F(<code>T</code>)=<code>Int</code></li>
|
||||
<li>F(<code>f</code>)=<code>\_->0</code></li>
|
||||
</ul>
|
|
@ -0,0 +1,12 @@
|
|||
## "Non Haskell" Hask's Functors
|
||||
|
||||
A simple basic example is the \\(id\_\\Hask\\) functor.
|
||||
It simply cannot be expressed as a couple (`F`,`fmap`) where
|
||||
|
||||
- `F::* -> *`
|
||||
- `fmap :: (a -> b) -> (F a) -> (F b)`
|
||||
|
||||
Another example:
|
||||
|
||||
- F(`T`)=`Int`
|
||||
- F(`f`)=`\_->0`
|
|
@ -0,0 +1,18 @@
|
|||
<h2 id="also-functor-inside-hask">Also Functor inside \(\Hask\)</h2>
|
||||
<p>\(\mathtt{[a]}∈\ob{\Hask}\)</code> but is also a category. Idem for <code>Int</code>.</p>
|
||||
<p><code>length</code> is a Functor from the category <code>[a]</code> to the cateogry <code>Int</code>:</p>
|
||||
<ul class="left" style="max-width:40%">
|
||||
<li>\(\ob{\mathtt{[a]}}=\{∙\}\)</li>
|
||||
<li>\(\hom{\mathtt{[a]}}=\mathtt{[a]}\)</li>
|
||||
<li>\(∘=\mathtt{(++)}\)</li>
|
||||
</ul>
|
||||
<p class="left" style="margin:2em 3em">⇒</p>
|
||||
<ul class="left" style="max-width:40%">
|
||||
<li>\(\ob{\mathtt{Int}}=\{∙\}\)</li>
|
||||
<li>\(\hom{\mathtt{Int}}=\mathtt{Int}\)</li>
|
||||
<li>\(∘=\mathtt{(+)}\)</li>
|
||||
</ul>
|
||||
<div class="flush"></div>
|
||||
<ul><li>id: <code>length [] = 0</code>
|
||||
</li><li>comp: <code>length (l ++ l') = (length l) + (length l')</code>
|
||||
</li></ul>
|
|
@ -0,0 +1,2 @@
|
|||
<h2 id="category-of-hask-endofunctors">Category of \(\Hask\) Endofunctors</h2>
|
||||
<img width="60%" src="categories/img/mp/cat-hask-endofunctor.png" alt="Category of Hask endofunctors" />
|
|
@ -0,0 +1,4 @@
|
|||
Category of \\(\\Hask\\) Endofunctors
|
||||
------------------------------------
|
||||
|
||||
<img width="60%" src="categories/img/mp/cat-hask-endofunctor.png" alt="Category of Hask endofunctors" />
|
|
@ -0,0 +1,8 @@
|
|||
<h2 id="category-of-functors">Category of Functors</h2>
|
||||
<p>If \(\C\) is <em>small</em> (\(\hom{\C}\) is a set). All functors from \(\C\) to some category \(\D\) form the category \(\mathrm{Func}(\C,\D)\).</p>
|
||||
<ul>
|
||||
<li>\(\ob{\mathrm{Func}(\C,\D)}\): Functors \(F:\C→\D\)</li>
|
||||
<li>\(\hom{\mathrm{Func}(\C,\D)}\): <em>natural transformations</em></li>
|
||||
<li>∘: Functor composition</li>
|
||||
</ul>
|
||||
<p>\(\mathrm{Func}(\C,\C)\) is the category of endofunctors of \(\C\).</p>
|
12
categories/30_How/100_Functors/130_Category_of_Functors.md
Normal file
12
categories/30_How/100_Functors/130_Category_of_Functors.md
Normal file
|
@ -0,0 +1,12 @@
|
|||
Category of Functors
|
||||
------------------------
|
||||
|
||||
If \\(\\C\\) is _small_ (\\(\\hom{\\C}\\) is a set).
|
||||
All functors from \\(\\C\\) to some category \\(\\D\\)
|
||||
form the category \\(\\mathrm{Func}(\\C,\\D)\\).
|
||||
|
||||
- \\(\\ob{\\mathrm{Func}(\\C,\\D)}\\): Functors \\(F:\\C→\\D\\)
|
||||
- \\(\\hom{\\mathrm{Func}(\\C,\\D)}\\): _natural transformations_
|
||||
- ∘: Functor composition
|
||||
|
||||
\\(\\mathrm{Func}(\\C,\\C)\\) is the category of endofunctors of \\(\\C\\).
|
|
@ -0,0 +1,4 @@
|
|||
<h2 id="natural-transformations">Natural Transformations</h2>
|
||||
<p>Let \(F\) and \(G\) be two functors from \(\C\) to \(\D\).</p>
|
||||
<p><img src="categories/img/mp/natural-transformation.png" alt="Natural transformation commutative diagram" class="right"/> <em>A natural transformation:</em> familly η ; \(η_X\in\hom{\D}\) for \(X\in\ob{\C}\) s.t.</p>
|
||||
<p>ex: between Haskell functors; <code>F a -> G a</code><br />Rearragement functions only.</p>
|
|
@ -0,0 +1,10 @@
|
|||
Natural Transformations
|
||||
-----------------------
|
||||
|
||||
Let \\(F\\) and \\(G\\) be two functors from \\(\\C\\) to \\(\\D\\).
|
||||
|
||||
<img src="categories/img/mp/natural-transformation.png" alt="Natural transformation commutative diagram" class="right"/>
|
||||
_A natural transformation:_ familly η ; \\(η\_X\\in\\hom{\\D}\\) for \\(X\\in\\ob{\\C}\\) s.t.
|
||||
|
||||
ex: between Haskell functors; `F a -> G a`
|
||||
Rearragement functions only.
|
|
@ -0,0 +1,13 @@
|
|||
<h2 id="natural-transformation-examples-14">Natural Transformation Examples (1/4)</h2>
|
||||
<pre><code class="haskell small">data Tree a = Empty | Node a [Tree a]
|
||||
toTree :: [a] -> Tree a
|
||||
toTree [] = Empty
|
||||
toTree (x:xs) = Node x [toTree xs]</pre>
|
||||
</code>
|
||||
<p><code>toTree</code> is a natural transformation. It is also a morphism from <code>[]</code> to <code>Tree</code> in the Category of \(\Hask\) endofunctors.</p>
|
||||
<img style="float:left;width:30%" src="categories/img/mp/nattrans-list-tree.png" alt="natural transformation commutative diagram"/>
|
||||
<figure style="float:right;width:60%">
|
||||
<img style="width:40%" src="categories/img/mp/list-tree-endofunctor-morphism.png" alt="natural transformation commutative diagram"/>
|
||||
</figure>
|
||||
|
||||
|
|
@ -0,0 +1,16 @@
|
|||
Natural Transformation Examples (1/4)
|
||||
------------------------------------
|
||||
|
||||
<pre><code class="haskell small">data Tree a = Empty | Node a [Tree a]
|
||||
toTree :: [a] -> Tree a
|
||||
toTree [] = Empty
|
||||
toTree (x:xs) = Node x [toTree xs]</pre></code>
|
||||
|
||||
|
||||
`toTree` is a natural transformation.
|
||||
It is also a morphism from `[]` to `Tree` in the Category of \\(\\Hask\\) endofunctors.
|
||||
|
||||
<img style="float:left;width:30%" src="categories/img/mp/nattrans-list-tree.png" alt="natural transformation commutative diagram"/>
|
||||
<figure style="float:right;width:60%">
|
||||
<img style="width:40%" src="categories/img/mp/list-tree-endofunctor-morphism.png" alt="natural transformation commutative diagram"/>
|
||||
</figure>
|
|
@ -0,0 +1,13 @@
|
|||
<h2 id="natural-transformation-examples-24">Natural Transformation Examples (2/4)</h2>
|
||||
<pre><code class="haskell small">data Tree a = Empty | Node a [Tree a]
|
||||
toList :: Tree a -> [a]
|
||||
toList Empty = []
|
||||
toList (Node x l) = [x] ++ concat (map toList l)</pre>
|
||||
</code>
|
||||
<p><code>toList</code> is a natural transformation. It is also a morphism from <code>Tree</code> to <code>[]</code> in the Category of \(\Hask\) endofunctors.</p>
|
||||
<img style="float:left;width:30%" src="categories/img/mp/nattrans-tree-list.png" alt="natural transformation commutative diagram"/>
|
||||
<figure style="float:right;width:60%">
|
||||
<img style="width:40%" src="categories/img/mp/tree-list-endofunctor-morphism.png" alt="natural transformation commutative diagram"/> <figcaption><code>toList . toTree = id</code> & <code>toTree . toList = id</code> <span style="visibility:hidden">&</span><br/> therefore <code>[]</code> & <code>Tree</code> are <span class="yellow">isomorph</span>. </figcaption>
|
||||
</figure>
|
||||
|
||||
|
|
@ -0,0 +1,19 @@
|
|||
Natural Transformation Examples (2/4)
|
||||
------------------------------------
|
||||
|
||||
<pre><code class="haskell small">data Tree a = Empty | Node a [Tree a]
|
||||
toList :: Tree a -> [a]
|
||||
toList Empty = []
|
||||
toList (Node x l) = [x] ++ concat (map toList l)</pre></code>
|
||||
|
||||
|
||||
`toList` is a natural transformation.
|
||||
It is also a morphism from `Tree` to `[]` in the Category of \\(\\Hask\\) endofunctors.
|
||||
|
||||
<img style="float:left;width:30%" src="categories/img/mp/nattrans-tree-list.png" alt="natural transformation commutative diagram"/>
|
||||
<figure style="float:right;width:60%">
|
||||
<img style="width:40%" src="categories/img/mp/tree-list-endofunctor-morphism.png" alt="natural transformation commutative diagram"/>
|
||||
<figcaption><code>toList . toTree = id</code> & <code>toTree . toList = id</code> <span style="visibility:hidden">&</span><br/>
|
||||
therefore <code>[]</code> & <code>Tree</code> are <span class="yellow">isomorph</span>.
|
||||
</figcaption>
|
||||
</figure>
|
|
@ -0,0 +1,12 @@
|
|||
<h2 id="natural-transformation-examples-34">Natural Transformation Examples (3/4)</h2>
|
||||
<pre><code class="haskell small">toMaybe :: [a] -> Maybe a
|
||||
toMaybe [] = Nothing
|
||||
toMaybe (x:xs) = Just x</pre>
|
||||
</code>
|
||||
<p><code>toMaybe</code> is a natural transformation. It is also a morphism from <code>[]</code> to <code>Maybe</code> in the Category of \(\Hask\) endofunctors.</p>
|
||||
<img style="float:left;width:30%" src="categories/img/mp/nattrans-list-maybe.png" alt="natural transformation commutative diagram"/>
|
||||
<figure style="float:right;width:60%">
|
||||
<img style="width:40%" src="categories/img/mp/list-maybe-endofunctor-morphism.png" alt="natural transformation commutative diagram"/>
|
||||
</figure>
|
||||
|
||||
|
|
@ -0,0 +1,15 @@
|
|||
Natural Transformation Examples (3/4)
|
||||
-------------------------------------
|
||||
|
||||
<pre><code class="haskell small">toMaybe :: [a] -> Maybe a
|
||||
toMaybe [] = Nothing
|
||||
toMaybe (x:xs) = Just x</pre></code>
|
||||
|
||||
|
||||
`toMaybe` is a natural transformation.
|
||||
It is also a morphism from `[]` to `Maybe` in the Category of \\(\\Hask\\) endofunctors.
|
||||
|
||||
<img style="float:left;width:30%" src="categories/img/mp/nattrans-list-maybe.png" alt="natural transformation commutative diagram"/>
|
||||
<figure style="float:right;width:60%">
|
||||
<img style="width:40%" src="categories/img/mp/list-maybe-endofunctor-morphism.png" alt="natural transformation commutative diagram"/>
|
||||
</figure>
|
|
@ -0,0 +1,12 @@
|
|||
<h2 id="natural-transformation-examples-44">Natural Transformation Examples (4/4)</h2>
|
||||
<pre><code class="haskell small">mToList :: Maybe a -> [a]
|
||||
mToList Nothing = []
|
||||
mToList Just x = [x]</pre>
|
||||
</code>
|
||||
<p><code>toMaybe</code> is a natural transformation. It is also a morphism from <code>[]</code> to <code>Maybe</code> in the Category of \(\Hask\) endofunctors.</p>
|
||||
<img style="float:left;width:30%" src="categories/img/mp/nattrans-maybe-list.png" alt="natural transformation commutative diagram"/>
|
||||
<figure style="float:right;width:60%">
|
||||
<img style="width:40%" src="categories/img/mp/maybe-list-endofunctor-morphsm.png" alt="relation between [] and Maybe"/> <figcaption>There is <span class="red">no isomorphism</span>.<br/> Hint: <code>Bool</code> lists longer than 1. </figcaption>
|
||||
</figure>
|
||||
|
||||
|
|
@ -0,0 +1,18 @@
|
|||
Natural Transformation Examples (4/4)
|
||||
-------------------------------------
|
||||
|
||||
<pre><code class="haskell small">mToList :: Maybe a -> [a]
|
||||
mToList Nothing = []
|
||||
mToList Just x = [x]</pre></code>
|
||||
|
||||
|
||||
`toMaybe` is a natural transformation.
|
||||
It is also a morphism from `[]` to `Maybe` in the Category of \\(\\Hask\\) endofunctors.
|
||||
|
||||
<img style="float:left;width:30%" src="categories/img/mp/nattrans-maybe-list.png" alt="natural transformation commutative diagram"/>
|
||||
<figure style="float:right;width:60%">
|
||||
<img style="width:40%" src="categories/img/mp/maybe-list-endofunctor-morphsm.png" alt="relation between [] and Maybe"/>
|
||||
<figcaption>There is <span class="red">no isomorphism</span>.<br/>
|
||||
Hint: <code>Bool</code> lists longer than 1.
|
||||
</figcaption>
|
||||
</figure>
|
|
@ -0,0 +1,7 @@
|
|||
<h2 id="composition-problem">Composition problem</h2>
|
||||
<p>The Problem; example with lists:</p>
|
||||
<pre class="haskell"><code>f x = [x] ⇒ f 1 = [1] ⇒ (f.f) 1 = [[1]] ✗
|
||||
g x = [x+1] ⇒ g 1 = [2] ⇒ (g.g) 1 = ERROR [2]+1 ✗
|
||||
h x = [x+1,x*3] ⇒ h 1 = [2,3] ⇒ (h.h) 1 = ERROR [2,3]+1 ✗ </code></pre>
|
||||
|
||||
<p>The same problem with most <code>f :: a -> F a</code> functions and functor <code>F</code>.</p>
|
10
categories/30_How/200_Monads/050_Composition_problem.md
Normal file
10
categories/30_How/200_Monads/050_Composition_problem.md
Normal file
|
@ -0,0 +1,10 @@
|
|||
Composition problem
|
||||
--------------------------------------------
|
||||
|
||||
The Problem; example with lists:
|
||||
|
||||
<pre class="haskell"><code>f x = [x] ⇒ f 1 = [1] ⇒ (f.f) 1 = [[1]] ✗
|
||||
g x = [x+1] ⇒ g 1 = [2] ⇒ (g.g) 1 = ERROR [2]+1 ✗
|
||||
h x = [x+1,x*3] ⇒ h 1 = [2,3] ⇒ (h.h) 1 = ERROR [2,3]+1 ✗ </code></pre>
|
||||
|
||||
The same problem with most `f :: a -> F a` functions and functor `F`.
|
|
@ -0,0 +1,6 @@
|
|||
<h2 id="composition-fixable">Composition Fixable?</h2>
|
||||
<p>How to fix that? We want to construct an operator which is able to compose:</p>
|
||||
<p><code>f :: a -> F b</code> & <code>g :: b -> F c</code>.</p>
|
||||
<p>More specifically we want to create an operator ◎ of type</p>
|
||||
<p><code>◎ :: (b -> F c) -> (a -> F b) -> (a -> F c)</code></p>
|
||||
<p>Note: if <code>F</code> = I, ◎ = <code>(.)</code>.</p>
|
12
categories/30_How/200_Monads/060_Composition_Fixable.md
Normal file
12
categories/30_How/200_Monads/060_Composition_Fixable.md
Normal file
|
@ -0,0 +1,12 @@
|
|||
Composition Fixable?
|
||||
--------------------------------------------
|
||||
|
||||
How to fix that? We want to construct an operator which is able to compose:
|
||||
|
||||
`f :: a -> F b` & `g :: b -> F c`.
|
||||
|
||||
More specifically we want to create an operator ◎ of type
|
||||
|
||||
`◎ :: (b -> F c) -> (a -> F b) -> (a -> F c)`
|
||||
|
||||
Note: if `F` = I, ◎ = `(.)`.
|
|
@ -0,0 +1,7 @@
|
|||
<h2 id="fix-composition-12">Fix Composition (1/2)</h2>
|
||||
<p>Goal, find: <code>◎ :: (b -> F c) -> (a -> F b) -> (a -> F c)</code><br /><code>f :: a -> F b</code>, <code>g :: b -> F c</code>:</p>
|
||||
<ul>
|
||||
<li><code>(g ◎ f) x</code> ???</li>
|
||||
<li>First apply <code>f</code> to <code>x</code> ⇒ <code>f x :: F b</code></li>
|
||||
<li>Then how to apply <code>g</code> properly to an element of type <code>F b</code>?</li>
|
||||
</ul>
|
9
categories/30_How/200_Monads/070_Fix_Composition_1_2.md
Normal file
9
categories/30_How/200_Monads/070_Fix_Composition_1_2.md
Normal file
|
@ -0,0 +1,9 @@
|
|||
Fix Composition (1/2)
|
||||
--------------------------------------------
|
||||
|
||||
Goal, find: `◎ :: (b -> F c) -> (a -> F b) -> (a -> F c)`
|
||||
`f :: a -> F b`, `g :: b -> F c`:
|
||||
|
||||
- `(g ◎ f) x` ???
|
||||
- First apply `f` to `x` ⇒ `f x :: F b`
|
||||
- Then how to apply `g` properly to an element of type `F b`?
|
|
@ -0,0 +1,9 @@
|
|||
<h2 id="fix-composition-22">Fix Composition (2/2)</h2>
|
||||
<p>Goal, find: <code>◎ :: (b -> F c) -> (a -> F b) -> (a -> F c)</code><br /><code>f :: a -> F b</code>, <code>g :: b -> F c</code>, <span class="yellow"><code>f x :: F b</code></span>:</p>
|
||||
<ul>
|
||||
<li>Use <code>fmap :: (t -> u) -> (F t -> F u)</code>!</li>
|
||||
<li><code>(fmap g) :: F b -> F (F c)</code> ; (<code>t=b</code>, <code>u=F c</code>)</li>
|
||||
<li><code>(fmap g) (f x) :: F (F c)</code> it almost WORKS!</li>
|
||||
<li>We lack an important component, <code>join :: F (F c) -> F c</code></li>
|
||||
<li><code>(g ◎ f) x = join ((fmap g) (f x))</code> ☺<br />◎ is the Kleisli composition; in Haskell: <code><=<</code> (in <code>Control.Monad</code>).</li>
|
||||
</ul>
|
12
categories/30_How/200_Monads/080_Fix_Composition_2_2.md
Normal file
12
categories/30_How/200_Monads/080_Fix_Composition_2_2.md
Normal file
|
@ -0,0 +1,12 @@
|
|||
Fix Composition (2/2)
|
||||
--------------------------------------------
|
||||
|
||||
Goal, find: `◎ :: (b -> F c) -> (a -> F b) -> (a -> F c)`
|
||||
`f :: a -> F b`, `g :: b -> F c`, <span class="yellow">`f x :: F b`</span>:
|
||||
|
||||
- Use `fmap :: (t -> u) -> (F t -> F u)`!
|
||||
- `(fmap g) :: F b -> F (F c)` ; (`t=b`, `u=F c`)
|
||||
- `(fmap g) (f x) :: F (F c)` it almost WORKS!
|
||||
- We lack an important component, `join :: F (F c) -> F c`
|
||||
- `(g ◎ f) x = join ((fmap g) (f x))` ☺
|
||||
◎ is the Kleisli composition; in Haskell: `<=<` (in `Control.Monad`).
|
7
categories/30_How/200_Monads/090_Necessary_laws.html
Normal file
7
categories/30_How/200_Monads/090_Necessary_laws.html
Normal file
|
@ -0,0 +1,7 @@
|
|||
<h2 id="necessary-laws">Necessary laws</h2>
|
||||
<p>For ◎ to work like composition, we need join to hold the following properties:</p>
|
||||
<ul>
|
||||
<li><code>join (join (F (F (F a))))=join (F (join (F (F a))))</code></li>
|
||||
<li>abusing notations denoting <code>join</code> by ⊙; this is equivalent to<br /><span class="yellow"><code>(F ⊙ F) ⊙ F = F ⊙ (F ⊙ F)</code></span></li>
|
||||
<li>There exists <code>η :: a -> F a</code> s.t.<br /><span class="yellow"><code>η⊙F=F=F⊙η</code></span></li>
|
||||
</ul>
|
10
categories/30_How/200_Monads/090_Necessary_laws.md
Normal file
10
categories/30_How/200_Monads/090_Necessary_laws.md
Normal file
|
@ -0,0 +1,10 @@
|
|||
Necessary laws
|
||||
--------------------------------------------
|
||||
|
||||
For ◎ to work like composition, we need join to hold the following properties:
|
||||
|
||||
- `join (join (F (F (F a))))=join (F (join (F (F a))))`
|
||||
- abusing notations denoting `join` by ⊙; this is equivalent to
|
||||
<span class="yellow">`(F ⊙ F) ⊙ F = F ⊙ (F ⊙ F)`</span>
|
||||
- There exists `η :: a -> F a` s.t.
|
||||
<span class="yellow">`η⊙F=F=F⊙η`</span>
|
8
categories/30_How/200_Monads/100_Klesli_composition.html
Normal file
8
categories/30_How/200_Monads/100_Klesli_composition.html
Normal file
|
@ -0,0 +1,8 @@
|
|||
<h2 id="klesli-composition">Klesli composition</h2>
|
||||
<p>Now the composition works as expected. In Haskell ◎ is <code><=<</code> in <code>Control.Monad</code>.</p>
|
||||
<p><code>g <=< f = \x -> join ((fmap g) (f x))</code></p>
|
||||
<pre class="haskell"><code>f x = [x] ⇒ f 1 = [1] ⇒ (f <=< f) 1 = [1] ✓
|
||||
g x = [x+1] ⇒ g 1 = [2] ⇒ (g <=< g) 1 = [3] ✓
|
||||
h x = [x+1,x*3] ⇒ h 1 = [2,3] ⇒ (h <=< h) 1 = [3,6,4,9] ✓</code></pre>
|
||||
|
||||
|
10
categories/30_How/200_Monads/100_Klesli_composition.md
Normal file
10
categories/30_How/200_Monads/100_Klesli_composition.md
Normal file
|
@ -0,0 +1,10 @@
|
|||
Klesli composition
|
||||
------------------
|
||||
|
||||
Now the composition works as expected. In Haskell ◎ is `<=<` in `Control.Monad`.
|
||||
|
||||
`g <=< f = \x -> join ((fmap g) (f x))`
|
||||
|
||||
<pre class="haskell"><code>f x = [x] ⇒ f 1 = [1] ⇒ (f <=< f) 1 = [1] ✓
|
||||
g x = [x+1] ⇒ g 1 = [2] ⇒ (g <=< g) 1 = [3] ✓
|
||||
h x = [x+1,x*3] ⇒ h 1 = [2,3] ⇒ (h <=< h) 1 = [3,6,4,9] ✓</code></pre>
|
12
categories/30_How/200_Monads/110_We_reinvented_Monads.html
Normal file
12
categories/30_How/200_Monads/110_We_reinvented_Monads.html
Normal file
|
@ -0,0 +1,12 @@
|
|||
<h2 id="we-reinvented-monads">We reinvented Monads!</h2>
|
||||
<p>A monad is a triplet <code>(M,⊙,η)</code> where</p>
|
||||
<ul>
|
||||
<li>\(M\) an <span class="yellow">Endofunctor</span> (to type <code>a</code> associate <code>M a</code>)</li>
|
||||
<li>\(⊙:M×M→M\) a <span class="yellow">nat. trans.</span> (i.e. <code>⊙::M (M a) → M a</code> ; <code>join</code>)</li>
|
||||
<li>\(η:I→M\) a <span class="yellow">nat. trans.</span> (\(I\) identity functor ; <code>η::a → M a</code>)</li>
|
||||
</ul>
|
||||
<p>Satisfying</p>
|
||||
<ul>
|
||||
<li>\(M ⊙ (M ⊙ M) = (M ⊙ M) ⊙ M\)</li>
|
||||
<li>\(η ⊙ M = M = M ⊙ η\)</li>
|
||||
</ul>
|
13
categories/30_How/200_Monads/110_We_reinvented_Monads.md
Normal file
13
categories/30_How/200_Monads/110_We_reinvented_Monads.md
Normal file
|
@ -0,0 +1,13 @@
|
|||
We reinvented Monads!
|
||||
---------------------
|
||||
|
||||
A monad is a triplet `(M,⊙,η)` where
|
||||
|
||||
- \\(M\\) an <span class="yellow">Endofunctor</span> (to type `a` associate `M a`)
|
||||
- \\(⊙:M×M→M\\) a <span class="yellow">nat. trans.</span> (i.e. `⊙::M (M a) → M a` ; `join`)
|
||||
- \\(η:I→M\\) a <span class="yellow">nat. trans.</span> (\\(I\\) identity functor ; `η::a → M a`)
|
||||
|
||||
Satisfying
|
||||
|
||||
- \\(M ⊙ (M ⊙ M) = (M ⊙ M) ⊙ M\\)
|
||||
- \\(η ⊙ M = M = M ⊙ η\\)
|
12
categories/30_How/200_Monads/120_Compare_with_Monoid.html
Normal file
12
categories/30_How/200_Monads/120_Compare_with_Monoid.html
Normal file
|
@ -0,0 +1,12 @@
|
|||
<h2 id="compare-with-monoid">Compare with Monoid</h2>
|
||||
<p>A Monoid is a triplet \((E,∙,e)\) s.t.</p>
|
||||
<ul>
|
||||
<li>\(E\) a set</li>
|
||||
<li>\(∙:E×E→E\)</li>
|
||||
<li>\(e:1→E\)</li>
|
||||
</ul>
|
||||
<p>Satisfying</p>
|
||||
<ul>
|
||||
<li>\(x∙(y∙z) = (x∙y)∙z, ∀x,y,z∈E\)</li>
|
||||
<li>\(e∙x = x = x∙e, ∀x∈E\)</li>
|
||||
</ul>
|
13
categories/30_How/200_Monads/120_Compare_with_Monoid.md
Normal file
13
categories/30_How/200_Monads/120_Compare_with_Monoid.md
Normal file
|
@ -0,0 +1,13 @@
|
|||
Compare with Monoid
|
||||
-------------------
|
||||
|
||||
A Monoid is a triplet \\((E,∙,e)\\) s.t.
|
||||
|
||||
- \\(E\\) a set
|
||||
- \\(∙:E×E→E\\)
|
||||
- \\(e:1→E\\)
|
||||
|
||||
Satisfying
|
||||
|
||||
- \\(x∙(y∙z) = (x∙y)∙z, ∀x,y,z∈E\\)
|
||||
- \\(e∙x = x = x∙e, ∀x∈E\\)
|
|
@ -0,0 +1,8 @@
|
|||
<h2 id="monads-are-just-monoids">Monads are just Monoids</h2>
|
||||
<blockquote>
|
||||
<p>A Monad is just a monoid in the category of endofunctors, what's the problem?</p>
|
||||
</blockquote>
|
||||
<p>The real sentence was:</p>
|
||||
<blockquote>
|
||||
<p>All told, a monad in X is just a monoid in the category of endofunctors of X, with product × replaced by composition of endofunctors and unit set by the identity endofunctor.</p>
|
||||
</blockquote>
|
10
categories/30_How/200_Monads/130_Monads_are_just_Monoids.md
Normal file
10
categories/30_How/200_Monads/130_Monads_are_just_Monoids.md
Normal file
|
@ -0,0 +1,10 @@
|
|||
Monads are just Monoids
|
||||
-----------------------
|
||||
|
||||
> A Monad is just a monoid in the category of endofunctors, what's the problem?
|
||||
|
||||
The real sentence was:
|
||||
|
||||
> All told, a monad in X is just a monoid in the category of endofunctors of X,
|
||||
> with product × replaced by composition of endofunctors
|
||||
> and unit set by the identity endofunctor.
|
15
categories/30_How/200_Monads/140_Example_List.html
Normal file
15
categories/30_How/200_Monads/140_Example_List.html
Normal file
|
@ -0,0 +1,15 @@
|
|||
<h2 id="example-list">Example: List</h2>
|
||||
<ul>
|
||||
<li><code>[] :: * -> *</code> an <span class="yellow">Endofunctor</span></li>
|
||||
<li>\(⊙:M×M→M\) a nat. trans. (<code>join :: M (M a) -> M a</code>)</li>
|
||||
<li>\(η:I→M\) a nat. trans.</li>
|
||||
</ul>
|
||||
<pre class="haskell"><code>-- In Haskell ⊙ is "join" in "Control.Monad"
|
||||
join :: [[a]] -> [a]
|
||||
join = concat
|
||||
|
||||
-- In Haskell the "return" function (unfortunate name)
|
||||
η :: a -> [a]
|
||||
η x = [x]</code></pre>
|
||||
|
||||
|
14
categories/30_How/200_Monads/140_Example_List.md
Normal file
14
categories/30_How/200_Monads/140_Example_List.md
Normal file
|
@ -0,0 +1,14 @@
|
|||
Example: List
|
||||
-------------
|
||||
|
||||
- `[] :: * -> *` an <span class="yellow">Endofunctor</span>
|
||||
- \\(⊙:M×M→M\\) a nat. trans. (`join :: M (M a) -> M a`)
|
||||
- \\(η:I→M\\) a nat. trans.
|
||||
|
||||
<pre class="haskell"><code>-- In Haskell ⊙ is "join" in "Control.Monad"
|
||||
join :: [[a]] -> [a]
|
||||
join = concat
|
||||
|
||||
-- In Haskell the "return" function (unfortunate name)
|
||||
η :: a -> [a]
|
||||
η x = [x]</code></pre>
|
|
@ -0,0 +1,11 @@
|
|||
<h2 id="example-list-law-verification">Example: List (law verification)</h2>
|
||||
<p>Example: <code>List</code> is a functor (<code>join</code> is ⊙)</p>
|
||||
<ul>
|
||||
<li>\(M ⊙ (M ⊙ M) = (M ⊙ M) ⊙ M\)</li>
|
||||
<li>\(η ⊙ M = M = M ⊙ η\)</li>
|
||||
</ul>
|
||||
<pre class="nohighlight small"><code>join [ join [[x,y,...,z]] ] = join [[x,y,...,z]]
|
||||
= join (join [[[x,y,...,z]]])
|
||||
join (η [x]) = [x] = join [η x]</code></pre>
|
||||
|
||||
<p>Therefore <code>([],join,η)</code> is a monad.</p>
|
|
@ -0,0 +1,13 @@
|
|||
Example: List (law verification)
|
||||
--------------------------------
|
||||
|
||||
Example: `List` is a functor (`join` is ⊙)
|
||||
|
||||
- \\(M ⊙ (M ⊙ M) = (M ⊙ M) ⊙ M\\)
|
||||
- \\(η ⊙ M = M = M ⊙ η\\)
|
||||
|
||||
<pre class="nohighlight small"><code>join [ join [[x,y,...,z]] ] = join [[x,y,...,z]]
|
||||
= join (join [[[x,y,...,z]]])
|
||||
join (η [x]) = [x] = join [η x]</code></pre>
|
||||
|
||||
Therefore `([],join,η)` is a monad.
|
28
categories/30_How/200_Monads/160_Monads_useful.html
Normal file
28
categories/30_How/200_Monads/160_Monads_useful.html
Normal file
|
@ -0,0 +1,28 @@
|
|||
<h2 id="monads-utility">Monads useful?</h2>
|
||||
<p>A <em>LOT</em> of monad tutorial on the net. Just one example; the State Monad</p>
|
||||
<p><code>DrawScene</code> to <code><span class="yellow">State Screen</span> DrawScene</code> ; still <b>pure</b>.</p>
|
||||
<pre class="haskell left smaller" style="width:40%"><code>main = drawImage (width,height)
|
||||
|
||||
drawImage :: Screen -> DrawScene
|
||||
drawImage <span class="orange">screen</span> =
|
||||
drawPoint p <span class="orange">screen</span>
|
||||
drawCircle c <span class="orange">screen</span>
|
||||
drawRectangle r <span class="orange">screen</span>
|
||||
|
||||
drawPoint point <span class="orange">screen</span> = ...
|
||||
drawCircle circle <span class="orange">screen</span> = ...
|
||||
drawRectangle rectangle <span class="orange">screen</span> = ...</code></pre>
|
||||
<pre class="haskell right smaller" style="width:45%"><code>main = do
|
||||
<span class="orange">put (Screen 1024 768)</span>
|
||||
drawImage
|
||||
|
||||
drawImage :: State Screen DrawScene
|
||||
drawImage = do
|
||||
drawPoint p
|
||||
drawCircle c
|
||||
drawRectangle r
|
||||
|
||||
drawPoint :: Point -> State Screen DrawScene
|
||||
drawPoint p = do
|
||||
<span class="orange">Screen width height <- get</span>
|
||||
...</code></pre>
|
2
categories/30_How/300_Catamorphisms/010_fold.html
Normal file
2
categories/30_How/300_Catamorphisms/010_fold.html
Normal file
|
@ -0,0 +1,2 @@
|
|||
<h2 id="fold"><code>fold</code></h2>
|
||||
<img src="categories/img/tower_folded.gif" alt="fold" style="width:50%;max-width:50%"/>
|
Some files were not shown because too many files have changed in this diff Show more
Loading…
Reference in a new issue