From e79bee63985af144bac501f797be5f4346cfc83a Mon Sep 17 00:00:00 2001
From: "Yann Esposito (Yogsototh)" <Yann.Esposito@gmail.com>
Date: Sun, 9 Dec 2012 22:01:56 +0100
Subject: [PATCH] updated cata

---
 categories/30_How/300_Catamorphisms/030.md | 39 ++++++++++++++++++++++
 categories/30_How/300_Catamorphisms/040.md | 26 +++++++++++++++
 categories/30_How/300_Catamorphisms/050.md | 19 +++++++++++
 3 files changed, 84 insertions(+)
 create mode 100644 categories/30_How/300_Catamorphisms/030.md
 create mode 100644 categories/30_How/300_Catamorphisms/040.md
 create mode 100644 categories/30_How/300_Catamorphisms/050.md

diff --git a/categories/30_How/300_Catamorphisms/030.md b/categories/30_How/300_Catamorphisms/030.md
new file mode 100644
index 0000000..36b1ccc
--- /dev/null
+++ b/categories/30_How/300_Catamorphisms/030.md
@@ -0,0 +1,39 @@
+κατα-morphism: fold generalization
+----------------------------------
+
+Typically, you need a recursive type (list, trees, ...)
+
+Str = Cons Char Str
+
+1st: replace the recursive type by another type.
+StrChar a = Cons Char a
+Str' a = Mu StrChar
+
+Str' = InF { outF :: StrChar (Mu ListElement) }
+Str' = InF { outF :: StrChar (Str') }
+
+Clearly isomorph to List.
+
+~~~
+type Algebra f a = f a -> a
+data Mu f = InF { outF :: f (Mu f) }
+
+cata :: Functor f => Algebra f a -> Mu f -> a
+cata f = f . fmap (cata f) . outF
+
+-- Example with natural fold on String
+data StrF x = Cons Char x | Nil
+type Str = Mu StrF
+instance Functor StrF where
+  fmap f (Cons a as) = Cons a (f as)
+  fmap _ Nil = Nil
+
+length' :: Str -> Int
+length' = cata phi where
+  phi (Cons a b) = 1 + b
+  phi Nil = 0
+
+toMu :: [Char] -> Str
+toMu (x:xs) = InF { outF = Cons x (toMu xs) }
+toMu [] = InF { outF = Nil }
+~~~
diff --git a/categories/30_How/300_Catamorphisms/040.md b/categories/30_How/300_Catamorphisms/040.md
new file mode 100644
index 0000000..27d19e5
--- /dev/null
+++ b/categories/30_How/300_Catamorphisms/040.md
@@ -0,0 +1,26 @@
+κατα-morphism: example with strings
+-----------------------------------
+
+~~~
+type Algebra f a = f a -> a
+data Mu f = InF { outF :: f (Mu f) }
+
+cata :: Functor f => Algebra f a -> Mu f -> a
+cata f = f . fmap (cata f) . outF
+
+-- Example with natural fold on String
+data StrF x = Cons Char x | Nil
+type Str = Mu StrF
+instance Functor StrF where
+  fmap f (Cons a as) = Cons a (f as)
+  fmap _ Nil = Nil
+
+length' :: Str -> Int
+length' = cata phi where
+  phi (Cons a b) = 1 + b
+  phi Nil = 0
+
+toMu :: [Char] -> Str
+toMu (x:xs) = InF { outF = Cons x (toMu xs) }
+toMu [] = InF { outF = Nil }
+~~~
diff --git a/categories/30_How/300_Catamorphisms/050.md b/categories/30_How/300_Catamorphisms/050.md
new file mode 100644
index 0000000..5090e71
--- /dev/null
+++ b/categories/30_How/300_Catamorphisms/050.md
@@ -0,0 +1,19 @@
+κατα-morphism: example with strings
+-----------------------------------
+
+~~~
+type Algebra f a = f a -> a
+data Mu f = InF { outF :: f (Mu f) }
+
+cata :: Functor f => Algebra f a -> Mu f -> a
+cata f = f . fmap (cata f) . outF
+
+type Tree = Mu TreeF
+data TreeF x = Node Int [x]
+
+instance Functor TreeF where
+  fmap f (Node e xs) = Node e (fmap f xs)
+
+depth = cata phi where
+  phi (Node x sons) = 1 + foldr max 0 sons
+~~~