2012-10-27 12:41:18 +00:00
<!DOCTYPE html>
< html >
< head >
< meta charset = "utf-8" >
< meta http-equiv = "X-UA-Compatible" content = "IE=edge,chrome=1" >
< meta name = "viewport" content = "width=1024, user-scalable=no" >
< title > Category Theory for Programming< / title >
<!-- Required stylesheet -->
< link rel = "stylesheet" href = "core/deck.core.css" >
<!-- Extension CSS files go here. Remove or add as needed. -->
< link rel = "stylesheet" href = "extensions/goto/deck.goto.css" >
< link rel = "stylesheet" href = "extensions/menu/deck.menu.css" >
< link rel = "stylesheet" href = "extensions/navigation/deck.navigation.css" >
< link rel = "stylesheet" href = "extensions/status/deck.status.css" >
< link rel = "stylesheet" href = "extensions/hash/deck.hash.css" >
< link rel = "stylesheet" href = "extensions/scale/deck.scale.css" >
<!-- Transition theme. More available in /themes/transition/ or create your own. -->
2012-11-02 16:21:45 +00:00
< link rel = "stylesheet" href = "themes/transition/fade.css" >
2012-10-27 12:41:18 +00:00
<!-- Style theme. More available in /themes/style/ or create your own. -->
<!-- <link rel="stylesheet" href="themes/style/web - 2.0.css"> -->
< link rel = "stylesheet" href = "themes/style/y/main.css" / >
< link rel = "stylesheet" href = "themes/style/y/solarized.css" / >
<!-- Required Modernizr file -->
< script src = "modernizr.custom.js" > < / script >
< / head >
< body class = "deck-container" >
2012-11-02 14:25:55 +00:00
< div style = "display:none" >
\(\newcommand{\F}{\mathbf{F}}\)
2012-11-20 16:01:31 +00:00
\(\newcommand{\E}{\mathbf{E}}\)
2012-11-02 14:25:55 +00:00
\(\newcommand{\C}{\mathcal{C}}\)
\(\newcommand{\D}{\mathcal{D}}\)
\(\newcommand{\id}{\mathrm{id}}\)
\(\newcommand{\ob}[1]{\mathrm{ob}(#1)}\)
\(\newcommand{\hom}[1]{\mathrm{hom}(#1)}\)
2012-11-07 13:50:33 +00:00
\(\newcommand{\Set}{\mathbf{Set}}\)
2012-11-09 16:05:27 +00:00
\(\newcommand{\Mon}{\mathbf{Mon}}\)
2012-11-09 16:43:35 +00:00
\(\newcommand{\Vec}{\mathbf{Vec}}\)
\(\newcommand{\Grp}{\mathbf{Grp}}\)
\(\newcommand{\Rng}{\mathbf{Rng}}\)
\(\newcommand{\ML}{\mathbf{ML}}\)
2012-11-12 15:20:42 +00:00
\(\newcommand{\Hask}{\mathbf{Hask}}\)
2012-11-16 10:42:05 +00:00
\(\newcommand{\Cat}{\mathbf{Cat}}\)
2012-11-20 16:01:31 +00:00
\(\newcommand{\fmap}{\mathtt{fmap}}\)
2012-11-02 14:25:55 +00:00
< / div >
2012-10-27 12:41:18 +00:00
<!-- Begin slides. Just make elements with a class of slide. -->
< section class = "slide" >
2012-11-02 14:25:55 +00:00
< h1 > Category Theory < span class = "and" > < span class = "and" > & < / span > < / span > Programming
< div > < author style = "font-size: .4em" > < em class = "base01" > by< / em > Yann Esposito
2012-11-09 16:17:07 +00:00
< div style = "font-size:.5em" >
2012-11-09 16:05:27 +00:00
< twitter >
2012-11-02 14:25:55 +00:00
< a href = "http://twitter.com/yogsototh" > @yogsototh< / a > ,
< / twitter >
2012-11-09 16:05:27 +00:00
< googleplus >
2012-11-02 14:25:55 +00:00
< a href = "https://plus.google.com/117858550730178181663" > +yogsototh< / a >
< / googleplus >
< / div >
< / author > < / div >
2012-11-09 16:05:27 +00:00
< div class = "base01" style = "font-size: .25em; font-weight: 400; font-variant:italic" >
HTML presentation: use arrows, space to navigate.
< / div >
2012-11-02 14:25:55 +00:00
< / h1 >
2012-10-27 12:41:18 +00:00
< / section >
< section class = "slide" >
2012-11-02 14:25:55 +00:00
< h2 > Plan< / h2 >
2012-11-08 17:20:55 +00:00
< ul style = "font-size: 2em; font-weight:bold" >
< li > < span class = "yellow" > Why?
2012-11-09 16:05:27 +00:00
< ul class = "base01" style = "border-left: 2px solid; padding-left: 1em; font-size: .6em; float: right; font-weight: bold; margin: 0 0 0 1em" >
2012-11-08 17:20:55 +00:00
< li > Math < span class = "and" > < span class = "and" > & < / span > < / span > Abstraction< / li >
< li > Programming < span class = "and" > < span class = "and" > & < / span > < / span > Abstraction< / li >
< li > Categories < span class = "and" > < span class = "and" > & < / span > < / span > Abstraction< / li >
< / ul >
< / li >
2012-11-02 14:25:55 +00:00
< li > What?< / li >
< li > How?< / li >
< / ul >
2012-10-27 12:41:18 +00:00
< / section >
< section class = "slide" >
2012-11-07 17:12:48 +00:00
< h2 > Abstraction< / h2 >
< p > A common concept you see often in multiple instances.< / p >
2012-11-12 15:20:42 +00:00
< div >
2012-11-02 14:25:55 +00:00
< p > Numbers: 1,2,3,... < em class = "small" > 3400 BC, real numbers 760 BC< / em > < / p >
< figure class = "left" >
2012-11-07 17:12:48 +00:00
< img src = "categories/img/tally-count.png" style = "height:5em" alt = "Aboriginal Tally System" / >
2012-11-02 14:25:55 +00:00
< figcaption > Aboriginal Tally System< / figcaption >
< / figure >
2012-11-12 15:20:42 +00:00
< div >
< div class = "left" style = "left-margin: 1em" > amelioration ⇒< / div >
2012-11-07 17:12:48 +00:00
< figure class = "left" >
< img src = "categories/img/first-real-numbers.png" style = "height:5em" alt = "Mesopotamian Numbers" / >
< figcaption > Mesopotamian base 60 system< / figcaption >
< / figure >
< / div >
2012-11-02 14:25:55 +00:00
< div class = "flush" > < / div >
2012-11-12 15:20:42 +00:00
< div >
2012-11-07 17:12:48 +00:00
Operators: < b > =, < , > , +, × < / b >
< / div >
2012-10-27 12:41:18 +00:00
< / section >
< section class = "slide" >
2012-11-12 15:20:42 +00:00
< h2 > Generalization< / h2 >
2012-11-07 17:12:48 +00:00
< div class = "right" >
2012-11-07 16:05:48 +00:00
< img src = "categories/img/egyptian-hieroglyphics.jpg" alt = "Egyptian Fractions" / >
< img src = "categories/img/negative-numbers.jpg" alt = "Negative Numbers (Chinese)" / >
2012-11-07 17:12:48 +00:00
< / div >
2012-11-15 11:00:26 +00:00
< ul > < li > Weight/Distance/Time ⇒ < em > Rational< / em > \(\frac{p}{q}\)
< / li > < li > Debts ⇒ < em > Negative< / em > \(..., -2, -1, ? , 1, 2, ...\)
< / li > < li > Geometry ⇒ < em > Irrational< sup style = "vertical-align:middle" > *< / sup > < / em >
< / li > < li > Algebra ⇒ < em > Complex< / em >
< / li > < li > \(0\) ⇒ "Nothing" become a number
< / li > < / ul >
< p > < span class = "and" style = "visibility:hidden" > < span class = "and" > & < / span > < / span > More < strong > things< / strong > can be understood as numbers< br / >
< span class = "and" > < span class = "and" > & < / span > < / span > More < strong > operator< / strong > to manipulate them.< / p >
2012-10-27 12:41:18 +00:00
< / section >
< section class = "slide" >
2012-11-12 15:20:42 +00:00
< h2 > Numbers ⇒ Sets< / h2 >
2012-11-02 14:25:55 +00:00
< table >
< tr >
< th > Numbers< / th >
< th > Set Theory (∞)/Abstract Algebra/Topology< / th >
< / tr >
< tr >
< td > \(\mathbb{N}\): \((+,0)\)< / td >
< td > Semigroups< / td >
< / tr >
< tr >
< td > \(\mathbb{Z}\): \((+,0,\times,1)\)< / td >
< td > Rings< / td >
< / tr >
< tr >
< td > \(\mathbb{Q}\)< / td >
< td > Fields< / td >
< / tr >
< tr >
< td > \(\mathbb{R}\)< / td >
< td > Complete Fields (< em class = "base01" > topology< / em > )< / td >
< / tr >
< tr >
< td > \(\mathbb{C}\)< / td >
< td > Algebræ< / td >
< / tr >
< tr > < td > < / td > < td > Modules,Vector Spaces, Monoids, ...< / td > < / tr >
< / table >
< p > < span class = "and" style = "visibility:hidden" > < span class = "and" > & < / span > < / span > More < strong > general< / strong > : more things are sets.< br / >
< span class = "and" > < span class = "and" > & < / span > < / span > More < strong > precise< / strong > : clear distinction between concepts.< / p >
2012-10-27 12:41:18 +00:00
< / section >
< section class = "slide" >
2012-11-15 11:00:26 +00:00
< h2 > Sets ⇒? < span class = "yellow" > Categories< / span > < / h2 >
< table >
< tr >
< th > Numbers< / th >
< th > Sets< / th >
< th > Categories< / th >
< / tr >
< tr >
< td > \(\mathbb{N}\): \((+,0)\)< / td >
< td > Semigroups< / td >
< td > ?< / td >
< / tr >
< tr >
< td > \(\mathbb{Z}\): \((+,0,\times,1)\)< / td >
< td > Rings< / td >
< td > ?< / td >
< / tr >
< tr >
< td > \(\mathbb{Q}\)< / td >
< td > Fields< / td >
< td > ?< / td >
< / tr >
< tr >
< td > \(\mathbb{R}\)< / td >
< td > Complete Fields (< em class = "base01" > topology< / em > )< / td >
< td > ?< / td >
< / tr >
< tr >
< td > \(\mathbb{C}\)< / td >
< td > Algebræ< / td >
< td > ?< / td >
< / tr >
< tr > < td > < / td > < td > Modules,Vector Spaces, Monoids, ...< / td > < td > ?< / td > < / tr >
< / table >
< / section >
< section class = "slide" >
< h2 > < span class = "yellow" > /.*/< / span > ⇒? Category Theory< / h2 >
2012-11-16 15:48:56 +00:00
< p > Categories package entire mathematical theories.< / p >
2012-11-15 11:00:26 +00:00
< ul >
< li > Topology< / li >
< li > Quantum Physics< / li >
< li > Logic< / li >
< li > < b > Programming< / b > < / li >
< / ul >
< p > < span class = "and" style = "visibility:hidden" > < span class = "and" > & < / span > < / span > More < strong > general< / strong > : more things are Categories.< br / >
< span class = "and" > < span class = "and" > & < / span > < / span > More < strong > precise< / strong > : better distinction between concepts.< / p >
< p > Young field: < b > 1942– < / b > , Samuel Eilenberg < span class = "and" > < span class = "and" > & < / span > < / span > Saunders Mac Lane
< / section >
< section class = "slide" >
2012-11-08 17:20:55 +00:00
< h2 > Programming < span class = "and" > < span class = "and" > & < / span > < / span > Abstraction< / h2 >
< h3 > Impure programming< / h3 >
< ul >
< li > Encouraged by imperative paradigms.
< / li > < li > Actions < span class = "and" > < span class = "and" > & < / span > < / span > mutable objects.
2012-11-15 11:00:26 +00:00
< / li > < li > Time is < em > very< / em > important: ex. linked list push
< / li > < li > Synchronizing things is a challenge.
2012-11-08 17:20:55 +00:00
< / li >
< / ul >
2012-11-15 11:00:26 +00:00
< p > Natural Abstractions: pointers, variables, loop, Objects, Classes...< / p >
< p > Representation: a data structure changing other time.< / p >
2012-11-08 17:20:55 +00:00
< / section >
< section class = "slide" >
2012-11-12 15:20:42 +00:00
< h2 > Untyped Pure Programming< / h2 >
2012-11-08 17:20:55 +00:00
2012-11-15 11:00:26 +00:00
< ul > < li > Time is irrelevant by default.
< / li > < li > Mostly static constructions like pipes.
2012-11-16 15:48:56 +00:00
< / li > < li > All pipes can be plugged ⇒ all error at runtime
2012-11-15 11:00:26 +00:00
< ul > < li > (+ ("foo" 27) 32)
< / li > < li > Y = λf.(λx.f (x x)) (λx.f (x x))
2012-11-12 15:20:42 +00:00
< / li > < li > Y g = g (Y g)
2012-11-15 11:00:26 +00:00
< / li > < / ul >
2012-11-12 15:20:42 +00:00
< / li > < / ul >
< p > Natural abstraction: higher level functions < span class = "and" > < span class = "and" > & < / span > < / span > equations< / p >
2012-11-08 17:20:55 +00:00
< / section >
< section class = "slide" >
2012-11-16 15:48:56 +00:00
< h2 > Typed Pure Programming< / h2 >
< ul > < li > Add shapes to pipes:
2012-11-15 11:00:26 +00:00
< ul > < li > < code class = "red" > 4 + ["foo",27]< / code > forbidden
< / li > < li > < code class = "red" > ["foo",27]< / code > forbidden
< / li > < / ul >
2012-11-16 15:48:56 +00:00
< / li > < li > Polymorphic (elastic) shapes:
2012-11-15 11:00:26 +00:00
< ul > < li > < code > data Maybe a = Just a | Nothing< / code >
< / li > < li > < code > [Just 32,Nothing,Just 12] :: [Maybe Integer]< / code >
< / li > < / ul >
< / li > < / ul >
2012-11-12 15:20:42 +00:00
< p > Natural abstraction: Polymorphic higher level functions.< / p >
2012-11-08 17:20:55 +00:00
< / section >
< section class = "slide" >
2012-11-16 15:48:56 +00:00
< h2 > Polymorphism: < code > mappend (< >)< / code > < / h2 >
2012-11-08 17:20:55 +00:00
2012-11-16 15:48:56 +00:00
< pre class = "haskell" > < code > "abc" < > "def" = "abcdef" -- String
("ab","xy") < > ("AB","XY") = ("abAB","xyXY") -- (String,String)
3 < > 4 ⇒ ERROR which law? + or * -- Int
-- Use a type to remove ambiguity
type Sum = Sum {getSum :: a} -- Just a named box
2012-11-15 11:00:26 +00:00
-- Monoid (N,+)
(< >+) = getSum (Sum x < > Sum y)
3 < >+ 4 = 7
2012-11-16 15:48:56 +00:00
2012-11-15 11:00:26 +00:00
-- Monoid (N,*)
(< >*) = getProduct (Product x < > Product y)
3 < >* 4 = 12< / code > < / pre >
2012-11-08 17:20:55 +00:00
< / section >
< section class = "slide" >
2012-11-12 15:20:42 +00:00
< h2 > Polymorphism: < code > (>>=)< / code > < / h2 >
2012-11-08 17:20:55 +00:00
2012-11-09 16:05:27 +00:00
< p > Example: < span class = "red" > < code > (>>=)< / code > < / span > with < code > [a]< / code > and < code > Maybe a< / code > < / p >
< pre class = "haskell" > < code > data Maybe a = Just a | Nothing< / code > < / pre >
2012-11-16 15:48:56 +00:00
< pre class = "haskell" > < code > -- Maybe Int >>= Int -> Maybe (Int -> Int) >>= (Int -> Int) -> Maybe Int
2012-11-09 16:05:27 +00:00
(Just 2) < span class = "red" > > > =< / span > \x -> (Just (\z->z*z)) < span class = "red" > > > =< / span > \f -> Just (f x) = Just 4
Nothing < span class = "red" > > > =< / span > \x -> (Just (\z->z*z)) < span class = "red" > > > =< / span > \f -> Just (f x) = Nothing
2012-11-16 15:48:56 +00:00
-- [Int] >>= Int -> [Int -> Int] >>= (Int -> Int) -> [Int]
2012-11-09 16:05:27 +00:00
[1,2] < span class = "red" > > > =< / span > \x -> [(+10),(+20)] < span class = "red" > > > =< / span > \f -> [f x] = [11,21,12,22]
[] < span class = "red" > > > =< / span > \x -> [(+10),(+20)] < span class = "red" > > > =< / span > \f -> [f x] = []< / code > < / pre >
< / section >
< section class = "slide" >
< h2 > Programming Paradigms< / h2 >
< table >
< tr > < td > Impure< / td > < td > Choose the data structure, find an algorithm.< / td > < / tr >
< tr > < td > Untyped Pure< / td > < td > Choose the data structure, find an equation.< / td > < / tr >
< tr > < td > Typed Pure< / td > < td > Choose the Types and their laws, find the right operator< / td > < / tr >
< / table >
2012-11-08 17:20:55 +00:00
2012-10-27 12:41:18 +00:00
< / section >
< section class = "slide" >
2012-11-07 13:50:33 +00:00
< h2 > Type Theory ⇒ Categories< / h2 >
< ul >
< li > Type theory helped to remove paradoxes in Set Theory.< / li >
< li > Prevent relations between different kind of objects.< / li >
< li > Used in computer science< / li >
< / ul >
< ul >
< li > typed λ-calculus ⇒ cartesian closed categories< / li >
< li > untyped λ-calculus ⇒ C-monoids (subclass of categories)< / li >
< li > Martin-Löf type theories ⇒ locally cartesian closed categories< / li >
2012-11-02 14:25:55 +00:00
< / ul >
2012-10-27 12:41:18 +00:00
< / section >
2012-10-29 16:17:38 +00:00
< section class = "slide" >
2012-11-07 17:23:26 +00:00
< h2 > Plan< / h2 >
2012-11-08 17:20:55 +00:00
< ul style = "font-size: 2em; font-weight: bold" >
2012-11-07 17:23:26 +00:00
< li > Why?< / li >
2012-11-08 17:20:55 +00:00
< li > < span class = "yellow" > What?< / span >
2012-11-09 16:05:27 +00:00
< ul class = "base01" style = "border-left: 2px solid; padding-left: 1em; font-size: .6em; float: right; font-weight: bold; margin: 0 0 0 1em" >
2012-11-08 17:20:55 +00:00
< li > Category< / li >
< li > Intuition< / li >
< li > Examples< / li >
< li > Functor< / li >
< li > Examples< / li >
< / ul >
< / li >
2012-11-07 17:23:26 +00:00
< li > How?< / li >
< / ul >
< / section >
< section class = "slide" >
2012-11-08 15:31:54 +00:00
< h2 > Category< / h2 >
2012-11-05 16:43:28 +00:00
2012-11-08 15:31:54 +00:00
< p > A way of representing < strong > < em > things< / em > < / strong > and < strong > < em > ways to go between things< / em > < / strong > .< / p >
2012-11-08 14:13:15 +00:00
2012-11-05 16:43:28 +00:00
< p > A Category \(\mathcal{C}\) is defined by:< / p >
< ul >
< li > < em > Objects (\(\ob{C}\))< / em > ,< / li >
< li > < em > Morphisms (\(\hom{C}\))< / em > ,< / li >
< li > a < em > Composition law (∘)< / em > < / li >
< li > obeying some < em > Properties< / em > .< / li >
< / ul >
2012-10-29 16:17:38 +00:00
< / section >
< section class = "slide" >
2012-11-08 15:31:54 +00:00
< h2 > Category: Objects< / h2 >
2012-11-05 16:43:28 +00:00
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/objects.png" alt = "objects" / >
2012-11-07 13:50:33 +00:00
< p > \(\ob{\mathcal{C}}\) is a collection< / p >
< / section >
< section class = "slide" >
2012-11-08 15:31:54 +00:00
< h2 > Category: Morphisms< / h2 >
2012-11-07 13:50:33 +00:00
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/morphisms.png" alt = "morphisms" / >
2012-11-07 13:50:33 +00:00
< p > \(\hom{A,B}\) is a collection< / p >
2012-10-29 16:17:38 +00:00
< / section >
< section class = "slide" >
2012-11-08 15:31:54 +00:00
< h2 > Category: Composition< / h2 >
2012-11-09 16:05:27 +00:00
< p > Composition (∘): \(f:A→B, g:B→C\)
$$g∘f:A\rightarrow C$$
2012-11-02 14:25:55 +00:00
< / p >
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/composition.png" alt = "composition" / >
2012-10-29 16:17:38 +00:00
< / section >
< section class = "slide" >
2012-11-07 13:50:33 +00:00
< h2 > Category laws: neutral element< / h2 >
2012-11-09 16:05:27 +00:00
< p > for all \(X\), there is an \(\id_X\), s.t. for all \(f:A→B\):< / p >
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/identity.png" alt = "identity" / >
2012-11-07 13:50:33 +00:00
< / section >
< section class = "slide" >
< h2 > Category laws: Associativity< / h2 >
< p > Composition is associative:< / p >
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/associativecomposition.png" alt = "associative composition" / >
2012-10-29 16:17:38 +00:00
< / section >
2012-10-30 13:22:52 +00:00
< section class = "slide" >
2012-11-08 14:13:15 +00:00
< 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 >
2012-11-09 16:05:27 +00:00
\((h∘g)∘f = h∘(g∘f) \)
2012-11-08 14:13:15 +00:00
< / 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 >
2012-11-09 16:05:27 +00:00
\(id_B∘f = f = f∘id_A \)
2012-11-08 14:13:15 +00:00
< / figcaption >
< / figure >
< / section >
< section class = "slide" >
2012-11-09 16:05:27 +00:00
< h2 > Can this be a category?< / h2 >
2012-11-02 14:25:55 +00:00
< figure class = "left" >
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/cat-example1.png" alt = "Category example 1" / >
2012-11-02 14:25:55 +00:00
< figcaption class = "slide" >
2012-11-08 15:31:54 +00:00
< span class = "green" > YES< / span >
2012-11-02 14:25:55 +00:00
< / figcaption >
< / figure >
< figure class = "left" >
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/cat-example2.png" alt = "Category example 2" / >
2012-11-02 14:25:55 +00:00
< figcaption class = "slide" >
2012-11-09 16:05:27 +00:00
no candidate for \(g∘f\)
2012-11-08 15:31:54 +00:00
< br / > < span class = "red" > NO< / span >
2012-11-02 14:25:55 +00:00
< / figcaption >
< / figure >
< figure class = "left" >
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/cat-example3.png" alt = "Category example 3" / >
2012-11-02 14:25:55 +00:00
< figcaption class = "slide" >
< span class = "green" > YES< / span >
< / figcaption >
< / figure >
2012-11-08 15:31:54 +00:00
< / section >
< section class = "slide" >
2012-11-09 16:05:27 +00:00
< h2 > Can this be a category?< / h2 >
2012-11-02 14:25:55 +00:00
< figure class = "left" >
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/cat-example4.png" alt = "Category example 4" / >
2012-11-02 14:25:55 +00:00
< figcaption class = "slide" >
2012-11-09 16:05:27 +00:00
no candidate for \(f:C→B\)
2012-11-08 15:31:54 +00:00
< br / > < span class = "red" > NO< / span >
2012-11-02 14:25:55 +00:00
< / figcaption >
< / figure >
2012-11-08 15:31:54 +00:00
< figure class = "right" style = "min-width: 59%" >
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/cat-example5.png" alt = "Category example 5" / >
2012-11-02 14:25:55 +00:00
< figcaption class = "slide" >
2012-11-08 15:31:54 +00:00
\((h∘g)∘f=\id_B∘f=f\)< br / >
\(h∘(g∘f)=h∘\id_A=h\)< br / >
2012-11-09 16:05:27 +00:00
but \(h≠f\)< br / >
2012-11-08 15:31:54 +00:00
< span class = "red" > NO< / span >
2012-11-02 14:25:55 +00:00
< / figcaption >
< / figure >
< / section >
< section class = "slide" >
2012-11-16 15:48:56 +00:00
< h2 > Category \(\Set\)< / h2 >
2012-11-07 13:50:33 +00:00
< ul >
< li > \(\ob{\Set}\) are sets< / li >
< li > \(\hom{\Set}\) are functions< / 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 a < em > locally small category< / em > < / li >
< / ul >
< / section >
< section class = "slide" >
< h2 > Categories Everywhere?< / h2 >
2012-11-08 14:13:15 +00:00
< ul >
2012-11-09 16:43:35 +00:00
< 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 > \( \ML\): (types, terms, \(λg. λf. λx. g f x\) )< / li >
2012-11-16 15:48:56 +00:00
< li > \( \Hask\): (Haskell types, functions, < code > (.)< / code > )< / li >
2012-11-08 14:13:15 +00:00
< li > ...< / li >
< / ul >
< / section >
< section class = "slide" >
< h2 > Smaller Examples< / h2 >
2012-11-07 13:50:33 +00:00
< h3 > Strings< / h3 >
2012-11-15 11:00:26 +00:00
< img class = "right" style = "max-width:17%" src = "categories/img/mp/strings.png" alt = "Monoids are one object categories" / >
2012-11-07 13:50:33 +00:00
< 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 >
< / section >
< section class = "slide" >
2012-11-08 14:13:15 +00:00
< h2 > Finite Example?< / h2 >
< h3 > Graph< / h3 >
2012-11-15 11:00:26 +00:00
< figure class = "right" style = "max-width:40%" >
< img src = "categories/img/mp/graph-category.png" alt = "Each graph is a category" / >
< / figure >
2012-11-08 14:13:15 +00:00
< ul >
2012-11-15 11:00:26 +00:00
< li > \(\ob{G}\) are vertices< / li >
< li > \(\hom{G}\) each path< / li >
2012-11-08 14:13:15 +00:00
< li > ∘ is path concatenation< / li >
< / ul >
2012-11-16 15:48:56 +00:00
< ul > < li > \(\ob{G}=\{X,Y,Z\}\),
< / li > < li > \(\hom{G}=\{ε,α γ < br / >
\(\phantom{\hom{G}}=(β?γ
< / li > < li > \(αβ∘γ=αβγ\)
< / li > < / ul >
2012-11-08 14:13:15 +00:00
< / section >
< section class = "slide" >
2012-11-08 15:31:54 +00:00
< h2 > Degenerated Categories< / h2 >
2012-11-09 16:05:27 +00:00
< img class = "right" style = "max-width:17%" src = "categories/img/mp/monoid.png" alt = "Monoids are one object categories" / >
2012-11-08 15:31:54 +00:00
< h3 > Monoids< / h3 >
< p > each Monoid \((M,e,◎): \ob{M}=\{∙\},\hom{M}=M,\circ = ◎\)< / p >
< p > one object< / p >
2012-11-09 16:05:27 +00:00
< p > Examples: < code > (Integer,0,+)< / code > , < code > (Integer,1,*)< / code > , < code > (Strings,"",++)< / code > , < code > (Lists,[],++)< / code > , ...
2012-11-08 15:31:54 +00:00
< / section >
< section class = "slide" >
2012-11-08 14:13:15 +00:00
< 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" / >
< / section >
< section class = "slide" >
2012-11-16 15:48:56 +00:00
< h2 > Degenerated Categories: Preorders< / h2 >
2012-11-08 15:31:54 +00:00
< h3 > Preorders< / h3 >
2012-11-12 15:20:42 +00:00
< p > each preorder \((P,≤): \ob{P}={P},\hom{x,y}=\{{x≤y}\} ⇔ x≤y,f_{y,z} \circ f_{x,y} = f_{x,z} \)< / p >
2012-11-08 15:31:54 +00:00
< em > At most one morphism between two objects.< / em >
< img src = "categories/img/mp/preorder.png" alt = "preorder category" / >
< / section >
< section class = "slide" >
< h2 > Degenerated 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 > < em > Only identities ; not so interesting< / em > < / p >
< / section >
< section class = "slide" >
2012-11-16 15:48:56 +00:00
< h2 > Categorical Property< / h2 >
< p > Any property which can be expressed in term of category, objects, morphism and composition< / p >
< ul > < li > < em > isomorphism< / em > : \(f:A→B\) s.t. ∃g:B→A, \(g∘f=id_A\) < span class = "and" > & < / span > \(f∘g=id_B\)
< / li > < li > < em > Initial< / em > : \(Z\in\ob{C}\) s.t. \(∀Y∈\ob{C}, \#\hom{Z,Y}=1\)
< / li > < li > < em > Dual< / em > : reverse direction of arrows of \(\C\)
< / li > < li > < em > Functor< / em > : structure preserving mapping between categories
< / li > < li > ...
< / li > < / ul >
< / section >
< section class = "slide" >
2012-11-08 15:31:54 +00:00
< h2 > Functor< / h2 >
2012-11-02 14:25:55 +00:00
< p > A functor is a mapping between two categories.
Let \(\C\) and \(\D\) be two categories.
A < em > functor< / em > \(\F\) from \(\C\) to \(\D\):< / p >
< ul >
2012-11-02 16:21:45 +00:00
< li > Associate objects: \(A\in\ob{\C}\) to \(\F(A) \in\ob{\D}\) < / li >
< li > Associate morphisms: \(f:A\to B\) to \(\F(f) : \F(A) \to \F(B)\)
2012-11-02 14:25:55 +00:00
such that
< ul >
2012-11-02 16:21:45 +00:00
< li > \( \F (\id_X) = \id_{\F(X)} \),< / li >
< li > \( \F (g \circ_\C f) = \F(g) \circ_\D \F(f) \)< / li >
2012-11-02 14:25:55 +00:00
< / ul >
< / li >
< / ul >
2012-10-30 13:22:52 +00:00
< / section >
2012-11-02 16:21:45 +00:00
< section class = "slide" >
2012-11-09 16:05:27 +00:00
< h2 > Functor Example (ob → ob)< / h2 >
< img src = "categories/img/mp/functor.png" alt = "Functor" / >
< / section >
< section class = "slide" >
< h2 > Functor Example (hom → hom)< / h2 >
2012-11-02 16:21:45 +00:00
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/functor-morphism.png" alt = "Functor" / >
2012-11-05 16:43:28 +00:00
< / section >
< section class = "slide" >
2012-11-09 16:05:27 +00:00
< h2 > Functor Example< / h2 >
2012-11-05 16:43:28 +00:00
2012-11-07 16:05:48 +00:00
< img src = "categories/img/mp/functor-morphism-color.png" alt = "Functor" / >
2012-11-02 16:21:45 +00:00
< / section >
2012-11-12 15:20:42 +00:00
< section class = "slide" >
2012-11-16 10:42:05 +00:00
< h2 > Endofunctors< / h2 >
2012-11-16 15:48:56 +00:00
< p > An < em > endofunctor< / em > for \(\C\) is a functor \(F:\C→\C\).< / p >
2012-11-16 10:42:05 +00:00
< img src = "categories/img/mp/endofunctor.png" alt = "Endofunctor" / >
< / section >
< section class = "slide" >
< h2 > Category of Categories< / h2 >
< 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 >
< / section >
< section class = "slide" >
2012-11-12 15:20:42 +00:00
< 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 > Arrows
< / li > < li > κατα-morphisms
< / li > < / ul >
< / li >
< / ul >
< / section >
< section class = "slide" >
< h2 > Hask< / h2 >
< p > Category \(\Hask\):< / p >
2012-11-15 15:30:30 +00:00
< img class = "right" style = "max-width:30%" src = "categories/img/mp/hask.png" alt = "Haskell Category Representation" / >
2012-11-12 15:20:42 +00:00
< ul > < li >
2012-11-16 15:48:56 +00:00
\(\ob{\Hask} = \) Haskell types
2012-11-12 15:20:42 +00:00
< / li > < li >
2012-11-16 15:48:56 +00:00
\(\hom{\Hask} = \) Haskell functions
2012-11-12 15:20:42 +00:00
< / li > < li >
∘ = < code > (.)< / code > Haskell function composition
< / li > < / ul >
< p > Forget glitches because of < code > undefined< / code > .< / p >
< / section >
< section class = "slide" >
2012-11-16 10:42:05 +00:00
< h2 > Haskell Functor vs \(\Hask\) Functor< / h2 >
2012-11-15 11:00:26 +00:00
2012-11-16 10:42:05 +00:00
< p > Functor for Haskell language is a type < code > F< / code > which belong to the type class < code > Functor< / code > < / p >
< p > It must therefore implement an < code > fmap< / code > function.
2012-11-15 11:00:26 +00:00
2012-11-16 10:42:05 +00:00
< p > The couple < code > (F,fmap)< / code > is then a real functor in the categorical sense for \(\Hask\) if< / p >
< p > 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 >
2012-11-15 15:30:30 +00:00
< / li > < / ul >
< / section >
< section class = "slide" >
< h2 > Haskell Functors Example: Maybe< / h2 >
2012-11-12 15:20:42 +00:00
2012-11-16 15:48:56 +00:00
< pre class = "haskell" > < code > data Maybe a = Just a | Nothing
2012-11-15 15:30:30 +00:00
instance Functor Maybe where
fmap :: (a -> b) -> (Maybe a -> Maybe b)
fmap f (Just a) = f a
fmap f Nothing = Nothing
fmap (+1) (Just 1) == 2
fmap (+1) Nothing == Nothing
2012-11-16 15:48:56 +00:00
fmap head (Just [1,2,3]) == Just 1< / code > < / pre >
2012-11-15 15:30:30 +00:00
< / section >
< section class = "slide" >
< h2 > Haskell Functors Example: List< / h2 >
2012-11-12 15:20:42 +00:00
2012-11-15 15:30:30 +00:00
< pre class = "haskell" > < code >
instance Functor ([]) where
fmap :: (a -> b) -> [a] -> [b]
fmap = map
2012-11-12 15:20:42 +00:00
2012-11-15 15:30:30 +00:00
fmap (+1) [1,2,3] == [2,3,4]
fmap (+1) [] == []
fmap head [[1,2,3],[4,5,6]] == [1,4]
2012-11-12 15:20:42 +00:00
< / code > < / pre >
2012-11-15 15:30:30 +00:00
< / section >
< section class = "slide" >
< h2 > String like type< / h2 >
2012-11-12 15:20:42 +00:00
< pre class = "haskell" > < code >
2012-11-15 15:30:30 +00:00
data F a = Cons Char a | Nil
-- examples :
-- Cons 'c' 32 :: F Int
-- Cons 'c' (\x -> x*x) :: F (Int -> Int)
-- Cons 'c' (Cons 'a' (\x -> x*x)) :: F (F (Int -> Int))
-- Cons 'c' (Cons 'c' Nil) :: F (F (F))
-- note String is the fixed point of F: F(F(F(...)))
instance Functor F where
fmap :: (a -> b) -> [a] -> [b]
fmap f (Cons c x) = Cons c (f x)
fmap f Nil = Nil
fmap (+1) (Cons 'c' 3) == Cons 'c' 4
fmap (+1) Nil == Nil
fmap head (Cons 'c' [1,2,3])== Cons 'c' 1
2012-11-12 15:20:42 +00:00
< / code > < / pre >
< / section >
2012-11-15 15:30:30 +00:00
< section class = "slide" >
2012-11-16 15:48:56 +00:00
< h2 > Haskell Functor intuition< / h2 >
2012-11-15 15:30:30 +00:00
2012-11-16 15:48:56 +00:00
< p > Put normal function inside Box-like types< / p >
2012-11-15 15:30:30 +00:00
2012-11-16 15:48:56 +00:00
< img src = "categories/img/mp/boxfunctor.png" alt = "Haskell Functor as a box play" / >
2012-11-15 15:30:30 +00:00
< / section >
2012-11-16 10:42:05 +00:00
< section class = "slide" >
< 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 > of Hask.
< / li > < / ul >
< / section >
2012-11-16 15:48:56 +00:00
< section class = "slide" >
< 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 src = "categories/img/mp/hask-endofunctor.png" alt = "Haskell functor representation" / >
< / section >
2012-11-20 11:17:25 +00:00
< section class = "slide" >
2012-11-20 16:01:31 +00:00
< 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 src = "categories/img/mp/hask-endofunctor-objects.png" alt = "Haskell functor representation" / >
< / section >
< section class = "slide" >
< 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 src = "categories/img/mp/hask-endofunctor-morphisms.png" alt = "Haskell functor representation" / >
< / section >
< section class = "slide" >
2012-11-20 11:17:25 +00:00
< 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 > Also other degenerated examples:< / p >
< ul >
< li > F(< code > T< / code > )=< code > Int< / code > < / li >
2012-11-20 16:01:31 +00:00
< li > F(< code > f< / code > )=< code > \_-> 0< / code > < / li >
2012-11-20 11:17:25 +00:00
< / ul >
< / section >
< section class = "slide" >
< h2 id = "also-functor-inside-hask" > Also Functor inside \(\Hask\)< / h2 >
< p > < code > length< / code > can be seen as a Functor from the category < code > [a]< / code > to < code > Int< / code > . More precisely:< / p >
2012-11-20 16:01:31 +00:00
< ul class = "left" >
2012-11-20 11:17:25 +00:00
< li > \(\ob{\mathtt{[a]}}=\{∙\}\)< / li >
< li > \(\hom{\mathtt{[a]}}=\mathtt{[a]}\)< / li >
< li > \(∘=\mathtt{(++)}\)< / li >
< / ul >
2012-11-20 16:01:31 +00:00
< p class = "left" style = "margin:2em 3em" > ⇒< / p >
< ul class = "left" >
2012-11-20 11:17:25 +00:00
< li > \(\ob{\mathtt{Int}}=\{∙\}\)< / li >
< li > \(\hom{\mathtt{Int}}=\mathtt{Int}\)< / li >
< li > \(∘=\mathtt{(+)}\)< / li >
< / ul >
2012-11-20 16:01:31 +00:00
< 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 >
< / section >
< section class = "slide" >
< h2 id = "category-of-endofunctors" > Category of Endofunctors< / h2 >
< p > All endofunctors of \(\C\) form the category \(\E_\C\) of endofunctors of \(\C\).< / p >
< ul >
< li > \(\ob{\E_\C}\): endofunctors of \(\C\) ; \(F:\C→\C\)< / li >
< li > \(\hom{\E_\C}\): natural transformations ; \(η:F→G\) s.t.
< ul >
< li > η function \( \ob{\C} → \hom{\C}, f:X→Y, η(Y)∘F(f)=G(f)∘η(X) \)< / li >
< / ul > < / li >
< / ul >
< / section >
< section class = "slide" >
< h2 id = "monads" > Monads< / h2 >
< blockquote >
< p > A Monad is just a monoid in the category of endofunctors, what's the problem?< / p >
< / blockquote >
< blockquote >
< p > All told, a monad in X is just a monoid in the category of endofunctors of X, with product × < / p >
< / blockquote >
2012-11-20 11:17:25 +00:00
< / section >
2012-10-27 12:41:18 +00:00
<!-- End slides. -->
<!-- Begin extension snippets. Add or remove as needed. -->
<!-- deck.navigation snippet -->
< a href = "#" class = "deck-prev-link" title = "Previous" > ← < / a >
< a href = "#" class = "deck-next-link" title = "Next" > → < / a >
<!-- deck.status snippet -->
< p class = "deck-status" >
< span class = "deck-status-current" > < / span >
/
< span class = "deck-status-total" > < / span >
< / p >
<!-- deck.goto snippet -->
< form action = "." method = "get" class = "goto-form" >
< label for = "goto-slide" > Go to slide:< / label >
< input type = "text" name = "slidenum" id = "goto-slide" list = "goto-datalist" >
< datalist id = "goto-datalist" > < / datalist >
< input type = "submit" value = "Go" >
< / form >
<!-- deck.hash snippet -->
< a href = "." title = "Permalink to this slide" class = "deck-permalink" > #< / a >
<!-- End extension snippets. -->
<!-- Required JS files. -->
< script src = "jquery-1.7.2.min.js" > < / script >
< script src = "core/deck.core.js" > < / script >
<!-- Extension JS files. Add or remove as needed. -->
< script src = "core/deck.core.js" > < / script >
< script src = "extensions/hash/deck.hash.js" > < / script >
< script src = "extensions/menu/deck.menu.js" > < / script >
< script src = "extensions/goto/deck.goto.js" > < / script >
< script src = "extensions/status/deck.status.js" > < / script >
< script src = "extensions/navigation/deck.navigation.js" > < / script >
< script src = "extensions/scale/deck.scale.js" > < / script >
<!-- Initialize the deck. You can put this in an external file if desired. -->
< script >
$(function() {
$.deck('.slide');
});
< / script >
<!-- Y theme -->
2012-11-05 16:43:28 +00:00
< script src = "js/mathjax/MathJax.js?config=TeX-AMS-MML_HTMLorMML" > < / script >
2012-10-27 12:41:18 +00:00
< script src = "js/highlight/highlight.pack.js" > < / script >
< script >
hljs.initHighlightingOnLoad();
< / script >
< / body >
< / html >
