comparison similer.hs @ 2:a5210ec1e41b

Reduce definition
author Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
date Sun, 31 Aug 2014 18:41:02 +0900
parents 878d1e271709
children 3c5fbce357af
comparison
equal deleted inserted replaced
1:878d1e271709 2:a5210ec1e41b
1 {-# LANGUAGE FlexibleContexts #-} 1 {-# LANGUAGE FlexibleContexts #-}
2 data Similer a f b = Similer a (a -> b) b 2 data Similer a b = Similer a (a -> b) b
3 3
4 instance Functor (Similer a f) where 4 instance Functor (Similer a) where
5 fmap g (Similer a f b) = Similer a (g . f) $ g b 5 fmap g (Similer a f b) = Similer a (g . f) $ g b
6 6
7 eta :: a -> Similer a (a -> a) a 7 eta :: a -> Similer a a
8 eta a = Similer a id a 8 eta a = Similer a id a
9 9
10 --mu :: (Eq (Similer b (b -> c) c)) => Similer a (a -> (Similer b (b -> c) c)) (Similer b (b -> c) c) -> Similer b (b -> c) c 10 --mu :: (Eq (Similer b (b -> c) c)) => Similer a (a -> (Similer b (b -> c) c)) (Similer b (b -> c) c) -> Similer b (b -> c) c
11 mu :: (Eq (Similer b (b -> c) c)) => Similer a (a -> (Similer b (b -> c) c)) (Similer b (b -> c) c) -> Similer b (b -> c) c 11 mu :: (Eq (Similer b c)) => Similer a (Similer b c) -> Similer b c
12 mu (Similer a f b) = if ((f a) == b) then b else undefined 12 mu (Similer a f b) = if ((f a) == b) then b else undefined