Mercurial > hg > Members > kono > Proof > category
annotate system-f.agda @ 348:d71ae57ed670
fix
| author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Sat, 03 May 2014 11:46:05 +0900 |
| parents | 87ad542e4145 |
| children | 5858351ac1b9 |
| rev | line source |
|---|---|
| 315 | 1 open import Level |
| 2 open import Relation.Binary.PropositionalEquality | |
| 3 | |
| 330 | 4 module system-f where |
| 315 | 5 |
| 336 | 6 Bool : {l : Level} (X : Set l) → Set l |
| 7 Bool = λ{l : Level} → λ(X : Set l) → X → X → X | |
| 315 | 8 |
| 336 | 9 T : {l : Level} (X : Set l) → Bool X |
| 10 T X = λ(x y : X) → x | |
| 315 | 11 |
| 336 | 12 F : {l : Level} (X : Set l) → Bool X |
| 13 F X = λ(x y : X) → y | |
| 315 | 14 |
| 336 | 15 D : {l : Level} → {U : Set l} → U → U → Bool U → U |
| 331 | 16 D u v t = t u v |
| 315 | 17 |
| 336 | 18 lemma04 : {l : Level} { U : Set l} {u v : U} → D {_} {U} u v (T U ) ≡ u |
| 315 | 19 lemma04 = refl |
| 20 | |
| 336 | 21 lemma05 : {l : Level} { U : Set l} {u v : U} → D {_} {U} u v (F U ) ≡ v |
| 315 | 22 lemma05 = refl |
| 23 | |
| 336 | 24 _×_ : {l : Level} → Set l → Set l → Set (suc l) |
| 25 _×_ {l} U V = {X : Set l} → (U → V → X) → X | |
| 315 | 26 |
| 336 | 27 <_,_> : {l : Level} {U V : Set l} → U → V → (U × V) |
| 28 <_,_> {l} {U} {V} u v = λ{X} → λ(x : U → V → X) → x u v | |
| 315 | 29 |
| 336 | 30 π1 : {l : Level} {U V : Set l} → (U × V) → U |
| 31 π1 {l} {U} {V} t = t {U} (λ(x : U) → λ(y : V) → x) | |
| 315 | 32 |
| 336 | 33 π2 : {l : Level} {U V : Set l} → (U × V) → V |
| 34 π2 {l} {U} {V} t = t {V} (λ(x : U) → λ(y : V) → y) | |
| 315 | 35 |
| 336 | 36 lemma06 : {l : Level} {U V : Set l } → {u : U } → {v : V} → π1 ( < u , v > ) ≡ u |
| 315 | 37 lemma06 = refl |
| 38 | |
| 336 | 39 lemma07 : {l : Level} {U V : Set l } → {u : U } → {v : V} → π2 ( < u , v > ) ≡ v |
| 315 | 40 lemma07 = refl |
| 41 | |
| 336 | 42 hoge : {l : Level} {U V : Set l} → U → V → (U × V) |
| 315 | 43 hoge u v = < u , v > |
| 44 | |
| 336 | 45 -- lemma08 : {l : Level} {U V : Set l } → {u : U } → (t : U × V) → < π1 t , π2 t > ≡ t |
| 46 -- lemma08 t = refl | |
| 316 | 47 |
| 48 -- Emp definision is still wrong... | |
| 49 | |
| 348 | 50 Emp : {l : Level} (U : Set l) → Set l |
| 51 Emp {l} = λ( U : Set l) → U | |
| 52 | |
| 53 -- Emp is not allowed because Emp is not a Set of any level | |
| 54 | |
| 55 -- t : Emp | |
| 56 -- t = ? | |
| 316 | 57 |
| 348 | 58 -- ε : {l : Level} (U : Set l) → Emp → U |
| 59 -- ε {l} U t = t U | |
| 316 | 60 |
| 348 | 61 -- lemma103 : {l : Level} {U V : Set l} → (u : U) → (t : Emp ) → (ε (U → V) t) u ≡ ε V t |
| 62 -- lemma103 u t = refl | |
| 63 | |
| 64 -- lemma09 : {l : Level} {U : Set l} → (t : Emp ) → ε U (ε Emp t) ≡ ε U t | |
| 322 | 65 -- lemma09 t = refl |
| 321 | 66 |
| 348 | 67 -- lemma10 : {l : Level} {U V X : Set l} → (t : Emp ) → U × V |
| 327 | 68 -- lemma10 {l} {U} {V} t = ε (U × V) t |
| 316 | 69 |
| 348 | 70 -- lemma10' : {l : Level} {U V X : Set l} → (t : Emp ) → Emp |
| 327 | 71 -- lemma10' {l} {U} {V} {X} t = ε (U × V) t |
| 72 | |
| 348 | 73 -- lemma100 : {l : Level} {U V X : Set l} → (t : Emp ) → Emp |
| 322 | 74 -- lemma100 {l} {U} {V} t = ε U t |
| 321 | 75 |
| 348 | 76 -- lemma101 : {l k : Level} {U V : Set l} → (t : Emp ) → π1 (ε (U × V) t) ≡ ε U t |
| 322 | 77 -- lemma101 t = refl |
| 319 | 78 |
| 348 | 79 -- lemma102 : {l k : Level} {U V : Set l} → (t : Emp ) → π2 (ε (U × V) t) ≡ ε V t |
| 322 | 80 -- lemma102 t = refl |
| 321 | 81 |
| 316 | 82 |
| 336 | 83 _+_ : {l : Level} → Set l → Set l → Set (suc l) |
| 84 _+_ {l} U V = {X : Set l} → ( U → X ) → (V → X) → X | |
| 316 | 85 |
| 336 | 86 ι1 : {l : Level } {U V : Set l} → U → U + V |
| 87 ι1 {l} {U} {V} u = λ{X} → λ(x : U → X) → λ(y : V → X ) → x u | |
| 316 | 88 |
| 336 | 89 ι2 : {l : Level } {U V : Set l} → V → U + V |
| 90 ι2 {l} {U} {V} v = λ{X} → λ(x : U → X) → λ(y : V → X ) → y v | |
| 316 | 91 |
| 336 | 92 δ : {l : Level} { U V R S : Set l } → (R → U) → (S → U) → ( R + S ) → U |
| 93 δ {l} {U} {V} {R} {S} u v t = t {U} (λ(x : R) → u x) ( λ(y : S) → v y) | |
| 316 | 94 |
| 336 | 95 lemma11 : {l : Level} { U V R S : Set _ } → (u : R → U ) (v : S → U ) → (r : R) → δ {l} {U} {V} {R} {S} u v ( ι1 r ) ≡ u r |
| 316 | 96 lemma11 u v r = refl |
| 97 | |
| 336 | 98 lemma12 : {l : Level} { U V R S : Set _ } → (u : R → U ) (v : S → U ) → (s : S) → δ {l} {U} {V} {R} {S} u v ( ι2 s ) ≡ v s |
| 316 | 99 lemma12 u v s = refl |
| 100 | |
| 101 | |
| 336 | 102 _××_ : {l : Level} → Set (suc l) → Set l → Set (suc l) |
| 103 _××_ {l} U V = {X : Set l} → (U → V → X) → X | |
| 322 | 104 |
| 336 | 105 <<_,_>> : {l : Level} {U : Set (suc l) } {V : Set l} → U → V → (U ×× V) |
| 106 <<_,_>> {l} {U} {V} u v = λ{X} → λ(x : U → V → X) → x u v | |
| 316 | 107 |
| 108 | |
| 336 | 109 Int : {l : Level } ( X : Set l ) → Set l |
|
337
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
110 Int X = X → ( X → X ) → X |
| 322 | 111 |
| 336 | 112 Zero : {l : Level } → { X : Set l } → Int X |
| 113 Zero {l} {X} = λ(x : X ) → λ(y : X → X ) → x | |
| 322 | 114 |
| 336 | 115 S : {l : Level } → { X : Set l } → Int X → Int X |
| 116 S {l} {X} t = λ(x : X) → λ(y : X → X ) → y ( t x y ) | |
| 322 | 117 |
| 336 | 118 n0 : {l : Level} {X : Set l} → Int X |
| 331 | 119 n0 = Zero |
| 326 | 120 |
| 336 | 121 n1 : {l : Level } → { X : Set l } → Int X |
| 122 n1 {_} {X} = λ(x : X ) → λ(y : X → X ) → y x | |
| 322 | 123 |
| 336 | 124 n2 : {l : Level } → { X : Set l } → Int X |
| 125 n2 {_} {X} = λ(x : X ) → λ(y : X → X ) → y (y x) | |
| 322 | 126 |
| 336 | 127 n3 : {l : Level } → { X : Set l } → Int X |
| 128 n3 {_} {X} = λ(x : X ) → λ(y : X → X ) → y (y (y x)) | |
| 323 | 129 |
| 336 | 130 n4 : {l : Level } → { X : Set l } → Int X |
| 131 n4 {_} {X} = λ(x : X ) → λ(y : X → X ) → y (y (y (y x))) | |
|
333
26f44a4fa494
factorial still have a problem
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
332
diff
changeset
|
132 |
| 336 | 133 lemma13 : {l : Level } → { X : Set l } → S (S (Zero {_} {X})) ≡ n2 |
| 331 | 134 lemma13 = refl |
| 322 | 135 |
| 336 | 136 It : {l : Level} {U : Set l} → U → ( U → U ) → Int U → U |
|
337
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
137 It u f t = t u f |
| 316 | 138 |
| 344 | 139 ItInt : {l : Level} {X : Set l} → Int X → ( Int X → Int X ) → Int X → Int X |
| 140 ItInt {l} {X} u f t = λ z s → t (u z s) ( λ w → (f (λ z' s' → w )) z s ) | |
| 323 | 141 |
| 345 | 142 R : {l : Level} { U X : Set l} → U → ( U → Int X → U ) → Int _ → U |
| 143 R {l} {U} {X} u v t = π1 ( It {suc l} {U × Int X} (< u , Zero >) (λ (x : U × Int X) → < v (π1 x) (π2 x) , S (π2 x) > ) t ) | |
| 336 | 144 |
|
337
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
145 -- bad adder which modifies input type |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
146 add' : {l : Level} {X : Set l} → Int (Int X) → Int X → Int X |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
147 add' x y = It y S x |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
148 |
| 336 | 149 add : {l : Level} {X : Set l} → Int X → Int X → Int X |
| 344 | 150 add x y = λ z s → x (y z s) s |
| 336 | 151 |
| 345 | 152 add'' : {l : Level} {X : Set l} → Int X → Int X → Int X |
| 153 add'' x y = ItInt y S x | |
| 154 | |
| 155 lemma22 : {l : Level} {X : Set l} ( x y : Int X ) → add x y ≡ add'' x y | |
| 156 lemma22 x y = refl | |
| 157 | |
| 339 | 158 -- bad adder which modifies input type |
| 159 mul' : {l : Level } {X : Set l} → Int X → Int (Int X) → Int X | |
| 160 mul' {l} {X} x y = It Zero (add x) y | |
| 324 | 161 |
| 339 | 162 mul : {l : Level } {X : Set l} → Int X → Int X → Int X |
| 344 | 163 mul {l} {X} x y = λ z s → x z ( λ w → y w s ) |
| 164 | |
| 165 mul'' : {l : Level } {X : Set l} → Int X → Int X → Int X | |
| 348 | 166 mul'' {l} {X} x y = ItInt Zero (add'' x) y |
|
338
2f21eb997559
sym of sum and mul in system T
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
337
diff
changeset
|
167 |
| 336 | 168 fact : {l : Level} {X : Set l} → Int _ → Int X |
| 339 | 169 fact {l} {X} n = R (S Zero) (λ z → λ w → mul z (S w)) n |
| 326 | 170 |
| 336 | 171 lemma13' : {l : Level} {X : Set l} → fact {l} {X} n4 ≡ mul n4 ( mul n2 n3) |
|
334
357d3114c9b5
add : Int X -> Int X -> Int X
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
333
diff
changeset
|
172 lemma13' = refl |
| 324 | 173 |
| 345 | 174 -- lemma23 : {l : Level} {X : Set l} ( x y : Int X ) → mul x y ≡ mul'' x y |
| 175 -- lemma23 x y = {!!} | |
| 176 | |
| 177 lemma24 : {l : Level } {X : Set l} → mul {l} {X} n4 n3 ≡ mul'' {l} {X} n3 n4 | |
| 178 lemma24 = refl | |
| 179 | |
| 344 | 180 |
| 336 | 181 -- lemma14 : {l : Level} {X : Set l} → (x y : Int X) → mul x y ≡ mul y x |
| 326 | 182 -- lemma14 x y = It {!!} {!!} {!!} |
| 323 | 183 |
| 336 | 184 lemma15 : {l : Level} {X : Set l} (x y : Int X) → mul {l} {X} n2 n3 ≡ mul {l} {X} n3 n2 |
| 324 | 185 lemma15 x y = refl |
| 323 | 186 |
| 344 | 187 lemma15' : {l : Level} {X : Set l} (x y : Int X) → mul'' {l} {X} n2 n3 ≡ mul'' {l} {X} n3 n2 |
| 188 lemma15' x y = refl | |
| 189 | |
| 336 | 190 lemma16 : {l : Level} {X U : Set l} → (u : U ) → (v : U → Int X → U ) → R u v Zero ≡ u |
| 324 | 191 lemma16 u v = refl |
| 192 | |
| 336 | 193 -- lemma17 : {l : Level} {X U : Set l} → (u : U ) → (v : U → Int → U ) → (t : Int ) → R u v (S t) ≡ v ( R u v t ) t |
| 324 | 194 -- lemma17 u v t = refl |
| 195 | |
| 336 | 196 -- postulate lemma17 : {l : Level} {X U : Set l} → (u : U ) → (v : U → Int X → U ) → (t : Int X ) → R u v (S t) ≡ v ( R u v t ) t |
| 316 | 197 |
| 336 | 198 List : {l : Level} (U X : Set l) → Set l |
| 347 | 199 List {l} = λ( U X : Set l) → X → ( U → X → X ) → X |
| 323 | 200 |
| 336 | 201 Nil : {l : Level} {U : Set l} {X : Set l} → List U X |
| 202 Nil {l} {U} {X} = λ(x : X) → λ(y : U → X → X) → x | |
| 325 | 203 |
| 336 | 204 Cons : {l : Level} {U : Set l} {X : Set l} → U → List U X → List U X |
| 205 Cons {l} {U} {X} u t = λ(x : X) → λ(y : U → X → X) → y u (t x y ) | |
| 325 | 206 |
| 336 | 207 l0 : {l : Level} {X X' : Set l} → List (Int X) (X') |
| 325 | 208 l0 = Nil |
| 209 | |
| 336 | 210 l1 : {l : Level} {X X' : Set l} → List (Int X) (X') |
| 325 | 211 l1 = Cons n1 Nil |
| 212 | |
| 336 | 213 l2 : {l : Level} {X X' : Set l} → List (Int X) (X') |
| 325 | 214 l2 = Cons n2 l1 |
| 323 | 215 |
| 336 | 216 l3 : {l : Level} {X X' : Set l} → List (Int X) (X') |
| 330 | 217 l3 = Cons n3 l2 |
| 218 | |
| 347 | 219 -- λ x x₁ y → y x (y x (y x x₁)) |
| 220 l4 : {l : Level} {X X' : Set l} → Int X → List (Int X) (X') | |
| 221 l4 x = Cons x (Cons x (Cons x Nil)) | |
|
337
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
222 |
| 347 | 223 ListIt : {l : Level} {U W : Set l} → W → ( U → W → W ) → List U W → W |
| 224 ListIt w f t = t w f | |
| 225 | |
| 226 LListIt : {l : Level} {U W : Set l} → List U W → ( U → List U W → List U W ) → List U W → List U W | |
| 227 LListIt {l} {U} {W} w f t = λ x y → t (w x y) (λ x' y' → (f x' (λ x'' y'' → y' )) x y ) | |
| 228 | |
| 348 | 229 -- Cdr : {l : Level} {U : Set l} {X : Set l} → List U X → List U X |
|
337
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
230 -- Cdr w = λ x → λ y → w x (λ x y → y) |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
231 |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
232 -- lemma181 :{l : Level} {U : Set l} {X : Set l} → Car Zero l2 ≡ n2 |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
233 -- lemma181 = refl |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
234 |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
235 -- lemma182 :{l : Level} {U : Set l} {X : Set l} → Cdr l2 ≡ l1 |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
236 -- lemma182 = refl |
| 323 | 237 |
| 348 | 238 Nullp : {l : Level} {U : Set (suc l)} { X : Set (suc l)} → List U (Bool X) → Bool X |
| 347 | 239 Nullp {_} {_} {X} list = ListIt (T X) (λ u w → (F X)) list |
| 240 | |
|
337
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
241 -- bad append |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
242 Append' : {l : Level} {U X : Set l} → List U (List U X) → List U X → List U X |
| 347 | 243 Append' {_} {_} {X} x y = ListIt y Cons x |
| 325 | 244 |
| 336 | 245 Append : {l : Level} {U : Set l} {X : Set l} → List U X → List U X → List U X |
| 246 Append x y = λ s t → x (y s t) t | |
| 325 | 247 |
| 347 | 248 Append'' : {l : Level} {U X : Set l} → List U X → List U X → List U X |
| 249 Append'' {_} {_} {X} x y = LListIt y Cons x | |
| 250 | |
| 336 | 251 lemma18 :{l : Level} {U : Set l} {X : Set l} → Append {_} {Int U} {X} l1 l2 ≡ Cons n1 (Cons n2 (Cons n1 Nil)) |
| 328 | 252 lemma18 = refl |
| 326 | 253 |
| 347 | 254 lemma18' :{l : Level} {U : Set l} {X : Set l} → Append'' {_} {Int U} {X} l1 l2 ≡ Cons n1 (Cons n2 (Cons n1 Nil)) |
| 255 lemma18' = refl | |
| 256 | |
| 257 lemma18'' :{l : Level} {U : Set l} {X : Set l} → Append'' {_} {Int U} {X} ≡ Append | |
| 258 lemma18'' = refl | |
| 259 | |
| 336 | 260 Reverse : {l : Level} {U : Set l} {X : Set l} → List U (List U X) → List U X |
| 347 | 261 Reverse {l} {U} {X} x = ListIt Nil ( λ u w → Append w (Cons u Nil) ) x |
| 348 | 262 -- λ x → x (λ x₁ y → x₁) (λ u w s t → w (t u s) t) |
| 330 | 263 |
| 336 | 264 lemma19 :{l : Level} {U : Set l} {X : Set l} → Reverse {_} {Int U} {X} l3 ≡ Cons n1 (Cons n2 (Cons n3 Nil)) |
| 330 | 265 lemma19 = refl |
| 266 | |
| 347 | 267 Reverse' : {l : Level} {U : Set l} {X : Set l} → List U X → List U X |
| 268 Reverse' {l} {U} {X} x = LListIt Nil ( λ u w → Append w (Cons u Nil) ) x | |
| 348 | 269 -- λ x x₁ y → x x₁ (λ x' y' → y') |
| 347 | 270 |
| 348 | 271 -- lemma19' :{l : Level} {U : Set l} {X : Set l} → Reverse' {_} {Int U} {X} l3 ≡ Cons n1 (Cons n2 (Cons n3 Nil)) |
| 272 -- lemma19' = {!!} | |
| 347 | 273 |
| 336 | 274 Tree : {l : Level} → Set l → Set l → Set l |
| 275 Tree {l} = λ( U X : Set l) → X → ( (U → X) → X ) → X | |
| 325 | 276 |
|
337
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
277 NilTree : {l : Level} {U : Set l} {X : Set l} → Tree U X |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
278 NilTree {l} {U} {X} = λ(x : X) → λ(y : (U → X) → X) → x |
| 325 | 279 |
|
337
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
280 Collect : {l : Level} {U : Set l} {X : Set l} → (U → Tree U X ) → Tree U X |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
281 Collect {l} {U} {X} f = λ(x : X) → λ(y : (U → X) → X) → y (λ(z : U) → f z x y ) |
| 325 | 282 |
| 336 | 283 TreeIt : {l : Level} {U W X : Set l} → W → ( (U → W) → W ) → Tree U W → W |
| 331 | 284 TreeIt w h t = t w h |
|
337
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
285 |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
286 t0 : {l : Level} {X X' : Set l} → Tree (Bool X) X' |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
287 t0 {l} {X} {X'} = NilTree |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
288 |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
289 t1 : {l : Level} {X X' : Set l} → Tree (Bool X) X' |
|
203593ff1e60
add Tree example ( not yet worked )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
336
diff
changeset
|
290 t1 {l} {X} {X'} = NilTree -- Collect (λ b → D b NilTree (λ c → Collect NilTree NilTree )) |