2 > data Boolean = FF | TT
3 > data Pair a b = MkPair a b
4 > data LList alpha = Nill | Conss alpha (LList alpha)
5 > data Nat = Zero | Succ Nat
6 > data Tree x = Leaf x | Node (Tree x) (Tree x)
7 > data A a = MkA a (A a)
10 > map :: (a -> b) -> [a] -> [b]
11 > map f xs = case xs of
13 > (y:ys) -> (f y):(map f ys)
15 > map_ide :: [[a]] -> [[a]]
16 > map_ide = map (\x->x)
25 > idBool :: Boolean -> Boolean
28 > fun :: (a->b) -> a -> b