Copyright | (c) Hanzhong Xu, Meng Meng 2016, |
---|---|
License | MIT License |
Maintainer | hanzh.xu@gmail.com |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell2010 |
- transSM2TF :: SM t (s, a) (s, b) -> TF s a b
- idTF :: TF s a a
- composeTF :: TF s b c -> TF s a b -> TF s a c
- arrTF :: (a -> b) -> TF s a b
- firstTF :: TF s a b -> TF s (a, c) (b, c)
- leftTF :: TF s a b -> TF s (Either a c) (Either b c)
- rightTF :: TF s a b -> TF s (Either c a) (Either c b)
- sumTF :: TF s a b -> TF s c d -> TF s (Either a c) (Either b d)
- faninTF :: TF s a c -> TF s b c -> TF s (Either a b) c
- appTF :: TF s (TF s a b, a) b
- loopTF :: TF s (a, c) (b, c) -> TF s a b
Documentation
transSM2TF :: SM t (s, a) (s, b) -> TF s a b Source #
transform `SM t (s, a) (s, b)` to `TF s a b`