diff --git a/categories.html b/categories.html
index cb46448..aec406f 100644
--- a/categories.html
+++ b/categories.html
@@ -94,16 +94,25 @@
Recent Math Field ; 1942-45, Samuel Eilenberg & Saunders Mac Lane Recent Math Field Certainly one of the more abstract branches of math From a Programmer perspective: Category Theory is a new language/framework for Math
+★: When is one thing equal to some other thing?, Barry Mazur, 2007 Math vocabulary used in this presentation: Category, Morphism, Associativity, Preorder, Functor, Endofunctor, Categorial property, Commutative diagram, Isomorph, Initial, Dual, Monoid Natural transformation, Monad, κατα-morphism, Category, Morphism, Associativity, Preorder, Functor, Endofunctor, Categorial property, Commutative diagram, Isomorph, Initial, Dual, Monoid Natural transformation, Monad, κατα-morphism, ... Most will be translated for the programmer.General Overview
-
1942-45, Samuel Eilenberg & Saunders Mac Lane
-
formalism abstraction, package entire theory
Physics, Quantum Physics, Topology, Logic, Computer Science
formalism abstraction, package entire theory★
Physics, Quantum Physics, Topology, Logic, Computer Science☆
+
☆: Physics, Topology, Logic and Computation: A Rosetta Stone, John C. Baez, Mike Stay, 2009
+Math Programming relation
@@ -117,9 +126,48 @@
-
-
+
+
+
+
+Mathematician
+
+Programmer
+
+
+Morphism
+
+Arrow
+
+
+Monoid
+
+String-like
+
+
+Preorder
+
+Acyclic graph
+
+
+Isomorph
+
+The same
+
+
+Natural transformation
+
+rearrangement function
+
+
+Funny Category
+
+LOLCat
+ Plan
@@ -327,9 +375,15 @@ such that for each \(f:A→B\):
each preorder \((P,≤): \ob{P}={P},\hom{x,y}=\{{x≤y}\} ⇔ x≤y,f_{y,z} \circ f_{x,y} = f_{x,z} \)
-At most one morphism between two objects. +each preorder \((P,≤)\):
+ +At most one morphism between two objects.
+Any property which can be expressed in term of category, objects, morphism and composition
-A functor is a mapping between two categories. Let \(\C\) and \(\D\) be two categories. -A functor \(\F\) from \(\C\) to \(\D\):
+A functor \(\F\) from \(\C\) to \(\D\):We can make function that can work for all type parameter. Such function can only work with the topology induced by the type. We know such function won't work on the elements.
-Sometimes, the type determine a lot about the function:
+Sometimes, the type determine a lot about the function★:
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 duplicate/remove/reorder elements
+-- can only rearrange: duplicate/remove/reorder elements
-- for example: the type of addOne isn't [a] -> [a]
-addOne l = map (+1) l
-
+addOne l = map (+1) l
+-- The (+1) force a to be a Num.
++
Recent Math Field ; 1942-45, Samuel Eilenberg & Saunders Mac Lane
+Recent Math Field
1942-45, Samuel Eilenberg & Saunders Mac Lane
Certainly one of the more abstract branches of math
From a Programmer perspective:
+Category Theory is a new language/framework for Math
+★: When is one thing equal to some other thing?, Barry Mazur, 2007
☆: Physics, Topology, Logic and Computation: A Rosetta Stone, John C. Baez, Mike Stay, 2009
+
★: When is one thing equal to some other thing?, Barry Mazur, 2007
+☆: Physics, Topology, Logic and Computation: A Rosetta Stone, John C. Baez, Mike Stay, 2009
Math vocabulary used in this presentation:
--Category, Morphism, Associativity, Preorder, Functor, Endofunctor, Categorial property, Commutative diagram, Isomorph, Initial, Dual, Monoid Natural transformation, Monad, κατα-morphism,
+Category, Morphism, Associativity, Preorder, Functor, Endofunctor, Categorial property, Commutative diagram, Isomorph, Initial, Dual, Monoid Natural transformation, Monad, κατα-morphism, ...
Most will be translated for the programmer.
+ ++Mathematician + | +Programmer + |
---|---|
+Morphism + | +Arrow + |
+Monoid + | +String-like + |
+Preorder + | +Acyclic graph + |
+Isomorph + | +The same + |
+Natural transformation + | +rearrangement function + |
+Funny Category + | +LOLCat + |
Mathematician | Programmer |
---|---|
Morphism | Arrow |
Monoid | String-like |
Preorder | Acyclic graph |
Isomorph | The same |
Natural transformation | rearrangement function |
Funny Category | LOLCat |
each preorder \((P,≤): \ob{P}={P},\hom{x,y}=\{{x≤y}\} ⇔ x≤y,f_{y,z} \circ f_{x,y} = f_{x,z} \)
-At most one morphism between two objects. +each preorder \((P,≤)\):
+ +At most one morphism between two objects.
+ diff --git a/categories/20_What/190_Categorical_Property.html b/categories/20_What/190_Categorical_Property.html index 65fd4d9..c3fecbf 100644 --- a/categories/20_What/190_Categorical_Property.html +++ b/categories/20_What/190_Categorical_Property.html @@ -2,9 +2,13 @@Any property which can be expressed in term of category, objects, morphism and composition
-A functor is a mapping between two categories. Let \(\C\) and \(\D\) be two categories. -A functor \(\F\) from \(\C\) to \(\D\):
+A functor \(\F\) from \(\C\) to \(\D\):We can make function that can work for all type parameter. Such function can only work with the topology induced by the type. We know such function won't work on the elements.
-Sometimes, the type determine a lot about the function:
+Sometimes, the type determine a lot about the function★:
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 duplicate/remove/reorder elements
+-- can only rearrange: duplicate/remove/reorder elements
-- for example: the type of addOne isn't [a] -> [a]
-addOne l = map (+1) l
-
+addOne l = map (+1) l
+-- The (+1) force a to be a Num.
++
★:Theorems for free!, Philip Wadler, 1989
diff --git a/categories/30_How/040_Haskell_Types.md b/categories/30_How/040_Haskell_Types.md index 2bd72dd..27e790d 100644 --- a/categories/30_How/040_Haskell_Types.md +++ b/categories/30_How/040_Haskell_Types.md @@ -5,7 +5,7 @@ We can make function that can work for _all_ type parameter. Such function can only work with the _topology_ induced by the type. We know such function won't work _on_ the elements. -Sometimes, the type determine a lot about the function: +Sometimes, the type determine a lot about the function★:fst :: (a,b) -> a -- Only one choice
snd :: (a,b) -> b -- Only one choice
@@ -13,6 +13,9 @@ f :: a -> [a] -- Many choices
-- Possibilities: f x=[], or [x], or [x,x] or [x,...,x]
? :: [a] -> [a] -- Many choices
--- can only duplicate/remove/reorder elements
+-- can only rearrange: duplicate/remove/reorder elements
-- for example: the type of addOne isn't [a] -> [a]
-addOne l = map (+1) l
+addOne l = map (+1) l
+-- The (+1) force a to be a Num.
+
+★:Theorems for free!, Philip Wadler, 1989 diff --git a/categories/img/eilenberg.gif b/categories/img/eilenberg.gif new file mode 100644 index 0000000..1766f70 Binary files /dev/null and b/categories/img/eilenberg.gif differ diff --git a/categories/img/lolcat.jpg b/categories/img/lolcat.jpg new file mode 100644 index 0000000..4cf82fb Binary files /dev/null and b/categories/img/lolcat.jpg differ diff --git a/categories/img/maclaine.jpg b/categories/img/maclaine.jpg new file mode 100644 index 0000000..d41bc72 Binary files /dev/null and b/categories/img/maclaine.jpg differ diff --git a/categories/img/readingcat.jpg b/categories/img/readingcat.jpg new file mode 100644 index 0000000..437a338 Binary files /dev/null and b/categories/img/readingcat.jpg differ diff --git a/themes/style/y/main.css b/themes/style/y/main.css index a05bb5d..d22b128 100644 --- a/themes/style/y/main.css +++ b/themes/style/y/main.css @@ -68,10 +68,18 @@ body.deck-container { color: #6c71c4; } .deck-container .blue { color: #268bd2; } + .deck-container .backblue { + border: solid 2px #268bd2; + border-radius: 2px; + background-color: rgba(38, 139, 210, 0.2); } .deck-container .cyan { color: #2aa198; } .deck-container .green { color: #859900; } + .deck-container .backgreen { + border: solid 2px #859900; + border-radius: 2px; + background-color: rgba(133, 153, 0, 0.2); } .deck-container div { font-family: "ComputerModernSansSerif", Helvetica, sans-serif; } .deck-container .and { @@ -260,6 +268,8 @@ body.deck-container { margin-top: 0; } .deck-container .small { font-size: 0.8em; } + .deck-container .smaller { + font-size: 0.6em; } .deck-container .sc { text-transform: uppercase; font-size: 0.8em; } @@ -469,10 +479,9 @@ body.deck-container { margin-bottom: 0; } .deck-container img, .deck-container .likeimg { max-width: 80%; - border: 2px solid #586e75; - background-color: #073642; - padding: 0.5em; - box-shadow: 0 0 10px #002b36 inset; + border: 2px solid #073642; + padding: 0.3em; + box-shadow: 0 0 0.5em black inset; border-radius: 0.5em; text-align: center; } .deck-container a:hover img { diff --git a/themes/style/y/main.sass b/themes/style/y/main.sass index 48f0c9d..219ca3e 100644 --- a/themes/style/y/main.sass +++ b/themes/style/y/main.sass @@ -213,10 +213,18 @@ body.deck-container color: $violet .blue color: $blue + .backblue + border: solid 2px $blue + border-radius: 2px + background-color: rgba(38,139,210,.2) .cyan color: $cyan .green color: $green + .backgreen + border: solid 2px $green + border-radius: 2px + background-color: rgba(133,153,0,.2) font-family: "ComputerModernSansSerif",Helvetica,sans-serif div @@ -399,6 +407,8 @@ body.deck-container // -- TYPOGRAPHY -- .small font-size: 0.8em + .smaller + font-size: 0.6em .sc +sc @@ -627,10 +637,9 @@ body.deck-container img,.likeimg max-width: 80% - border: 2px solid $borderColor - background-color: $imageBackgroundColor - padding: 0.5em - box-shadow: 0 0 10px $base03 inset + border: 2px solid $base02 + padding: 0.3em + box-shadow: 0 0 .5em #000 inset border-radius: 0.5em text-align: center a:hover img