comparison agda/delta/functor.agda @ 90:55d11ce7e223

Unify levels on data type. only use suc to proofs
author Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
date Mon, 19 Jan 2015 12:11:38 +0900
parents 5411ce26d525
children 8d92ed54a94f
comparison
equal deleted inserted replaced
89:5411ce26d525 90:55d11ce7e223
14 functor-law-1 : {l : Level} {A : Set l} -> (d : Delta A) -> (delta-fmap id) d ≡ id d 14 functor-law-1 : {l : Level} {A : Set l} -> (d : Delta A) -> (delta-fmap id) d ≡ id d
15 functor-law-1 (mono x) = refl 15 functor-law-1 (mono x) = refl
16 functor-law-1 (delta x d) = cong (delta x) (functor-law-1 d) 16 functor-law-1 (delta x d) = cong (delta x) (functor-law-1 d)
17 17
18 -- Functor-law-2 : T(f . g) = T(f) . T(g) 18 -- Functor-law-2 : T(f . g) = T(f) . T(g)
19 functor-law-2 : {l ll lll : Level} {A : Set l} {B : Set ll} {C : Set lll} -> 19 functor-law-2 : {l : Level} {A B C : Set l} ->
20 (f : B -> C) -> (g : A -> B) -> (d : Delta A) -> 20 (f : B -> C) -> (g : A -> B) -> (d : Delta A) ->
21 (delta-fmap (f ∙ g)) d ≡ (delta-fmap f) (delta-fmap g d) 21 (delta-fmap (f ∙ g)) d ≡ (delta-fmap f) (delta-fmap g d)
22 functor-law-2 f g (mono x) = refl 22 functor-law-2 f g (mono x) = refl
23 functor-law-2 f g (delta x d) = cong (delta (f (g x))) (functor-law-2 f g d) 23 functor-law-2 f g (delta x d) = cong (delta (f (g x))) (functor-law-2 f g d)
24 24