Mercurial > hg > Papers > 2015 > atton-thesis
view src/exec_tail_in_haskell.txt @ 42:4cc65012412f
Add proofs of functor-laws on delta
author | Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp> |
---|---|
date | Fri, 13 Feb 2015 17:13:23 +0900 |
parents | fc44782929a7 |
children |
line wrap: on
line source
*Main> :type Main.tail Main.tail :: List a -> List a *Main> let list = Cons 100 (Cons 200 (Cons 300 Nil)) :: List Int *Main> :type list list :: List Int *Main> :type even :: Int -> Bool even :: Int -> Bool :: Int -> Bool *Main> :type (fmap even list) fmap even list :: List Bool *Main> :type Main.tail (fmap even list) Main.tail (fmap even list) :: List Bool *Main> :type (Main.tail list) Main.tail list :: List Int *Main> :type fmap even (Main.tail list) fmap even (Main.tail list) :: List Bool *Main> Main.tail (fmap even list) Cons True (Cons True Nil) *Main> fmap even (Main.tail list) Cons True (Cons True Nil)