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)
10 map :: (a -> b) -> [a] -> [b]
13 (y:ys) -> (f y):(map f ys)
15 map_ide :: [[a]] -> [[a]]
25 idBool :: Boolean -> Boolean
28 fun :: (a->b) -> a -> b