source: LTS/Language.ma @ 3410

Last change on this file since 3410 was 3410, checked in by piccolo, 6 years ago

we just realized that correctness theorem is wrong in the way it is now
stated. It only holds for premeasurable traces.

File size: 72.7 KB
Line 
1(**************************************************************************)
2(*       ___                                                              *)
3(*      ||M||                                                             *)
4(*      ||A||       A project by Andrea Asperti                           *)
5(*      ||T||                                                             *)
6(*      ||I||       Developers:                                           *)
7(*      ||T||         The HELM team.                                      *)
8(*      ||A||         http://helm.cs.unibo.it                             *)
9(*      \   /                                                             *)
10(*       \ /        This file is distributed under the terms of the       *)
11(*        v         GNU General Public License Version 2                  *)
12(*                                                                        *)
13(**************************************************************************)
14
15include "basics/types.ma".
16include "Traces.ma".
17include "basics/lists/list.ma".
18include "../src/utilities/option.ma".
19include "basics/jmeq.ma".
20
21discriminator option.
22
23record instr_params : Type[1] ≝
24{ seq_instr : DeqSet
25; io_instr : DeqSet
26; cond_instr : DeqSet
27; loop_instr : DeqSet
28; act_params_type : DeqSet
29; return_type : DeqSet
30}.
31
32
33inductive Instructions (p : instr_params) : Type[0] ≝
34 | EMPTY : Instructions p
35 | RETURN : return_type p → Instructions p
36 | SEQ : (seq_instr p) → option NonFunctionalLabel → Instructions p → Instructions p
37 | COND : (cond_instr p) → NonFunctionalLabel → Instructions p →
38                 NonFunctionalLabel → Instructions p → Instructions p →
39                       Instructions p
40 | LOOP : (loop_instr p) → NonFunctionalLabel → Instructions p →
41                  NonFunctionalLabel → Instructions p → Instructions p
42 | CALL : FunctionName → (act_params_type p) → option ReturnPostCostLabel →
43            Instructions p → Instructions p
44 | IO : NonFunctionalLabel → (io_instr p) → NonFunctionalLabel → Instructions p →
45             Instructions p.
46
47let rec eq_instructions (p : instr_params) (i : Instructions p)
48 on i : (Instructions p) → bool ≝
49match i with
50[ EMPTY ⇒ λi'.match i' with [ EMPTY ⇒ true | _ ⇒ false ]
51| RETURN x ⇒ λi'.match i' with [ RETURN y ⇒ x == y | _ ⇒ false ]
52| SEQ x lab instr ⇒ λi'.match i' with
53                      [ SEQ y lab' instr' ⇒ x == y ∧ eq_instructions … instr instr' ∧
54                              match lab with [ None ⇒ match lab' with [ None ⇒ true | _ ⇒ false ]
55                                             | Some l1 ⇒ match lab' with [Some l2 ⇒ eq_nf_label l1 l2 | _ ⇒ false]
56                                             ]
57                      | _ ⇒ false
58                      ]
59| COND x ltrue i1 lfalse i2 i3 ⇒ λi'.match i' with
60                          [ COND y ltrue' i1' lfalse' i2' i3' ⇒
61                             x == y ∧ eq_nf_label ltrue ltrue' ∧
62                             eq_instructions … i1 i1' ∧ eq_nf_label lfalse lfalse' ∧
63                             eq_instructions … i2 i2' ∧ eq_instructions … i3 i3'
64                         | _ ⇒ false
65                         ]
66| LOOP x ltrue i1 lfalse i2 ⇒ λi'.match i' with
67              [ LOOP y ltrue' i1' lfalse' i2' ⇒ x == y ∧
68                      eq_instructions … i1 i1' ∧ eq_nf_label ltrue ltrue' ∧
69                      eq_instructions … i2 i2'
70              | _ ⇒ false
71              ]
72| CALL f act_p r_lb i1 ⇒ λi'.match i' with
73             [ CALL f' act_p' r_lb' i1' ⇒ eq_function_name f f' ∧
74                       act_p == act_p' ∧ eq_instructions … i1 i1' ∧
75                       match r_lb with [ None ⇒ match r_lb' with [None ⇒ true | _ ⇒ false]
76                                       | Some z ⇒ match r_lb' with [Some w ⇒  eq_return_cost_lab z w | _ ⇒ false ]
77                                       ]
78            | _ ⇒ false
79            ]
80| IO lin io lout i1 ⇒ λi'.match i' with
81             [ IO lin' io' lout' i1' ⇒ eq_nf_label lin lin' ∧ io == io' ∧
82                                       eq_nf_label lout lout' ∧ eq_instructions … i1 i1'
83             | _ ⇒ false                                       
84             ]
85].
86
87(*
88lemma eq_instructions_elim : ∀ P : bool → Prop.∀p,i1,i2.(i1 = i2 → P true) →
89(i1 ≠ i2 → P false) → P (eq_instructions p i1 i2).
90#P #p #i1 elim i1
91[* normalize [/2/ ] #x [|*: #y #z [2,3: #w1 #w2 [#w3] |4,5: #w1]] #_ #H2 @H2 % #EQ
92  lapply (eq_to_jmeq ??? EQ) #EQ' destruct(EQ')
93| #rt * normalize [2: #rt' cases (dec_eq … rt rt') #H [>(\b H) | >(\bf H) ] /2/
94  #_ #K @K % #abs lapply (eq_to_jmeq ??? abs) #abs' destruct(abs') @(absurd ?? H) //]
95  [|*: #x #y #z [2,3: #w1 #w2 [#w3] |4,5: #w1]] #_ #H2 @H2 % #EQ
96  lapply (eq_to_jmeq ??? EQ) #EQ' destruct(EQ')
97| cases daemon (*TODO*)
98qed.
99*)
100
101record env_params : Type[1] ≝
102{ form_params_type : Type[0]
103}.
104
105record signature (p : env_params) (p' : instr_params) : Type[0] ≝
106{ f_name : FunctionName
107; f_pars : form_params_type p
108; f_ret : return_type p'
109}.
110
111record env_item (p : env_params) (p' : instr_params) : Type[0] ≝
112{ f_sig :> signature p p'
113; f_lab : CallCostLabel
114; f_body : Instructions p'
115}.
116
117record state_params : Type[1] ≝
118{ i_pars :> instr_params
119; e_pars :> env_params
120; store_type : DeqSet
121}.
122
123record state (p : state_params) : Type[0] ≝
124{ code : Instructions p
125; cont : list (ActionLabel × (Instructions p))
126; store : store_type p
127; io_info : bool
128}.
129
130definition is_io : ∀p.state p → Prop ≝ λp,st.io_info … st = true.
131
132record sem_state_params (p : state_params) : Type[0] ≝
133{ eval_seq : seq_instr p → state p → option (store_type p)
134; eval_io : io_instr p → state p → option (store_type p)
135; eval_cond_cond : cond_instr p → state p → option (bool × (store_type p))
136; eval_loop_cond : loop_instr p → state p → option (bool × (store_type p))
137; eval_call : signature p p → act_params_type p → store_type p → option (store_type p)
138; eval_after_return : return_type p → store_type p → option (store_type p)
139; init_store : store_type p
140}.
141
142
143let rec lookup (p : env_params) (p' : instr_params) (l : list (env_item p p'))
144 on l : FunctionName → option (env_item p p') ≝
145match l with
146[ nil ⇒ λ_.None ?
147| cons x xs ⇒  λf.if (eq_function_name f (f_name … x))
148                  then Some ? x
149                  else lookup … xs f
150].
151
152definition is_ret_act : ActionLabel → Prop ≝
153λa.match a with [ret_act _ ⇒ True | _ ⇒ False ].
154
155inductive execute_l (p : state_params) (p' : sem_state_params p) (env : list (env_item p p)) :
156                                         ActionLabel → relation (state p) ≝
157| empty : ∀st,st',hd,tl.(code ? st) = (EMPTY p)→ (cont ? st) = hd :: tl →
158           (code ? st') = \snd hd → (cont … st') = tl → (store … st) = (store … st') →
159           (io_info … st = true → is_non_silent_cost_act (\fst hd)) →  (io_info … st') = false → ¬ is_ret_act (\fst hd) →  execute_l … (\fst hd) st st'
160| seq_sil : ∀st,st',i,cd,s,opt_l.(code ? st) = SEQ … i opt_l cd →
161             eval_seq … p' i st = return s → (code ? st') = cd →
162             (cont … st) = (cont … st') → (store … st') = s →
163             io_info … st = false →  io_info ? st' = false → execute_l … (cost_act opt_l) st st'
164| cond_true : ∀st,st',exp,ltrue,i_true,lfalse,i_false,cd,new_m.
165   (code ? st) = COND … exp ltrue i_true lfalse i_false cd → eval_cond_cond … p' exp st = return 〈true,new_m〉 →
166   cont ? st' = 〈cost_act (None ?),cd〉 ::(cont … st) → code … st' = i_true → store … st' = new_m →
167   io_info … st = false →  io_info … st' = false → execute_l … (cost_act (Some ? ltrue)) st st'
168| cond_false : ∀st,st',exp,ltrue,i_true,lfalse,i_false,cd,new_m.
169   (code ? st) = COND … exp ltrue i_true lfalse i_false cd → eval_cond_cond … p' exp st = return 〈false,new_m〉 →
170   cont ? st' = 〈cost_act (None ?),cd〉 ::(cont … st) → code … st' = i_false → store … st' = new_m →
171   io_info … st = false →  io_info … st' = false → execute_l … (cost_act (Some ? lfalse)) st st'
172| loop_true : ∀st,st',exp,ltrue,i_true,lfalse,i_false,new_m.
173   code ? st = LOOP … exp ltrue i_true lfalse i_false → eval_loop_cond … p' exp st = return 〈true,new_m〉 →
174   cont ? st' = 〈cost_act (None ?),LOOP … exp ltrue i_true lfalse i_false〉 :: (cont … st) →
175   code … st' = i_true → store … st' = new_m → io_info … st = false →  io_info … st' = false →
176   execute_l … (cost_act (Some ? ltrue)) st st'
177| loop_false : ∀st,st',exp,ltrue,i_true,lfalse,i_false,new_m.
178   code ? st = LOOP … exp ltrue i_true lfalse i_false → eval_loop_cond … p' exp st = return 〈false,new_m〉 →
179   cont ? st' = cont … st → code … st' = i_false → store … st = store … st' →
180   io_info … st = false →  io_info … st' = false → execute_l … (cost_act (Some ? lfalse)) st st'
181| io_in : ∀st,st',lin,io,lout,cd,mem.(code ? st) = IO … lin io lout cd →
182    eval_io … p' io st = return mem → code ? st' = EMPTY p →
183    cont … st' = 〈cost_act (Some ? lout),cd〉 :: (cont … st) → store … st' = mem →
184    io_info … st' = true → execute_l … (cost_act (Some ? lin)) st st'
185| call : ∀st,st',f,act_p,r_lb,cd,mem,env_it.(code ? st) = CALL … f act_p r_lb cd →
186    lookup … env f = return env_it →
187    eval_call ? p' env_it act_p (store … st) = return mem →
188    store ? st' = mem → code … st' = f_body … env_it →
189     cont … st' =
190       〈(ret_act r_lb),cd〉 :: (cont … st) → 
191    io_info … st = false →  (io_info … st') = false →
192    execute_l … (call_act f (f_lab ?? env_it)) st st'
193| ret_instr : ∀st,st',r_t,mem,tl',rb,cd.code ? st = RETURN … r_t →
194   cont … st = 〈ret_act rb,cd〉 :: tl' → cont ? st' = tl' →
195   io_info … st = false →  io_info ? st' = false →
196   eval_after_return … p' r_t (store … st) = return mem → code … st' = cd →
197   store … st' = mem → execute_l … (ret_act rb) st st'.
198   
199let rec get_labels_of_code (p : instr_params) (i : Instructions p) on i : list CostLabel ≝
200match i with
201[ EMPTY ⇒ [ ]
202| RETURN x ⇒ [ ]
203| SEQ x lab instr ⇒ let ih ≝ get_labels_of_code … instr in
204  match lab with [ None ⇒ ih | Some lbl ⇒ a_non_functional_label lbl :: ih ]
205| COND x ltrue i1 lfalse i2 i3 ⇒
206   let ih3 ≝ get_labels_of_code … i3 in
207   let ih2 ≝ get_labels_of_code … i2 in
208   let ih1 ≝ get_labels_of_code … i1 in
209   ltrue :: lfalse :: (ih1 @ ih2 @ih3)
210| LOOP x ltrue i1 lfalse i2 ⇒
211   let ih2 ≝ get_labels_of_code … i2 in
212   let ih1 ≝ get_labels_of_code … i1 in
213   a_non_functional_label ltrue :: a_non_functional_label lfalse :: (ih1 @ ih2)
214| CALL f act_p r_lb i1 ⇒
215   let ih1 ≝ get_labels_of_code … i1 in
216   match r_lb with [ None ⇒ ih1 | Some lbl ⇒ a_return_post lbl :: ih1]
217| IO lin io lout i1 ⇒
218   let ih1 ≝ get_labels_of_code … i1 in
219   a_non_functional_label lin :: a_non_functional_label lout :: ih1
220].
221
222include "basics/lists/listb.ma".
223include "../src/utilities/hide.ma".
224
225let rec no_duplicates (A : DeqSet) (l : list A) on l : Prop ≝
226match l with
227[ nil ⇒ True
228| cons x xs ⇒ ¬ (bool_to_Prop (x ∈ xs)) ∧ no_duplicates … xs
229].
230
231lemma no_duplicates_append_r : ∀A : DeqSet.∀l1,l2 : list A.no_duplicates … (l1 @ l2) →
232no_duplicates … l2.
233#A #l1 elim l1 // #x #xs normalize #IH #l2 * /2/
234qed.
235
236lemma no_duplicates_append_l : ∀A : DeqSet.∀l1,l2 : list A.no_duplicates … (l1 @ l2) →
237no_duplicates … l1.
238#A #l1 elim l1 // #x #xs normalize #IH #l2 * #H1 #H2 % [2: /2/ ]
239inversion(x ∈ xs @l2) in H1; normalize [ #_ * #H @⊥ @H %] #H1 #_
240% inversion(x ∈ xs) normalize [2: //] #H3 #_ >(memb_append_l1 … H3) in H1;
241#EQ destruct(EQ)
242qed.
243   
244record Program (p : env_params) (p' : instr_params) : Type[0] ≝
245{ env : list (env_item p p')
246; main : Instructions p'
247}.
248
249
250definition no_duplicates_labels : ∀p,p'.Program p p' → Prop ≝
251λp,p',prog.
252   no_duplicates …
253    (foldr … (λitem,acc.((a_call (f_lab … item)) :: get_labels_of_code … (f_body … item)) @ acc) (get_labels_of_code … (main … prog)) (env … prog)).
254
255lemma no_duplicates_domain_of_fun:
256 ∀p,p',prog.no_duplicates_labels … prog →
257 ∀f,env_it.lookup p p' (env … prog) f = return env_it →
258 no_duplicates … (get_labels_of_code … (f_body … env_it)).
259#p #p' * #env elim env [ #main normalize #_ #f #env_it #EQ destruct(EQ)]
260#x #xs #IH #main whd in ⊢ (% → ?); whd in match (foldr ?????); #H #f #env_it
261whd in ⊢ (??%? → ?); @eq_function_name_elim normalize nodelta
262[ whd in ⊢ (? → ???% → ?); #EQ1 #EQ2 destruct(EQ1 EQ2) cases H #_ /2/ ]
263#H1 #EQenv_it @IH cases H /2/
264qed.
265
266
267definition is_synt_succ : ∀p.relation (state p) ≝ λp,s1,s2.True.
268(* bisognerebbe confrontare la coda dell'istruzione corrente e la parte di stack fino alla prima label.
269 match (code … s1) with
270 [ CALL f act_p r_lb i1 ⇒ code … s2 = i1
271 | _ ⇒ False
272 ].
273*)
274
275definition operational_semantics : ∀p : state_params.∀p'.Program p p → abstract_status ≝
276λp,p',prog.mk_abstract_status
277                (state p)
278                (execute_l ? p' (env … prog))
279                (is_synt_succ …)
280                (λs.match (code … s) with
281                    [ COND _ _ _ _ _ _ ⇒ cl_jump
282                    | LOOP _ _ _ _ _ ⇒ cl_jump
283                    | EMPTY ⇒ if io_info … s then cl_io else cl_other
284                    | _ ⇒ cl_other
285                    ])
286                (λs.match (code … s) with
287                    [CALL _ _ m _ ⇒ match m with [ Some _ ⇒ true | None ⇒ false ]
288                    | _ ⇒ false
289                    ])
290                (λs.eq_instructions … (code … s) (main … prog) ∧ isnilb … (cont … s) ∧ store … s == init_store … p' ∧ io_info … s)
291                (λs.match (cont … s) with
292                    [ nil ⇒ match (code … s) with
293                            [ EMPTY ⇒ true
294                            | RETURN _ ⇒ true
295                            | _ ⇒ false
296                            ]
297                    | _ ⇒ false
298                    ])
299                ???.
300@hide_prf
301[ #s1 #s2 #l #H #H1 inversion H1 #st #st'
302 [ #hd #tl
303 | #i #cd #s #opt_l
304 |3,4: #exp #ltrue #i_true #lfalse #i_false #cd #new_m
305 |5,6: #exp #ltrue #i_true #lfalse #ifalse #new_m
306 | #lin #io #lout #cd #mem
307 | #f #act_p #r_lb #cd #mem #env_it
308 | #r_t #mem #tl #rb #cd
309 ]
310 #EQcode
311 [ #EQ1 #EQ2 #EQ3 #EQ4 #x #EQ5 #H2 #EQ' #EQ6 #EQ7
312 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQ6 #EQ7 #EQ8 #EQ9
313 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQ6 #EQ7 #EQ8 #EQ9
314 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQ6 #EQ7 #EQ8 #EQ9
315 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQ6 #EQ7 #EQ8 #EQ9
316 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQ6 #EQ7 #EQ8 #EQ9
317 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQ6 #EQ7 #EQ8
318 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQ6 #EQ7 #EQ8 #EQ9 #EQ10
319 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQ6 #EQ7 #EQ8 #EQ9 #EQ10
320 ]
321 #_ destruct >EQcode in H; normalize nodelta /2 by ex_intro/
322 [ cases(io_info ??) normalize nodelta] #EQ destruct
323| #s1 #s2 #l #H #H1 inversion H1 #st #st'
324 [ #hd #tl
325 | #i #cd #s #opt_l
326 |3,4: #exp #ltrue #i_true #lfalse #i_false #cd #new_m
327 |5,6: #exp #ltrue #i_true #lfalse #ifalse #new_m
328 | #lin #io #lout #cd #mem
329 | #f #act_p #r_lb #cd #mem #env_it
330 | #r_t #mem #tl #rb #cd
331 ]
332 #EQcode
333 [ #EQ1 #EQ2 #EQ3 #EQ4 #x #EQiost' #H2 #EQ' #EQ6 #EQ7
334 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQiost' #EQ7 #EQ8 #EQ9
335 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQiost' #EQ7 #EQ8 #EQ9
336 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQiost' #EQ7 #EQ8 #EQ9
337 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQiost' #EQ7 #EQ8 #EQ9
338 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQiost' #EQ7 #EQ8 #EQ9
339 | #EQ1 #EQ2 #EQ3 #EQ4 #EQiost' #EQ6 #EQ7 #EQ8
340 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQ6 #EQiost' #EQ8 #EQ9 #EQ10
341 | #EQ1 #EQ2 #EQ3 #EQiost' #EQ5 #EQ6 #EQ7 #EQ8 #EQ9 #EQ10
342 ]
343 #_ destruct
344 cases(code ? st') in H; normalize nodelta >EQiost' normalize nodelta
345 #eq destruct try (#eq1 destruct) try (#eq2 destruct) try (#eq3 destruct)
346 try (#eq4 destruct) try (#eq5 destruct) try (#eq6 destruct) %{lin} %
347| #s1 #s2 #l #H #H1 inversion H1 #st #st'
348 [ #hd #tl
349 | #i #cd #s #opt_l
350 |3,4: #exp #ltrue #i_true #lfalse #i_false #cd #new_m
351 |5,6: #exp #ltrue #i_true #lfalse #ifalse #new_m
352 | #lin #io #lout #cd #mem
353 | #f #act_p #r_lb #cd #mem #env_it
354 | #r_t #mem #tl #rb #cd
355 ]
356 #EQcode
357 [ #EQ1 #EQ2 #EQ3 #EQ4 #x #EQiost' #H2 #EQ' #EQ6 #EQ7
358 | #EQ1 #EQ2 #EQ3 #EQ4 #EQiost #EQiost' #EQ7 #EQ8 #EQ9
359 | #EQ1 #EQ2 #EQ3 #EQ4 #EQiost #EQiost' #EQ7 #EQ8 #EQ9
360 | #EQ1 #EQ2 #EQ3 #EQ4 #EQiost #EQiost' #EQ7 #EQ8 #EQ9
361 | #EQ1 #EQ2 #EQ3 #EQ4 #EQiost #EQiost' #EQ7 #EQ8 #EQ9
362 | #EQ1 #EQ2 #EQ3 #EQ4 #EQiost #EQiost' #EQ7 #EQ8 #EQ9
363 | #EQ1 #EQ2 #EQ3 #EQiost #EQiost' #EQ6 #EQ7 #EQ8
364 | #EQ1 #EQ2 #EQ3 #EQ4 #EQ5 #EQiost #EQiost' #EQ8 #EQ9 #EQ10
365 | #EQ1 #EQ2 #EQiost #EQiost' #EQ5 #EQ6 #EQ7 #EQ8 #EQ9 #EQ10
366 ]
367 #_ destruct >EQcode in H; normalize nodelta [|*: #EQ destruct]
368 cases(io_info … st) in x; normalize nodelta [2: #_ #EQ destruct]
369 #H3 #_ @H3 %
370]
371qed.
372
373let rec eqb_list (D : DeqSet) (l1 : list D) on l1 : list D → bool ≝
374match l1 with
375[ nil ⇒ λl2.match l2 with [nil ⇒ true | _ ⇒ false ]
376| cons x xs ⇒ λl2.match l2 with [ cons y ys ⇒ x == y ∧ eqb_list … xs ys | _ ⇒ false ]
377].
378
379definition DeqSet_List : DeqSet → DeqSet ≝
380λX.mk_DeqSet (list X) (eqb_list …) ?.
381#x elim x [ * /2 by refl, conj/ #y #ys normalize % #EQ destruct] -x
382#x #xs #IH * [ normalize % #EQ destruct] #y #ys normalize % inversion(x == y)
383#EQ normalize nodelta
384[ #H >(proj1 … (IH ys) H) @eq_f2 [2: %] @(proj1 … (eqb_true …)) assumption
385| #EQ destruct
386| #EQ1 destruct @(proj2 … (IH …)) %
387| #EQ1 destruct <EQ @(proj2 … (eqb_true …)) %
388]
389qed.
390
391unification hint  0 ≔ C;
392    X ≟ DeqSet_List C
393(* ---------------------------------------- *) ⊢
394    list C ≡ carr X.
395
396
397unification hint  0 ≔ D,p1,p2;
398    X ≟ DeqSet_List D
399(* ---------------------------------------- *) ⊢
400    eqb_list D p1 p2 ≡ eqb X p1 p2.
401
402definition associative_list : DeqSet → Type[0] → Type[0] ≝
403λA,B.list (A × (list B)).
404
405let rec update_list (A : DeqSet) (B : Type[0]) (l : associative_list A B)
406   on l : A → list B → associative_list A B ≝
407λa,b.match l with
408    [ nil ⇒ [〈a,b〉]
409    | cons x xs ⇒ if (a == (\fst x)) then 〈a,b〉 :: xs
410                  else x :: (update_list … xs a b) 
411    ].
412
413let rec get_element (A :DeqSet) (B : Type[0]) (l: associative_list A B) on l : A → list B ≝
414λa.match l with [ nil ⇒ nil ?
415                | cons x xs ⇒ if (a == \fst x) then \snd x else get_element … xs a
416                ].
417
418let rec domain_of_associative_list (A :DeqSet) (B : Type[0]) (l: associative_list A B) on l : list A ≝
419 match l with
420  [ nil ⇒ []
421  | cons x xs ⇒ \fst x :: domain_of_associative_list … xs
422  ].
423
424lemma get_element_append_l:
425 ∀A,B. ∀l1,l2: associative_list A B. ∀x.
426  x ∈ domain_of_associative_list … l1 →
427   get_element … (l1@l2) x = get_element … l1 x.
428#A #B #l1 elim l1 normalize [ #l2 #x * ] #hd #tl #IH #l2 #x cases (dec_eq … x (\fst hd))
429#H [ >(\b H) | >(\bf H) ] normalize /2/
430qed.
431
432lemma get_element_append_r:
433 ∀A,B. ∀l1,l2: associative_list A B. ∀x.
434  ¬ (bool_to_Prop (x ∈ domain_of_associative_list … l1)) →
435   get_element ?? (l1@l2) x = get_element … l2 x.
436#A #B #l1 elim l1 normalize [ #l2 #x // ] #hd #tl #IH #l2 #x cases (dec_eq … x (\fst hd))
437#H [ >(\b H) | >(\bf H) ] normalize /2 by/ * #K cases (K I)
438qed.
439
440lemma get_element_append_l1 :
441 ∀A,B. ∀l1,l2: associative_list A B. ∀x.
442  ¬ (bool_to_Prop (x ∈ domain_of_associative_list … l2)) →
443   get_element ?? (l1@l2) x = get_element … l1 x.
444#A #B #l1 elim l1 normalize [2: #x #xs #IH #l2 #a #H >IH // ]
445#l2 elim l2 // #y #ys #IH #a normalize cases(a == \fst y) normalize
446[ * #H @⊥ @H % ] #H @IH assumption
447qed.
448
449lemma get_element_append_r1 :
450 ∀A,B. ∀l1,l2: associative_list A B. ∀x.
451  ¬ (bool_to_Prop (x ∈ domain_of_associative_list … l1)) →
452   get_element ?? (l1@l2) x = get_element … l2 x.
453#A #B #l1 elim l1 normalize // #x #xs #IH #l2 #a cases (?==?)
454normalize [* #H cases H //] #H >IH normalize //
455qed.
456
457definition fresh_nf_label : ℕ → NonFunctionalLabel × ℕ ≝
458λx.〈a_non_functional_label x,S x〉.
459
460definition fresh_cc_labe : ℕ → CallCostLabel × ℕ ≝
461λx.〈a_call_label x,S x〉.
462
463definition fresh_rc_label : ℕ → ReturnPostCostLabel × ℕ ≝
464λx.〈a_return_cost_label x,S x〉.
465
466record call_post_info (p : instr_params) : Type[0] ≝
467{ gen_labels : list CostLabel
468; t_code : Instructions p
469; fresh : ℕ
470; lab_map : associative_list DEQCostLabel CostLabel
471; lab_to_keep : list CostLabel
472}.
473
474let rec call_post_trans (p : instr_params) (i : Instructions p) (n : ℕ) on i :
475list CostLabel → call_post_info p ≝
476λabs.
477match i with
478[ EMPTY ⇒ mk_call_post_info ? abs (EMPTY …) n (nil ?) (nil ?)
479| RETURN x ⇒ mk_call_post_info ? abs (RETURN … x) n (nil ?) (nil ?)
480| SEQ x lab instr ⇒
481   let ih ≝ call_post_trans … instr n abs in
482   match lab with
483   [ None ⇒ mk_call_post_info ? (gen_labels … ih) (SEQ … x (None ?) (t_code … ih))
484             (fresh … ih) (lab_map … ih) (lab_to_keep … ih)
485   | Some lbl ⇒
486      mk_call_post_info ? (nil ?) (SEQ … x (Some ? lbl) (t_code …  ih)) (fresh … ih)
487      (〈a_non_functional_label lbl,(a_non_functional_label lbl :: (gen_labels … ih))〉 :: (lab_map … ih))
488      (lab_to_keep … ih)
489   ]
490| COND x ltrue i1 lfalse i2 i3 ⇒
491   let ih3 ≝ call_post_trans … i3 n abs in
492   let ih2 ≝ call_post_trans … i2 (fresh … ih3) (gen_labels … ih3) in
493   let ih1 ≝ call_post_trans … i1 (fresh … ih2) (gen_labels … ih3) in
494   mk_call_post_info ? (nil ?) (COND … x ltrue (t_code … ih1) lfalse (t_code … ih2) (t_code … ih3))
495    (fresh … ih1) 
496    (〈a_non_functional_label ltrue,(a_non_functional_label ltrue :: (gen_labels … ih1))〉::
497      〈a_non_functional_label lfalse,(a_non_functional_label lfalse :: (gen_labels … ih2))〉::
498       ((lab_map … ih1) @ (lab_map …  ih2) @ (lab_map … ih3)))
499    ((lab_to_keep … ih1) @ (lab_to_keep … ih2) @ (lab_to_keep … ih3))
500| LOOP x ltrue i1 lfalse i2 ⇒
501   let ih2 ≝ call_post_trans … i2 n abs in
502   let ih1 ≝ call_post_trans … i1 (fresh … ih2) (nil ?) in
503   mk_call_post_info ? (nil ?) (LOOP … x ltrue (t_code … ih1) lfalse (t_code … ih2)) (fresh … ih1)
504    (〈a_non_functional_label lfalse,(a_non_functional_label lfalse :: (gen_labels … ih2))〉 ::
505     〈a_non_functional_label ltrue,(a_non_functional_label ltrue :: (gen_labels … ih1))〉 ::
506      ((lab_map … ih1) @ (lab_map … ih2)))
507    ((lab_to_keep … ih1) @ (lab_to_keep … ih2))
508| CALL f act_p r_lb i1 ⇒
509   let ih ≝ call_post_trans … i1 n abs in
510   match r_lb with
511   [ None ⇒ let 〈l',f''〉 ≝ fresh_rc_label (fresh … ih) in
512       mk_call_post_info ? ((a_return_post l')::(gen_labels … ih))
513         (CALL … f act_p (Some ? l') (t_code … ih))  f'' (lab_map … ih) (lab_to_keep … ih)
514   | Some lbl ⇒
515      mk_call_post_info ? (nil ?) (CALL ? f act_p (Some ? lbl) (t_code … ih)) (fresh … ih)
516       (〈a_return_post lbl,(a_return_post lbl :: (gen_labels … ih))〉 :: (lab_map … ih))
517       (a_return_post lbl :: lab_to_keep … ih)
518   ]
519| IO lin io lout i1 ⇒
520    let ih ≝ call_post_trans … i1 n abs in
521    mk_call_post_info ? (nil ?) (IO ? lin io lout (t_code … ih)) (fresh … ih)
522     (〈a_non_functional_label lout,(a_non_functional_label lout :: (gen_labels … ih))〉 ::
523      〈a_non_functional_label lin,[a_non_functional_label lin]〉 :: (lab_map … ih)) (lab_to_keep … ih)
524].
525
526
527let rec call_post_clean (p : instr_params) (i : Instructions p) on i :
528associative_list DEQCostLabel CostLabel → list CostLabel → list CostLabel →
529option ((list CostLabel) × (Instructions p)) ≝
530λm,keep,abs.
531 match i with
532[ EMPTY ⇒ Some ? 〈abs,EMPTY …〉
533| RETURN x ⇒ Some ? 〈abs,RETURN … x〉
534| SEQ x lab instr ⇒
535   ! 〈l,i1〉 ← call_post_clean … instr m keep abs;
536   match lab with
537   [ None ⇒ return 〈l,SEQ … x (None ?) i1〉
538   | Some lbl ⇒ if ((get_element … m lbl) == lbl :: l)
539                then return 〈nil ?,SEQ … x (Some ? lbl) i1〉
540                else None ?
541   ]
542| COND x ltrue i1 lfalse i2 i3 ⇒
543    ! 〈l3,instr3〉 ← call_post_clean … i3 m keep abs;
544    ! 〈l2,instr2〉 ← call_post_clean … i2 m keep l3;
545    ! 〈l1,instr1〉 ← call_post_clean … i1 m keep l3;
546    if ((get_element … m ltrue) == ltrue :: l1) ∧
547       ((get_element … m lfalse) == lfalse :: l2)
548    then return 〈nil ?,COND … x ltrue instr1 lfalse instr2 instr3〉
549    else None ?
550| LOOP x ltrue i1 lfalse i2 ⇒
551   ! 〈l2,instr2〉 ← call_post_clean … i2 m keep abs;
552   ! 〈l1,instr1〉 ← call_post_clean … i1 m keep (nil ?);
553   if ((get_element … m ltrue) == ltrue :: l1) ∧
554      ((get_element … m lfalse) == lfalse :: l2)
555   then return 〈nil ?,LOOP … x ltrue instr1 lfalse instr2〉
556   else None ?
557| CALL f act_p r_lb i1 ⇒
558  ! 〈l1,instr1〉 ← call_post_clean … i1 m keep abs;
559  match r_lb with
560  [ None ⇒ None ?
561  | Some lbl ⇒ if ((a_return_post lbl ∈ keep))
562               then if ((get_element … m lbl) == lbl :: l1)
563                    then return 〈nil ?,CALL … f act_p (Some ? lbl) instr1〉
564                    else None ?
565               else return 〈(a_return_post lbl) :: l1,CALL … f act_p (None ?) instr1〉
566  ]
567| IO lin io lout i1 ⇒
568   ! 〈l1,instr1〉 ← call_post_clean … i1 m keep abs;
569   if ((get_element … m lout) == lout :: l1) ∧ ((get_element … m lin) == [lin])
570   then return 〈nil ?,IO … lin io lout instr1〉
571   else None ?   
572].
573
574let rec foldr2 (A : Type[0]) (B : Type[0]) (C : Type[0]) (a : A) (l1 : list B)
575(l2 : list C) (f : A → B → C → A) on l1 : option A≝
576match l1 with
577[ nil ⇒ match l2 with [ nil ⇒ return a | cons y ys ⇒ None ? ]
578| cons x xs ⇒
579        match l2 with
580        [ nil ⇒ None ?
581        | cons y ys ⇒ ! ih ← (foldr2 … a xs ys f);
582                      return f ih x y
583        ]
584].
585
586definition is_silent_cost_act_b : ActionLabel → bool ≝
587λact. match act with
588 [ cost_act x ⇒ match x with [None ⇒ true | _ ⇒ false ] | _ ⇒ false].
589
590definition eq_ActionLabel : ActionLabel → ActionLabel → bool ≝
591λc1,c2.
592match c1 with
593[ call_act f l ⇒ match c2 with [ call_act f' l' ⇒ f == f' ∧ l == l' | _ ⇒ false]
594| ret_act x ⇒ match c2 with [ret_act y ⇒ match x with [ None ⇒ match y with [ None ⇒ true | _ ⇒ false]
595                                                      | Some l ⇒ match y with [ Some l' ⇒ l == l' | _ ⇒ false]
596                                                      ]
597                            | _ ⇒ false
598                            ]
599| cost_act x ⇒ match c2 with [cost_act y ⇒ match x with [ None ⇒ match y with [ None ⇒ true | _ ⇒ false]
600                                                        | Some l ⇒ match y with [ Some l' ⇒ l == l' | _ ⇒ false]
601                                                        ]
602                             | _ ⇒ false
603                             ]
604| init_act ⇒ match c2 with [init_act ⇒ true | _ ⇒ false]
605].
606
607definition ret_costed_abs : list CostLabel → option ReturnPostCostLabel → option CostLabel ≝
608λkeep,x.
609 match x with
610              [ Some lbl ⇒ if (a_return_post lbl) ∈ keep then return (a_return_post lbl)
611                           else None ?
612              | None ⇒ None ?
613              ].
614
615
616definition check_continuations : ∀p : instr_params.
617∀l1,l2 : list (ActionLabel × (Instructions p)).
618associative_list DEQCostLabel CostLabel →
619list CostLabel →  option (Prop × (list CostLabel) × (list CostLabel)) ≝
620λp,cont1,cont2,m,keep.
621foldr2 ??? 〈True,nil ?,nil ?〉 cont1 cont2
622 (λx,y,z.
623   let 〈cond,abs_top',abs_tail'〉 ≝ x in
624   match call_post_clean p (\snd z) m keep abs_top' with
625   [ None ⇒ 〈False,nil ?,nil ?〉
626   | Some w ⇒
627      match \fst z with
628       [ ret_act opt_x ⇒
629           match ret_costed_abs keep opt_x with
630           [ Some lbl ⇒ 〈\fst y = \fst z ∧ cond ∧ \snd w = \snd y ∧
631                               get_element … m lbl = lbl :: (\fst w),(nil ?),abs_tail'〉
632           | None ⇒
633              〈\fst y = ret_act (None ?) ∧ cond ∧ \snd w = \snd y,(nil ?),(\fst w) @ abs_tail'〉
634           ]
635       | cost_act opt_x ⇒
636           match opt_x with
637           [ None ⇒ 〈\fst y = \fst z ∧ cond ∧ \snd w = \snd y,\fst w,abs_tail'〉
638           | Some xx ⇒ 〈\fst y = \fst z ∧ cond ∧ \snd w = \snd y ∧
639                               get_element … m xx = xx :: (\fst w),(nil ?),abs_tail'〉]
640       | _ ⇒ (* dummy *) 〈False,nil ?,nil ?〉]]).
641
642(*
643definition check_continuations : ∀p : instr_params.
644∀l1,l2 : list (ActionLabel × (Instructions p)).
645associative_list DEQCostLabel CostLabel → list CostLabel → list CostLabel →
646list (list CostLabel) →  option (Prop × (list CostLabel) × (list (list CostLabel))) ≝
647λp,cont1,cont2,m,keep,abs_top,abs_tail.
648foldr2 ??? 〈True,abs_top,abs_tail〉 cont1 cont2
649 (λx,y,z.
650   let 〈cond,abs_top',abs_tail'〉 ≝ x in
651   match call_post_clean p (\snd z) m keep abs_top' with
652   [ None ⇒ 〈False,nil ?,nil ?〉
653   | Some w ⇒
654      match \fst z with
655       [ ret_act opt_x ⇒
656           match ret_costed_abs keep opt_x with
657           [ Some lbl ⇒ 〈\fst y = \fst z ∧ cond ∧ \snd w = \snd y ∧
658                               get_element … m lbl = lbl :: (\fst w),(nil ?),(nil ?) :: abs_tail'〉
659           | None ⇒
660              〈\fst y = ret_act (None ?) ∧ cond ∧ \snd w = \snd y,(nil ?),(\fst w) :: abs_tail'〉
661           ]
662       | cost_act opt_x ⇒
663           match opt_x with
664           [ None ⇒ 〈\fst y = \fst z ∧ cond ∧ \snd w = \snd y,\fst w,abs_tail'〉
665           | Some xx ⇒ 〈\fst y = \fst z ∧ cond ∧ \snd w = \snd y ∧
666                               get_element … m xx = xx :: (\fst w),(nil ?),abs_tail'〉]
667       | _ ⇒ (* dummy *) 〈False,nil ?,nil ?〉]]). *)
668(* in input :
669     abs_top is the list of labels to be propageted to the deepest level of the call stack
670     abs_tail are the lists of labels to be propagated to the levels "below" the deepest level
671   in output :
672     abs_top is the list of labels to be propageted from the current level of the call stack
673     abs_tail are the lists of labels to be propagated from the levels "below" the current level
674  *)       
675       
676
677definition state_rel : ∀p.
678associative_list DEQCostLabel CostLabel → list CostLabel → list CostLabel →(list CostLabel) →
679relation (state p) ≝ λp,m,keep,abs_top,abs_tail,st1,st2.
680match check_continuations ? (cont ? st1) (cont … st2) m keep with
681[ Some x ⇒ let 〈prf1,abs_top',abs_tail'〉 ≝ x in
682           prf1 ∧ call_post_clean … (code … st2) m keep abs_top' = return 〈abs_top,(code … st1)〉
683           ∧ store … st1 = store … st2 ∧ io_info … st1 = io_info … st2 ∧ abs_tail = abs_tail'
684| None ⇒ False
685].
686
687include "Simulation.ma".
688
689let rec len (S : abstract_status) (st1 : S) (st2 : S) (t : raw_trace S st1 st2)
690on t : ℕ ≝
691match t with
692[ t_base s ⇒ O
693| t_ind s1 s2 s3 l prf lt ⇒ (len … lt) + 1
694].
695(*
696lemma associative_max : ∀n1,n2,n3.max (max n1 n2) n3 = max n1 (max n2 n3).
697#n1 #n2 #n3 normalize @leb_elim normalize
698[ @leb_elim normalize
699  [ #H1 #H2 @leb_elim normalize
700    [ @leb_elim normalize // * #H @⊥ @H assumption 
701    | @leb_elim normalize
702      [ #H3 * #H @⊥ @H @(transitive_le … H1) assumption
703      | * #H @⊥ @H assumption
704      ]
705    ]
706  | #H1 #H2 @leb_elim normalize
707    [ @leb_elim normalize // #_ #H cases H1 #H1 @⊥ @H1 assumption
708    | @leb_elim normalize
709      [ #_ * #H @⊥ @H assumption
710      | * #H @⊥ @H @(transitive_le … H2)
711*)
712let rec compute_max_n (p : instr_params) (i : Instructions p) on i : ℕ ≝
713match i with
714[ EMPTY ⇒ O
715| RETURN x ⇒ O
716| SEQ x lab instr ⇒ let n ≝ compute_max_n … instr in
717                    match lab with
718                    [ None ⇒ n
719                    | Some l ⇒
720                        match l with
721                        [ a_non_functional_label n' ⇒ S (max n n') ]
722                    ]
723| COND x ltrue i1 lfalse i2 i3 ⇒
724  let n1 ≝ compute_max_n … i1 in
725  let n2 ≝ compute_max_n … i2 in
726  let n3 ≝ compute_max_n … i3 in
727  let mx ≝ max (max n1 n2) n3 in
728  match ltrue with
729  [ a_non_functional_label lt ⇒
730    match lfalse with
731    [a_non_functional_label lf ⇒ S (max (max mx lt) lf) ] ]
732| LOOP x ltrue i1 lfalse i2 ⇒
733   let n1 ≝ compute_max_n … i1 in
734   let n2 ≝ compute_max_n … i2 in
735   let mx ≝ max n1 n2 in
736   match ltrue with
737  [ a_non_functional_label lt ⇒
738    match lfalse with
739    [a_non_functional_label lf ⇒ S (max (max mx lt) lf) ] ]
740| CALL f act_p r_lb i1 ⇒
741   let n ≝ compute_max_n … i1 in
742   match r_lb with
743   [ None ⇒ n
744   | Some lbl ⇒ match lbl with [a_return_cost_label l ⇒ S(max l n) ]
745   ]
746| IO lin io lout i1 ⇒
747  let n ≝ compute_max_n … i1 in
748  match lin with
749  [a_non_functional_label l1 ⇒
750    match lout with
751    [a_non_functional_label l2 ⇒ S(max (max n l1) l2) ] ]
752].
753
754
755definition same_fresh_map_on : list CostLabel →
756relation (associative_list DEQCostLabel CostLabel) ≝
757λdom,m1,m2.∀x.bool_to_Prop (x ∈ dom) → get_element … m1 x = get_element … m2 x.
758
759definition same_to_keep_on : list CostLabel → relation (list CostLabel) ≝
760λdom,keep1,keep2.∀x. bool_to_Prop (x ∈ dom) → (x ∈ keep1) = (x ∈ keep2).
761
762lemma memb_not_append : ∀D : DeqSet.∀l1,l2 : list D.∀x : D.
763x ∈ l1 = false → x ∈ l2 = false → x ∈ (l1 @ l2) = false.
764#D #l1 elim l1
765[ #l2 #x #_ #H @H ]
766#x #xs #IH #l2 #x1 whd in match (memb ???); inversion (x1 == x) normalize nodelta
767[ #_ #EQ destruct] #EQx1 #EQxs #EQl2 whd in match (memb ???); >EQx1
768normalize nodelta @IH //
769qed.
770
771lemma memb_no_duplicates_append : ∀A : DeqSet.∀x.∀l1,l2 : list A .
772no_duplicates … (l1 @ l2) → x ∈  l1 → x ∈ l2 → False.
773#A #x #l1 elim l1 // #x1 #xs #IH #l2 * #H1 #H2 whd in match (memb ???);
774inversion (x == x1) normalize nodelta
775[ #H3 #_ #H4 >memb_append_l2 in H1; [2: <(\P H3) @H4 ] * #H @H %
776| #_ @IH //
777]
778qed.
779
780
781lemma same_to_keep_on_append : ∀dom1,dom2,dom3,l1,l2,l3,l.
782no_duplicates … (dom1@dom2@dom3) → (∀x.x ∈ l1 → x ∈ dom1) →
783(∀x.x ∈ l3 → x ∈ dom3) →
784same_to_keep_on (dom1@dom2@dom3) (l1@l2@l3) l →
785same_to_keep_on dom2 l2 l.
786#dom1 #dom2 #dom3 #l1 #l2 #l3 #l #no_dup #sub_set1 #sub_set3 #H2
787#x #Hx inversion (x ∈ l2)
788 [ #EQkeep <H2 [> memb_append_l2 // >memb_append_l1 // ]
789   >memb_append_l2 // >memb_append_l1 // >Hx //
790 | #EQno_keep <H2
791   [2: >memb_append_l2 // >memb_append_l1 // >Hx //
792   | @sym_eq @memb_not_append [2: @memb_not_append //]
793   [ <associative_append in no_dup; #no_dup ]
794   lapply(memb_no_duplicates_append … x … no_dup) #H
795   inversion(memb ???) // #H1 cases H
796   [1,4: [>memb_append_l2 | >memb_append_l1] // >Hx //
797   | @sub_set3 >H1 //
798   | @sub_set1 >H1 //
799   ]
800   ]
801 ]
802qed.
803
804lemma same_fresh_map_on_append : ∀dom1,dom2,dom3,l1,l2,l3,l.
805no_duplicates … (dom1 @dom2 @ dom3) → (∀x.x ∈ domain_of_associative_list … l1 → x ∈ dom1) →
806(∀x.x ∈ domain_of_associative_list … l3 → x ∈ dom3) →
807same_fresh_map_on … (dom1 @dom2 @dom3) (l1 @l2 @ l3) l →
808same_fresh_map_on … dom2 l2 l.
809#dom1 #dom2 #dom3 #l1 #l2 #l3 #l #no_dup #subset1 #subset3 whd in ⊢ (% → ?); #H1
810whd #x #Hx <H1
811[2: >memb_append_l2 // >memb_append_l1 // >Hx //]
812>get_element_append_r [ >get_element_append_l1 // ] % #K
813[ lapply(subset3 … K) | lapply(subset1 … K) ] #ABS
814[ <associative_append in no_dup; #no_dup] @(memb_no_duplicates_append … x … no_dup)
815// [>memb_append_l2 | >memb_append_l1 ] // >Hx //
816qed.
817
818
819lemma lab_to_keep_in_domain : ∀p.∀i : Instructions p.
820∀x,n,l.
821x ∈ lab_to_keep … (call_post_trans … i n l) → x ∈ get_labels_of_code …  i.
822#p #i elim i //
823[ #seq #opt_l #instr #IH #x #n #l whd in match (call_post_trans ????);
824  cases opt_l -opt_l normalize nodelta [|#lbl]
825  whd in match (get_labels_of_code ??); #H [2: @orb_Prop_r] /2/
826| #cond #ltrue #i1 #lfalse #i2 #i3 #IH1 #IH2 #IH3 #x #n #l
827  whd in match (call_post_trans ????); whd in match (get_labels_of_code ??);
828  #H cases(memb_append … H) -H #H @orb_Prop_r @orb_Prop_r
829  [ >memb_append_l1 // @IH1 [3: >H // |*: ]
830  | >memb_append_l2 // cases(memb_append … H) -H #H
831     [>memb_append_l1 // @IH2 [3: >H // |*: ]
832     | >memb_append_l2 // @IH3 [3: >H // |*: ]
833     ]
834  ]
835| #loop #ltrue #i1 #lfalse #i2 #IH1 #IH2 #x #n #l
836  whd in match (call_post_trans ????); whd in match (get_labels_of_code ??);
837  #H cases(memb_append … H) -H #H @orb_Prop_r @orb_Prop_r
838  [ >memb_append_l1 | >memb_append_l2 ] // [ @IH1 | @IH2 ] [3,6: >H |*: ] //
839| #f #act_p * [|#lbl] #i1 #IH #x #n #l whd in match (call_post_trans ????);
840  whd in match (get_labels_of_code ??); /2/ whd in match (memb ???);
841  inversion(x == lbl) #Hlbl normalize nodelta
842  [*  >(\P Hlbl) @orb_Prop_l @eq_costlabel_elim // * #H @H %
843  | #H @orb_Prop_r @IH //
844  ]
845| #lin #io #lout #i1 #IH #x #n #l whd in match (call_post_trans ????);
846  whd in match (get_labels_of_code ??); #H @orb_Prop_r @orb_Prop_r @IH //
847]
848qed.
849
850lemma domain_of_associative_list_append : ∀A,B.∀l1,l2 : associative_list A B.
851domain_of_associative_list ?? (l1 @ l2) =
852 (domain_of_associative_list ?? l1) @ (domain_of_associative_list ?? l2).
853#A #B #l1 elim l1 // #x #xs #IH #l2 normalize //
854qed.
855
856lemma lab_map_in_domain: ∀p.∀i: Instructions p.
857 ∀x,n,l.
858  x ∈ domain_of_associative_list … (lab_map p (call_post_trans … i n l)) →
859   x ∈ get_labels_of_code … i.
860#p #i elim i //
861[ #seq * [|#lbl] #i1 #IH #x #n #l whd in match(call_post_trans ????);
862  whd in match (get_labels_of_code ??); /2/ whd in match (memb ???);
863  inversion(x==lbl) #Hlbl normalize nodelta [#_ whd in match (memb ???); >Hlbl % ]
864  #H >memb_cons // @IH //
865| #cond #ltrue #i1 #lfalse #i2 #i3 #IH1 #IH2 #IH3 #x #n #l
866  whd in match (call_post_trans ????); whd in match (memb ???);
867  whd in match (get_labels_of_code ??); inversion(x == ltrue) #Hlbl normalize nodelta
868  [ #_ whd in match (memb ???); >Hlbl % ] whd in match (memb ???);
869  inversion(x == lfalse) #Hlbl1 normalize nodelta
870  [ #_ whd in match (memb ???); >Hlbl normalize nodelta whd in match (memb ???);
871    >Hlbl1 % ] #H >memb_cons // >memb_cons // >domain_of_associative_list_append in H;
872    #H cases(memb_append … H) [ #H1 >memb_append_l1 // @IH1 [3: >H1 // |*:] ]
873    >domain_of_associative_list_append #H1 cases(memb_append … H1)
874    #H2 >memb_append_l2 // [ >memb_append_l1 | >memb_append_l2 ] //
875    [ @IH2 | @IH3] /2 by eq_true_to_b/
876| #loop #ltrue #i1 #lfalse #i2 #IH1 #IH2 #x #n #l whd in match (call_post_trans ????);
877  whd in match (get_labels_of_code ??); whd in match (memb ???); inversion(x == lfalse)
878  #Hlfalse normalize nodelta [ #_ >memb_cons // whd in match (memb ???); >Hlfalse // ]
879  whd in match (memb ???); inversion(x==ltrue) normalize nodelta #Hltrue
880  [ #_ whd in match (memb ???); >Hltrue %] >domain_of_associative_list_append #H
881  cases(memb_append … H) #H1 >memb_cons // >memb_cons // [ >memb_append_l1 | >memb_append_l2 ]
882  // [ @IH1 | @IH2] /2/
883| #f #act_p * [|#lbl] #i1 #IH #x #n #l whd in match (call_post_trans ????);
884  whd in match (get_labels_of_code ??); /2/ whd in match (memb ???); inversion (x == lbl)
885  #Hlbl normalize nodelta [ #_ whd in match (memb ???); >Hlbl % ] #H >memb_cons // @IH /2/
886| #lin #io #lout #i1 #IH #x #n #l whd in match (memb ???); inversion(x == lout) #Hlout
887  normalize nodelta [ #_ >memb_cons // whd in match (memb ???); >Hlout % ]
888  whd in match (memb ???); inversion(x==lin) #Hlin normalize nodelta
889  [ #_ whd in match (memb ???); >Hlin % ] #H >memb_cons // >memb_cons // @IH /2/
890]
891qed.
892
893lemma eq_a_non_functional_label :
894∀c1,c2.c1 == c2 → a_non_functional_label c1 == a_non_functional_label c2.
895#c1 #c2 #EQ cases(eqb_true DEQNonFunctionalLabel c1 c2) #H1 #_ lapply(H1 (eq_true_to_b … EQ)) -EQ
896#EQ destruct >(\b (refl …)) @I
897qed.
898 
899lemma inverse_call_post_trans : ∀p : instr_params.∀i1 : Instructions p.∀n : ℕ.
900let dom ≝ get_labels_of_code … i1 in
901no_duplicates … dom →
902∀m,keep.
903∀info,l.call_post_trans p i1 n l = info →
904same_fresh_map_on dom (lab_map … info) m →
905same_to_keep_on dom (lab_to_keep … info) keep →
906call_post_clean … (t_code … info) m keep l
907 = return 〈gen_labels … info,i1〉.
908#p #i1 elim i1
909[ #n #no_dup #m #keep * #gen_lab #t_code #fresh #lab_map #lab_keep #l whd in ⊢ (??%? → ?);
910  #EQ destruct(EQ) //
911| #x #n #no_dup #m #keep * #gen_lab #t_code #fresh #lab_map #lab_keep #l whd in ⊢ (??%? → ?);
912  #EQ destruct(EQ) //
913| #seq * [|#lbl] #instr #IH #n #no_dup #m #keep * #gen_lab #t_code #fresh #lab_map #lab_keep
914  #l whd in ⊢ (??%? → ?); #EQ destruct(EQ) #H1 #H2 whd in ⊢ (??%%); normalize nodelta
915  >IH //
916  [1,4: whd whd in H2; #x #Hx @H2 whd in match (get_labels_of_code ??); //
917        @orb_Prop_r //
918  |2,5: whd whd in H1; #x #Hx [ @H1 // ] cases no_dup #H3 #_ <H1
919       [2: whd in match (get_labels_of_code ??); @orb_Prop_r // ]
920       whd in ⊢ (???%); cases(eqb_true … x lbl) inversion(x == lbl) normalize nodelta
921       [2: //] #_ #H4 >H4 in Hx; // #H5 >H5 in H3; * #ABS @⊥ @ABS %
922  |6: cases no_dup //
923  ]
924  normalize nodelta <(H1 lbl)
925  [2: whd in match (get_labels_of_code ??); @orb_Prop_l cases(eqb_true … (a_non_functional_label lbl) lbl)
926      #H3 #H4 >H4 % ]
927  whd in match (get_element ????); >(\b (refl …)) normalize nodelta
928  >(\b (refl …)) %
929| #cond #ltrue #i1 #lfalse #i2 #i3 #IH1 #IH2 #IH3 #n normalize nodelta
930  #no_dup #m #keep * #gen_lab #t_code #fresh #lab_map #lab_keep #l whd in ⊢ (??%? → ?);
931  #EQ destruct(EQ) #H1 #H2 whd in ⊢ (??%?); >IH3 //
932  [2: whd  in match (get_labels_of_code ??) in H2;
933      change with ([?;?]@?) in match (?::?) in H2;
934      <associative_append in H2; <associative_append
935      <(append_nil … (?@?)) <associative_append in ⊢ (??%? → ?);
936      <(append_nil … (?@?)) in ⊢ (??%? → ?); >associative_append
937      >associative_append in ⊢ (??%? → ?); #H2
938      @(same_to_keep_on_append … H2) // [ >append_nil
939      whd in ⊢ (??%); whd in no_dup:(??%); >associative_append // ]
940      #x #Hx cases (memb_append … Hx) -Hx #Hx @orb_Prop_r @orb_Prop_r
941      [ >memb_append_l1 | >memb_append_l2 ] //
942      @(lab_to_keep_in_domain … (eq_true_to_b … Hx))
943  |3: -H2 whd in match (get_labels_of_code ??) in H1;
944      change with ([?;?]@?) in match (?::?) in H1;
945      <associative_append in H1; <associative_append     
946      <(append_nil … (?@?)) >associative_append
947      change with ([?;?]@?) in match (?::?::?) in ⊢ (??%? → ?);
948      <associative_append in ⊢ (??%? → ?);
949      <associative_append in ⊢ (??%? → ?);
950      <(append_nil … (?@?)) in ⊢ (??%? → ?);
951      >associative_append in ⊢ (??%? → ?); #H1
952      @(same_fresh_map_on_append … H1) //
953      [ >append_nil >associative_append // ]
954      #x whd in match (memb ???); inversion(x == ltrue)
955      [ #Hltrue normalize nodelta #_ whd in match (memb ???); >Hltrue %
956      | #Hltrue normalize nodelta whd in match (memb ???); inversion(x == lfalse)
957         [ #Hlfalse #_ @orb_Prop_r @orb_Prop_l >Hlfalse %
958         | #Hlfalse normalize nodelta #Hx @orb_Prop_r @orb_Prop_r
959           >domain_of_associative_list_append in Hx; #H
960           cases(memb_append … H) #H2 [ >memb_append_l1 | >memb_append_l2 ]
961           // @(lab_map_in_domain … (eq_true_to_b … H2))
962         ]
963      ]
964  |4: cases no_dup #_ * #_ #H @no_duplicates_append_r [2: @(no_duplicates_append_r … H) |]
965  ]
966  normalize nodelta >IH2 //
967  [2: whd  in match (get_labels_of_code ??) in H2;
968   change with ([?;?]@?) in match (?::?) in H2;
969   <associative_append in H2; #H2
970   @(same_to_keep_on_append … H2) // #x #Hx [ @orb_Prop_r @orb_Prop_r ]
971   @(lab_to_keep_in_domain … (eq_true_to_b … Hx))
972  |3: whd  in match (get_labels_of_code ??) in H1;
973   change with ([?;?]@?) in match (?::?) in H1;
974   change with ([?;?]@?) in match (?::?::?) in H1 : (??%?);
975   <associative_append in H1; <associative_append in ⊢ (??%? → ?); #H1
976   @(same_fresh_map_on_append … H1) // [2: /2 by lab_map_in_domain/ ]
977   #x >domain_of_associative_list_append #H cases(memb_append … H)
978   [ whd in ⊢ (??%? → ?%); cases(x == ltrue) // normalize nodelta
979     whd in ⊢ (??%? → ?%); cases(x == lfalse) // normalize nodelta
980     normalize #EQ destruct
981   | #H1 @orb_Prop_r @orb_Prop_r
982     @(lab_map_in_domain … (eq_true_to_b … H1))
983   ]
984  |4: cases no_dup #_ * #_ #K lapply (no_duplicates_append_r … K) @no_duplicates_append_l
985  ]
986  >m_return_bind >IH1 //
987  [2:  whd  in match (get_labels_of_code ??) in H2;
988   change with ([?;?]@?) in match (?::?) in H2;
989   change with ([ ] @ ?) in match (lab_to_keep ??) in H2;
990   >associative_append in H2 : (??%?); #H2
991   @(same_to_keep_on_append … H2) // [ #x *] #x #Hx cases(memb_append … Hx)
992   -Hx #Hx [ >memb_append_l1 | >memb_append_l2] //
993   @(lab_to_keep_in_domain … (eq_true_to_b … Hx))
994  |3:  whd  in match (get_labels_of_code ??) in H1;
995   change with ([?;?]@?) in match (?::?) in H1;
996   change with ([?;?]@?) in match (?::?::?) in H1 : (??%?);
997    @(same_fresh_map_on_append … H1) // #x >domain_of_associative_list_append
998    #Hx cases(memb_append … Hx) -Hx #Hx [ >memb_append_l1 | >memb_append_l2 ]
999    // @(lab_map_in_domain … (eq_true_to_b … Hx))
1000  |4: cases no_dup #_ * #_ @no_duplicates_append_l
1001  ]
1002  >m_return_bind normalize nodelta whd in H1; <H1
1003  [2: whd in match (get_labels_of_code ??); whd in match (memb ???);
1004      >(\b (refl …)) % ] whd in match (get_element ????); >(\b (refl …))
1005      normalize nodelta >(\b (refl …)) <H1
1006      [2: whd in match (get_labels_of_code ??); >memb_cons //
1007      whd in match (memb ???); >(\b (refl …)) % ]
1008      whd in match (get_element ????); @eq_costlabel_elim normalize nodelta
1009      [ #ABS @⊥ cases no_dup >ABS * #H #_ @H @orb_Prop_l 
1010      >(\b (refl ? (a_non_functional_label ltrue))) % ] #_
1011      whd in match (get_element ????); >(\b (refl …)) normalize nodelta
1012      >(\b (refl …)) %
1013| #loop #ltrue #i1 #lfalse #i2 #IH1 #IH2 #n #no_dup #m #keep #info #l whd in ⊢ (??%? → ?);
1014  #EQ destruct(EQ) whd in match (get_labels_of_code ??); #fresh_map #keep_on
1015  whd in ⊢ (??%?); >IH2
1016  [ normalize nodelta >IH1
1017    [ >m_return_bind <fresh_map [2: @orb_Prop_l >(\b (refl …)) % ]
1018      whd in match (get_element ????);
1019      inversion(a_non_functional_label ltrue == a_non_functional_label lfalse)
1020      #Hltrue normalize nodelta
1021      [ cases no_dup whd in match (memb ???);
1022        cases(eqb_true … (a_non_functional_label ltrue) (a_non_functional_label lfalse))
1023        #H1 #_ lapply(H1 Hltrue) #EQ destruct(EQ) >(\b (refl …)) * #ABS @⊥ @ABS % ]
1024      whd in match (get_element ????); >(\b (refl …)) normalize nodelta >(\b (refl …))
1025      <fresh_map [2: @orb_Prop_r @orb_Prop_l >(\b (refl …)) % ]
1026      whd in match (get_element ????); >(\b (refl …)) normalize nodelta
1027      >(\b (refl …)) %
1028    | change with ([?;?]@?@?) in keep_on : (?%??); change with ((nil ?) @ ? @ ?) in keep_on : (??%?);
1029      @(same_to_keep_on_append … keep_on) // [ #x * | #x /2 by lab_to_keep_in_domain/ ]
1030    | change with ([?;?]@?@?) in fresh_map : (?%%?); @(same_fresh_map_on_append … fresh_map)
1031      /2 by lab_map_in_domain/ #x whd in match (memb ???); inversion(x==lfalse) #Hlfalse
1032      normalize nodelta
1033      [ #_ @orb_Prop_r whd in match (memb ???); >Hlfalse %
1034      | whd in match (memb ???); inversion(x==ltrue) #Hltrue normalize nodelta [2: *] #_
1035        @orb_Prop_l >Hltrue %
1036      ]
1037    | %
1038    | cases no_dup #_ * #_ /2/
1039    |
1040    ]
1041  | change with ([?;?]@?@?) in keep_on : (?%??); <associative_append in keep_on;
1042    <(append_nil … (?@?)) <(append_nil … (?@?)) in ⊢ (??%? → ?);
1043    >associative_append in ⊢ (?%%? → ?); >associative_append in ⊢ (??%? → ?);
1044    #keep_on @(same_to_keep_on_append … keep_on) //
1045    [ >associative_append >append_nil //
1046    | #x #Hx @orb_Prop_r @orb_Prop_r /2 by lab_to_keep_in_domain/
1047    ]
1048  | change with ([?;?]@?@?) in fresh_map : (?%??); <associative_append in fresh_map;
1049    <(append_nil … (?@?)) change with ([?;?]@?@?) in ⊢ (??%? → ?);
1050    <associative_append in ⊢ (??%? → ?); <(append_nil … (?@?)) in ⊢ (??%? → ?);
1051    >associative_append in ⊢ (?%%? → ?); >associative_append in ⊢ (??%? → ?);
1052    #fresh_map @(same_fresh_map_on_append … fresh_map) //
1053    [ >append_nil //
1054    | #x >domain_of_associative_list_append #Hx cases(memb_append … Hx)
1055      [2: #Hx1 @orb_Prop_r @orb_Prop_r @(lab_map_in_domain … (eq_true_to_b … Hx1)) ]
1056      whd in match (memb ???); inversion(x == lfalse) normalize nodelta #Hlfalse
1057      [ #_ @orb_Prop_r @orb_Prop_l >Hlfalse %
1058      | whd in match (memb ???); inversion (x==ltrue) normalize nodelta #Hltrue
1059        [ #_ @orb_Prop_l >Hltrue %
1060        | whd in match (memb ???); #EQ destruct
1061        ]
1062      ]
1063    ]
1064  | %
1065  | cases no_dup #_ * #_ /2 by no_duplicates_append_r/
1066  |
1067  ]
1068| #f #act_p * [|#r_lb] #i #IH #n #no_dup #m #keep #info #l whd in ⊢ (??%? → ?);
1069  #EQ destruct(EQ) cases daemon
1070|*: cases daemon (*TODO*)
1071]
1072qed.
1073
1074
1075definition trans_prog : ∀p,p'.Program p p' →
1076(Program p p') × (associative_list DEQCostLabel CostLabel) × (list CostLabel)≝
1077λp,p',prog.
1078let max_all ≝ foldl … (λn,i.max n (compute_max_n … (f_body … i))) O (env … prog) in
1079let 〈t_env,n,m,keep〉 ≝ (foldr ??
1080           (λi,x.let 〈t_env,n,m,keep〉 ≝ x in
1081           let info ≝ call_post_trans … (f_body … i) n (nil ?) in
1082                   〈(mk_env_item ??
1083                       (mk_signature ??(f_name ?? i) (f_pars … i) (f_ret … i))
1084                       (f_lab … i) (t_code … info)) :: t_env,
1085                     fresh … info, 〈a_call (f_lab … i),(a_call (f_lab … i)) :: (gen_labels ? info)〉 ::
1086                                     ((lab_map … info) @ m),(lab_to_keep … info) @ keep〉)
1087          (〈nil ?,max_all,nil ?,nil ?〉) (env … prog)) in
1088〈mk_Program ?? t_env (t_code … (call_post_trans … (main … prog) n (nil ?))),m,keep〉 .
1089
1090definition map_labels_on_trace :
1091(associative_list DEQCostLabel CostLabel) → list CostLabel → list CostLabel ≝
1092λm,l.foldr … (λlab,t.(get_element … m lab) @ t) (nil ?) l.
1093
1094lemma map_labels_on_trace_append:
1095 ∀m,l1,l2. map_labels_on_trace m (l1@l2) =
1096  map_labels_on_trace m l1 @ map_labels_on_trace m l2.
1097 #m #l1 elim l1 // #hd #tl #IH #l2 >associative_append <IH //
1098qed.
1099
1100include "../src/common/Errors.ma".
1101
1102axiom is_permutation: ∀A.list A → list A → Prop.
1103axiom is_permutation_eq : ∀A.∀l : list A.is_permutation … l l.
1104axiom is_permutation_cons : ∀A.∀l1,l2,x.is_permutation A l1 l2 →
1105                                       is_permutation A (x :: l1) (x :: l2).
1106
1107(*
1108inductive is_permutation (A : Type[0]) : list A → list A → Prop ≝
1109| p_empty : is_permutation A (nil ?) (nil ?)
1110| p_append : ∀x,x1,x2,y,y1,y2.
1111               x = y → is_permutation A (x1 @ x2) (y1 @ y2) →
1112                 is_permutation A (x1 @ [x] @ x2) (y1 @ [y] @ y2).
1113
1114lemma is_permutation_eq : ∀A.∀l : list A.is_permutation … l l.
1115#A #l elim l // #x #xs #IH
1116change with ((nil ?) @ (x :: xs)) in ⊢ (??%%);
1117>append_cons >associative_append
1118@(p_append ? x (nil ?) xs x (nil ?) xs (refl …)) @IH
1119qed.
1120
1121lemma is_permutation_append : ∀A.∀l1,l2,l3,l4 : list A.
1122is_permutation A l1 l3 → is_permutation A l2 l4 →
1123is_permutation A (l1 @ l2) (l3 @ l4).
1124#A #l1 inversion (|l1|)  [2: #n lapply l1 elim n
1125[ #l2 #l3 #l4 #H inversion H // #x #x1 #x2 #y #y1 #y2 #EQ #H1 #_
1126 #ABS cases(nil_to_nil … (sym_eq ??? ABS)) -ABS #_ #ABS
1127 cases(nil_to_nil … ABS) #EQ1 destruct(EQ1) ]
1128#x #xs #IH #l2 #l3 #l4 #H inversion H
1129[#EQ lapply(jmeq_to_eq ??? EQ) -EQ #EQ destruct(EQ) ]
1130#y #y1 #y2 #z #z1 #z2 #EQ destruct(EQ) #H1 #_ #EQx_xs #EQ destruct(EQ) #_
1131*)
1132
1133lemma memb_append_l22 : ∀A : DeqSet.∀x : A.∀l1,l2 : list A.
1134¬ (x ∈ l1) → x∈ l1 @ l2 = (x ∈ l2).
1135#A #x #l1 elim l1 normalize // #y #ys #IH #l2 cases(x==y)
1136normalize [*] @IH
1137qed.
1138
1139lemma memb_append_l12 : ∀A : DeqSet.∀x : A.∀l1,l2 : list A.
1140¬ (x ∈ l2) → x∈ l1 @ l2 = (x ∈ l1).
1141#A #x #l1 elim l1
1142[ #l2 #H whd in match (append ???); @not_b_to_eq_false @Prop_notb >H % ]
1143#y #ys #IH #l2 #H1 whd in match (memb ???); >IH //
1144qed.
1145
1146
1147lemma lookup_ok_append : ∀p,p',l,f,env_it.
1148lookup p p' l f = return env_it → ∃l1,l2. l = l1 @ [env_it] @ l2 ∧
1149f_name … env_it = f.
1150#p #p' #l elim l [ #f #env_it normalize #EQ destruct]
1151#x #xs #IH #f #env_it whd in ⊢ (??%? → ?); @eq_function_name_elim
1152[ #EQ destruct(EQ) normalize nodelta whd in ⊢ (???% → ?); #EQ destruct
1153  %{(nil ?)} %{xs} /2/
1154| #Hno_f normalize nodelta #EQ_env_it cases(IH … EQ_env_it)
1155  #l1 * #l2 * #EQ1 #EQ2 %{(x :: l1)} %{l2} >EQ1 /2/
1156]
1157qed.
1158(*
1159lemma foldr_append :
1160  ∀A,B:Type[0]. ∀l1, l2 : list A. ∀f:A → B → B. ∀seed. foldr ?? f seed (l1 @ l2) = foldr ?? f (foldr ?? f seed l2) l1.
1161#A #B #l1 elim l1 //
1162#hd #tl #Hind #l2 #f #seed normalize >Hind @refl
1163qed.
1164*)
1165
1166lemma foldr_map_append :
1167  ∀A,B:Type[0]. ∀l1, l2 : list A.
1168   ∀f:A → list B. ∀seed.
1169    foldr ?? (λx,acc. (f x) @ acc) seed (l1 @ l2) =
1170     append ? (foldr ?? (λx,acc. (f x) @ acc) (nil ?) l1)
1171       (foldr  ?? (λx,acc. (f x) @ acc) seed l2).
1172#A #B #l1 elim l1 normalize // /3 by eq_f, trans_eq/
1173qed.
1174
1175lemma cons_append : ∀A.∀x : A.∀l.x::l = ([x]@l).
1176//
1177qed.
1178
1179lemma eq_a_call_label :
1180∀c1,c2.c1 == c2 → a_call c1 == a_call c2.
1181#c1 #c2 #EQ cases(eqb_true ? c1 c2) #H1 #_ lapply(H1 (eq_true_to_b … EQ)) -EQ
1182#EQ destruct >(\b (refl …)) @I
1183qed.
1184
1185
1186lemma no_duplicates_append_commute : ∀ A : DeqSet.∀l1,l2 : list A.
1187no_duplicates … (l1 @ l2) →
1188no_duplicates … (l2 @ l1).
1189#A #l1 elim l1
1190[ #l2 >append_nil //]
1191#x #xs #IH #l2 * #H1 #H2 lapply(IH … H2) lapply H1 -H1 -IH -H2
1192elim l2 -l1
1193[ >append_nil #H1 #H2 % // ]
1194#y #ys #IH * #H1 * #H2 #H3 %
1195[2: @IH
1196   [ % #H4 @H1 cases(memb_append … H4)
1197     [ #H5 >memb_append_l1 //
1198     | #H5 >memb_append_l2 // @orb_Prop_r >H5 //
1199     ]
1200   | //
1201   ]
1202| % #H4 cases(memb_append … H4)
1203  [ #H5 @(absurd ?? H2) >memb_append_l1 //
1204  | whd in match (memb ???); inversion(y==x)
1205    [ #H5 #_ <(\P H5) in H1; #H1 @H1 >memb_append_l2 //
1206    | #_ normalize nodelta #H5 @(absurd ?? H2) >memb_append_l2 //
1207    ]
1208  ]
1209]
1210qed.
1211
1212
1213lemma trans_env_ok : ∀p : state_params.∀ prog.
1214no_duplicates_labels … prog →
1215let 〈t_prog,m,keep〉 ≝ trans_prog … prog in
1216∀f,env_it.lookup p p (env … prog) f = return env_it →
1217let dom ≝ get_labels_of_code … (f_body … env_it) in
1218∃env_it',n.lookup p p (env … t_prog) f = return env_it' ∧
1219let info ≝ call_post_trans … (f_body … env_it) n (nil ?) in
1220t_code … info = f_body … env_it' ∧
1221get_element … m (a_call (f_lab … env_it')) = (a_call (f_lab … env_it')) :: gen_labels … info ∧
1222f_sig … env_it = f_sig … env_it' ∧ f_lab … env_it = f_lab … env_it' ∧
1223same_fresh_map_on dom m (lab_map … info) ∧ same_to_keep_on dom keep (lab_to_keep … info).
1224#p * #env #main @pair_elim * whd in match trans_prog; normalize nodelta
1225@pair_elim generalize in match O; elim env
1226[ #fresh1 * #env' #fresh #x #_ #t_prog #m #keep #_ #_ #f #env_it normalize in ⊢ (% → ?);  #ABS destruct]
1227* #hd_sig #hd_lab #hd_code #tail #IH #fresh1 * #env' #fresh * #m' #keep'
1228normalize in ⊢ (% → ?); normalize nodelta @pair_elim * #env_tail #fresh_tail
1229* #m_tail #keep_tail #EQtail normalize nodelta #EQ1 destruct(EQ1) #t_prog
1230#m #keep #EQ2 destruct(EQ2)
1231whd in ⊢ (% → ?); whd in match (foldr ?????); * #Hhd_lab #H lapply(no_duplicates_append_r … H)
1232change with (no_duplicates_labels p p (mk_Program p p tail main)) in match
1233(no_duplicates_labels p p (mk_Program p p tail main)); #no_dup_tail
1234lapply(no_duplicates_append_l … H) #no_dup_head normalize nodelta
1235#f #env_it whd in ⊢ (??%? → ?); @eq_function_name_elim normalize nodelta
1236[ #EQ destruct(EQ) whd in ⊢ (???% → ?); #EQ destruct(EQ)
1237  inversion (call_post_trans … hd_code fresh_tail [])
1238  #gen_labs #t_hd_code #t_fresh #t_lab_map #t_lab_to_keep #EQ_trans_code
1239  %{(mk_env_item … hd_sig hd_lab t_hd_code)} %{fresh_tail} %
1240  [ whd in ⊢ (??%?); @eq_function_name_elim [2: * #H @⊥ @H %] #_ normalize nodelta
1241    @eq_f cases hd_sig // ] >EQ_trans_code % [% [ % [ % [% // whd in ⊢ (??%?); >(\b (refl …)) %] % ] % | whd
1242    #x #Hx whd in ⊢ (??%?); >(? : (x == hd_lab) = false)
1243    [2: inversion(x==hd_lab) // #EQx_hdlab cases Hhd_lab -Hhd_lab #Hhd_lab cases Hhd_lab
1244        >memb_append_l1 // <(\P EQx_hdlab) >Hx // ]
1245    normalize nodelta @get_element_append_l1 % #H1 
1246    (* subproof with no nice statement *)
1247    lapply H1 -H1 lapply H -H lapply Hhd_lab -Hhd_lab lapply EQtail -EQtail
1248    generalize in match (foldl ?????); lapply env_tail -env_tail lapply fresh_tail
1249    -fresh_tail lapply m_tail -m_tail lapply keep_tail -keep_tail -IH elim tail
1250    normalize nodelta
1251    [ #keep_tail #m_tail #fresh_tail #env_tail #n whd in ⊢ (??%? → ?);
1252      #EQ destruct(EQ) whd in match (foldr ?????);
1253      #H1 #H2 * ]
1254    #head #tail #IH #keep_tail #m_tail #fresh_tail #env_tail #n whd in ⊢ (??%? → ?);
1255    whd in match (foldr ?????);
1256    @pair_elim * #env_tail_res #fresh_tail_res * #lab_map_res #keep_res #EQres
1257    normalize nodelta #EQ destruct(EQ) whd in match (foldr ?????);
1258    #H1 #H2 whd in match (memb ???); inversion(x == ?)
1259    [ #H3 #_ <(\P H3) in H2; change with ([?]@?) in match (?::?); #H2
1260      lapply(no_duplicates_append_commute … H2) -H2 ** #ABS #_ @ABS
1261      >memb_append_l2 // >Hx %
1262    | #H3 normalize nodelta #H4 @(IH … EQres)
1263      [3: >domain_of_associative_list_append in H4; #H4 cases(memb_append … H4) [2: #EQ >EQ %]
1264          #ABS @⊥ @(memb_no_duplicates_append … x … H2) // @orb_Prop_r >memb_append_l1 //
1265          @(lab_map_in_domain … (eq_true_to_b … ABS))
1266      | % #ABS elim H1 -H1 #H1 @H1 cases(memb_append … ABS)
1267        [ #H5 >memb_append_l1 //
1268        | #H5 >memb_append_l2 // @orb_Prop_r >memb_append_l2 //
1269        ]
1270      | lapply(no_duplicates_append_commute … H2) * #_ >associative_append
1271        #h @no_duplicates_append_commute @(no_duplicates_append_r … h)
1272      ]
1273    ]
1274    ]
1275  | whd #x #Hx >memb_append_l12 // inversion(memb ???) // #ABS @(memb_no_duplicates_append … x … H)
1276    // @⊥
1277    (* subproof with no nice statement *)
1278    lapply ABS -ABS lapply H -H lapply Hhd_lab -Hhd_lab lapply EQtail -EQtail
1279    generalize in match (foldl ?????); lapply env_tail -env_tail lapply fresh_tail
1280    -fresh_tail lapply m_tail -m_tail lapply keep_tail -keep_tail -IH elim tail
1281    normalize nodelta
1282    [ #keep_tail #m_tail #fresh_tail #env_tail #n whd in ⊢ (??%? → ?);
1283      #EQ destruct(EQ) whd in match (foldr ?????);
1284      #H1 #H2 whd in ⊢ (??%? → ?); #EQ destruct ]
1285    #head #tail #IH #keep_tail #m_tail #fresh_tail #env_tail #n whd in ⊢ (??%? → ?);
1286    whd in match (foldr ?????);
1287    @pair_elim * #env_tail_res #fresh_tail_res * #lab_map_res #keep_res #EQres
1288    normalize nodelta #EQ destruct(EQ) whd in match (foldr ?????);
1289    #H1 #H2 #H3 cases(memb_append … H3) -H3
1290    [ #H3 change with ([?]@?) in match (?::?) in H2;
1291      lapply(no_duplicates_append_commute … H2) -H2 * #_ #H4 @(memb_no_duplicates_append … x … H4)
1292      [ whd in match (append ???); >memb_append_l1 // >(lab_to_keep_in_domain … (eq_true_to_b … H3)) %
1293      | //
1294      ]
1295    | #H3 normalize nodelta @(IH … EQres)
1296      [3: //
1297      |  % #ABS elim H1 -H1 #H1 @H1 cases(memb_append … ABS)
1298        [ #H5 >memb_append_l1 //
1299        | #H5 >memb_append_l2 // @orb_Prop_r >memb_append_l2 //
1300        ]
1301      | lapply(no_duplicates_append_commute … H2) * #_ >associative_append
1302        #h @no_duplicates_append_commute @(no_duplicates_append_r … h)
1303      ]
1304    ]
1305  ]
1306| #Hf #Henv_it cases(IH … no_dup_tail … Henv_it)
1307  [5: >EQtail in ⊢ (??%?); %
1308  |9: normalize nodelta %
1309  |*:
1310  ]
1311  #new_env_it * #new_fresh * #EQlook_new_env_it ***** #EQt_code #EQ_get_el
1312  #EQsign_env_it #EQ_f_lab #same_fresh_map #same_to_keep %{new_env_it} %{new_fresh}
1313  %
1314     [ whd in ⊢ (??%?); @eq_function_name_elim [ #ABS >ABS in Hf; * #H @⊥ @H %]
1315        #_ normalize nodelta assumption ]
1316   % [2: #x #Hx <same_to_keep // @memb_append_l22
1317        inversion(memb ???) // #ABS lapply(lab_to_keep_in_domain … (eq_true_to_b … ABS))
1318        #ABS1 @(memb_no_duplicates_append … x … H) //
1319        cases(lookup_ok_append … Henv_it) #l1 * #l2 * #EQ1 #EQ2 destruct(EQ1 EQ2)
1320        >foldr_map_append >memb_append_l2 // >foldr_map_append >memb_append_l1 //
1321        whd in match (foldr ?????); @orb_Prop_r >memb_append_l1 // >Hx % ]
1322   % [2: #x #Hx <same_fresh_map // >cons_append <associative_append @(get_element_append_r1)
1323         % >domain_of_associative_list_append #ABS cases(memb_append … ABS)
1324         [ whd in match (memb ???); inversion(x==hd_lab) normalize nodelta
1325           [2: #_ whd in match (memb ???); #EQ destruct ] #EQx_hdlab #_
1326               <(\P EQx_hdlab) in Hhd_lab; cases(lookup_ok_append … Henv_it)
1327               #tail1 * #tail2 * #EQ1 #EQ2 destruct >foldr_map_append >foldr_map_append
1328               * #ABS1 @ABS1 >memb_append_l2 // >memb_append_l2 //
1329               >memb_append_l1 // whd in ⊢ (??%?); cases(x==?) //
1330               normalize nodelta >memb_append_l1 // >Hx %
1331         | #ABS1 @(memb_no_duplicates_append … x … H)
1332           [ @(lab_map_in_domain … (eq_true_to_b … ABS1))
1333           | cases(lookup_ok_append … Henv_it)
1334             #tail1 * #tail2 * #EQ1 #EQ2 destruct >foldr_map_append >foldr_map_append
1335             >memb_append_l2 // >memb_append_l1 //
1336             whd in ⊢ (??%?); cases(x==?) //
1337             normalize nodelta >memb_append_l1 // >Hx %
1338           ]
1339         ]
1340     ] 
1341   % // % // % // <EQ_get_el >cons_append <associative_append
1342   @get_element_append_r1 % >domain_of_associative_list_append #ABS cases(memb_append … ABS)
1343         [ whd in match (memb ???); inversion(a_call (f_lab … new_env_it)== a_call hd_lab)
1344           #EQ_hdlab normalize nodelta
1345           [2: whd in ⊢ (??%? → ?); #EQ destruct ] 
1346           #_ <(\P EQ_hdlab) in Hhd_lab; cases(lookup_ok_append … Henv_it)
1347           #tail1 * #tail2 * #EQ1 #EQ2 destruct >foldr_map_append >foldr_map_append
1348           * #ABS1 @ABS1 >memb_append_l2 // >memb_append_l2 //
1349           >memb_append_l1 // whd in ⊢ (??%?); >EQ_f_lab >(\b (refl …)) //
1350         | #ABS1 @(memb_no_duplicates_append … (a_call (f_lab … new_env_it)) … H)
1351           [ @(lab_map_in_domain … (eq_true_to_b … ABS1))
1352           | cases(lookup_ok_append … Henv_it)
1353             #tail1 * #tail2 * #EQ1 #EQ2 destruct >foldr_map_append >foldr_map_append
1354             >memb_append_l2 // >memb_append_l1 //
1355             whd in ⊢ (??%?); >EQ_f_lab >(\b (refl …)) //
1356           ]
1357         ]
1358]
1359qed.
1360
1361
1362
1363lemma correctness : ∀p,p',prog.
1364no_duplicates_labels … prog →
1365let 〈t_prog,m,keep〉 ≝ trans_prog … prog in
1366∀s1,s2,s1' : state p.∀abs_top,abs_tail.
1367∀t : raw_trace (operational_semantics … p' prog) s1 s2.
1368state_rel … m keep abs_top abs_tail s1 s1' →
1369∃abs_top',abs_tail'.∃s2'.∃t' : raw_trace (operational_semantics … p' t_prog) s1' s2'.
1370state_rel  … m keep abs_top' abs_tail' s2 s2' ∧
1371is_permutation ? ((abs_top @ (map_labels_on_trace m (get_costlabels_of_trace … t))) @ abs_tail) 
1372                 (((get_costlabels_of_trace … t') @ abs_top' ) @ abs_tail') ∧
1373 len … t = len … t'.
1374#p #p' #prog #no_dup @pair_elim * #t_prog #m #keep #EQtrans
1375#s1 #s2 #s1' #abs_top #abs_tail #t lapply abs_top -abs_top lapply abs_tail
1376-abs_tail lapply s1' -s1' elim t
1377[ #st #s1' #abs_tail #abs_top #H %{abs_top} %{abs_tail} %{s1'} %{(t_base …)}
1378  % [2: %] %{H} whd in match (get_costlabels_of_trace ????); >append_nil
1379  @is_permutation_eq
1380]
1381#st1 #st2 #st3 #lab whd in ⊢ (% → ?); #H inversion H in ⊢ ?; #st11 #st12
1382[ * #lab1 #new_code #new_cont #EQcode11 #EQcont11 #EQcode12 #EQcont12 #EQstore
1383  #Hio11 #EQio12 #Hl1 #EQ1 #EQ2 #EQ3 #EQ4 destruct #tl #IH #s1' #abs_tail #abs_top
1384  whd in match state_rel in ⊢ (% → ?); normalize nodelta >EQcont11 in ⊢ (% → ?);
1385  whd in match check_continuations; normalize nodelta whd in match (foldr2 ???????);
1386  inversion (cont ? s1') [ #_ *] * #l1' #new_code' #new_cont' #_ #EQconts1'
1387  normalize nodelta change with (check_continuations ?????) in match (foldr2 ???????);
1388  inversion(check_continuations ?????) [ #_ *] ** #H1 #l2 #ll2 #EQHl2
1389  >m_return_bind normalize nodelta inversion (call_post_clean ?????) [ #_ ***** ]
1390  * #l3 #code_c_st12 #EQcode_c_st12 normalize nodelta
1391  cases l1' in EQconts1'; (*in Hio11 Hl1 EQcont11 H;*) normalize nodelta
1392  [1,4: [ #x #y ] #_ (*#_ #_ #_ #H*) *****
1393  | #x #_ cases (ret_costed_abs ??) normalize nodelta [|#c] ******[|*] #EQ @⊥ >EQ in Hl1;
1394    normalize * /2/ ] *
1395  [ #EQconts1' normalize nodelta ****** #EQ destruct(EQ)
1396    #HH1 #EQ destruct(EQ) >EQcode11 in ⊢ (% → ?); inversion(code … s1')
1397    [
1398    | #x
1399    | #seq #lbl #i #_
1400    | #cond #ltrue #i1 #lfalse #i2 #i3 #_ #_ #_
1401    | #cond #ltrue #i1 #lfalse #i2 #_ #_
1402    | #f #act_p #ret_post #i #_
1403    | #l_in #io #l_out #i #_
1404    ]
1405    [|*: #_ whd in ⊢ (??%% → ?); [ #EQ lapply(eq_to_jmeq ??? EQ) -EQ #EQ destruct(EQ)]
1406         cases(call_post_clean ?????) normalize nodelta
1407         [1,3,5,7,9: #EQ destruct(EQ)] cases daemon (* da fare assurdi!!!*) ]
1408    #EQcodes1' whd in ⊢ (??%% → ?); #EQ destruct(EQ) #EQstore11 #EQio11 #EQ destruct(EQ)
1409    cases(IH (mk_state ? new_code' new_cont' (store … s1') false) ll2 abs_top …)
1410    [2: whd whd in match check_continuations; normalize nodelta
1411       change with (check_continuations ?????) in match (foldr2 ???????); >EQHl2
1412        normalize nodelta % // % // % // % // @EQcode_c_st12 ]
1413    #abs_top' * #abs_tail' * #st3' * #t' ** #Hst3st3' #EQcosts #EQlen
1414    %{abs_top'} %{abs_tail'} %{st3'} %{(t_ind … (cost_act (None ?)) …  t')}
1415    [ @hide_prf whd @(empty ????? 〈(cost_act (None ?)),?〉)
1416      [3: assumption |4: assumption |*:] /3 by nmk/ ]
1417    % [2: whd in ⊢ (??%%); >EQlen % ] %{Hst3st3'} @EQcosts
1418  | #lbl #EQconts1' normalize nodelta ******* #EQ destruct(EQ)
1419    #HH1 #EQ destruct(EQ) #EQget_el >EQcode11 in ⊢ (% → ?);
1420    inversion(code … s1')
1421    [
1422    | #x
1423    | #seq #lbl #i #_
1424    | #cond #ltrue #i1 #lfalse #i2 #i3 #_ #_ #_
1425    | #cond #ltrue #i1 #lfalse #i2 #_ #_
1426    | #f #act_p #ret_post #i #_
1427    | #l_in #io #l_out #i #_
1428    ]
1429    [|*: #_ whd in ⊢ (??%% → ?); #EQ cases daemon (* da fare assurdi !!!*) ]
1430    #EQcodes1' whd in ⊢ (??%% → ?); #EQ destruct(EQ) #EQstore #EQio #EQ destruct(EQ)
1431    cases(IH (mk_state ? new_code' new_cont' (store … s1') false) ll2 l3 …)
1432    [2: whd whd in match check_continuations; normalize nodelta
1433       change with (check_continuations ?????) in match (foldr2 ???????);
1434       >EQHl2 in ⊢ (match % with [ _⇒ ? | _ ⇒ ?]);
1435        normalize nodelta % // % // % // % // @EQcode_c_st12 ]
1436    #abs_top' * #abs_tail' * #st3' * #t' ** #Hst3st3' #EQcost #EQlen
1437    %{abs_top'} %{abs_tail'} %{st3'}
1438    %{(t_ind … (cost_act (Some ? lbl)) … t')}
1439    [ @hide_prf whd @(empty ????? 〈(cost_act (Some ? lbl)),?〉)
1440      [3: assumption |4: assumption |*:] /3 by nmk/ ]
1441    % [2: whd in ⊢ (??%%); >EQlen % ] %{Hst3st3'} >map_labels_on_trace_append
1442    whd in match (map_labels_on_trace ? [lbl]); >append_nil >EQget_el
1443    @is_permutation_cons assumption
1444  ]
1445(*     
1446| #seq #i #store * [| #lbl] #EQcode11 #EQstore #EQ destruct(EQ) #EQcont
1447  #EQ destruct(EQ) #Hio_st11 #Hio_st12 #EQ destruct(EQ) #EQ1 #EQ2 destruct(EQ1 EQ2)
1448  #EQ destruct(EQ) #tl #IH #st3 #l1 whd in ⊢ (% → ?);
1449  inversion(check_continuations ?????) [1,3: #_ *] * #H1 #l2
1450  [ >EQcont in ⊢ (% → ?); | >EQcont in ⊢ (% → ?); ] #EQcheck normalize nodelta
1451  *** #HH1 [ >EQcode11 in ⊢ (% → ?); | >EQcode11 in ⊢ (% → ?); ]
1452  inversion(code … st3)
1453  [1,2,4,5,6,7,8,9,11,12,13,14: (*assurdi da fare *) cases daemon ]
1454  #seq1 #opt_l #i1 #_ #EQcode_st3 change with (m_bind ?????) in ⊢ (??%? → ?);
1455  cases daemon *)
1456|8: #f #act_p #opt_l #i #mem #env_it #EQcode11 #EQenv_it #EQmem
1457    #EQ destruct(EQ) #EQcode12 #EQcont12 #EQio11 #EQio12 #EQ1 #EQ2 #EQ3
1458    destruct(EQ1 EQ2 EQ3) #EQ destruct(EQ) #tl #IH #st1' #abs_top #abs_tail
1459    whd in ⊢ (% → ?); inversion(check_continuations ????) [ #_ *] ** #H1
1460    #abs_top_cont #abs_tail_cont #EQcheck
1461    normalize nodelta **** #HH1 >EQcode11 in ⊢ (% → ?); inversion(code … st1')
1462    [1,2,3,4,5,7: (*assurdi da fare*) cases daemon] #f' #act_p' #opt_l' #i' #_
1463    #EQcode_st1' #EQclean #EQstore #EQio #EQ destruct(EQ)
1464    lapply(trans_env_ok … no_dup) >EQtrans normalize nodelta #H
1465    cases(H … EQenv_it) -H #env_it' * #fresh' * #EQenv_it' ***** #EQtrans
1466    #EQgen_labels #EQsignature #EQlab_env_it #same_map #same_keep
1467    change with (m_bind ?????) in EQclean : (??%?); inversion(call_post_clean ?????) in EQclean;
1468    [ #_ whd in ⊢ (??%% → ?); #EQ destruct] * #abs_top'' #i'' #EQi' >m_return_bind
1469    inversion opt_l' in EQcode_st1'; [| #lbl'] #EQopt_l' #EQcode_st1' normalize nodelta
1470    [2: inversion(memb ???) normalize nodelta #Hlbl_keep
1471        [  inversion (get_element ????) normalize nodelta [ #_ whd in ⊢ (??%% → ?); #EQ destruct]
1472           #lbl'' #l3' #_ #EQget_el whd in match (eqb ???); inversion (eqb ???) normalize nodelta
1473          [2: #_ whd in ⊢ (??%% → ?); #EQ destruct] #H cases(eqb_true ? lbl'' lbl') #H1 #_
1474          lapply(H1 H) -H -H1 #EQ destruct(EQ) inversion(eqb_list ???) normalize nodelta
1475          [2: #_ whd in ⊢ (??%% → ?); #EQ destruct] #H cases(eqb_true (DeqSet_List ?) l3' abs_top'')
1476          #H1 #_ lapply(H1 H) -H -H1 #EQ destruct(EQ) whd in ⊢ (??%% → ?); #EQ lapply(eq_to_jmeq ??? EQ) -EQ
1477          #EQ destruct(EQ)
1478          cases(IH (mk_state ? (f_body … env_it') (〈ret_act opt_l',i'〉 :: (cont … st1')) (store ? st12) false) (abs_tail_cont) (gen_labels … (call_post_trans … (f_body … env_it) fresh' (nil ?))))
1479          [2: whd >EQcont12
1480            change with (m_bind ??? (check_continuations ?????) ?) in match (check_continuations ?????);
1481            >EQcheck >m_return_bind normalize nodelta >EQi' normalize nodelta >EQopt_l'
1482            whd in match ret_costed_abs; normalize nodelta >Hlbl_keep normalize nodelta
1483            % // % // % // % [/5 by conj/] >EQgen_labels >EQcode12 <EQtrans
1484            @(inverse_call_post_trans … fresh')
1485            [2: % |*: [2,3: /2 by / ]
1486                cases(lookup_ok_append … EQenv_it) #env1 * #env2 * #EQ1 #EQ2
1487                whd in no_dup; destruct >EQ1 in no_dup; >foldr_map_append >foldr_map_append
1488                #no_dup lapply(no_duplicates_append_r … no_dup) #H1
1489                lapply(no_duplicates_append_l … H1) whd in match (foldr ?????); -H1
1490                change with ([?]@?) in match (?::?); #H1
1491                lapply(no_duplicates_append_r … H1) >append_nil //
1492            ]
1493          ]
1494          #abs_top''' * #abs_tail''' * #st3' * #t' ** #Hst3st3' #EQcosts #EQlen %{abs_top'''}
1495          %{abs_tail'''} %{st3'} %{(t_ind … (call_act f (f_lab … env_it')) …  t')}
1496          [ @hide_prf @call /2 width=10 by jmeq_to_eq/ ] % [2: whd in ⊢ (??%%); >EQlen %]
1497          %{Hst3st3'} >map_labels_on_trace_append whd in match (get_costlabels_of_trace ????) in ⊢ (???%);
1498          >EQlab_env_it >associative_append whd in match (append ???); >associative_append
1499          >associative_append in ⊢ (???%); >(associative_append … [?]) in ⊢ (???%);
1500          whd in match (map_labels_on_trace ??); >EQgen_labels @is_permutation_cons
1501          >append_nil whd in match (append ???) in ⊢ (???%); //
1502        | whd in ⊢ (??%% → ?); #EQ lapply(eq_to_jmeq ??? EQ) -EQ #EQ destruct(EQ)
1503          cases(IH (mk_state ? (f_body … env_it') (〈ret_act opt_l',i'〉 :: (cont … st1')) (store ? st12) false) (abs_top''@abs_tail_cont) (gen_labels … (call_post_trans … (f_body … env_it) fresh' (nil ?))))
1504          [2: whd >EQcont12
1505              change with (m_bind ??? (check_continuations ?????) ?) in match (check_continuations ?????);
1506              >EQcheck >m_return_bind normalize nodelta >EQi' normalize nodelta >EQopt_l'
1507            whd in match ret_costed_abs; normalize nodelta >Hlbl_keep normalize nodelta
1508            % // % // % // % [/5 by conj/] >EQcode12 <EQtrans
1509            @(inverse_call_post_trans … fresh')
1510            [2: % |*: [2,3: /2 by / ]
1511                cases(lookup_ok_append … EQenv_it) #env1 * #env2 * #EQ1 #EQ2
1512                whd in no_dup; destruct >EQ1 in no_dup; >foldr_map_append >foldr_map_append
1513                #no_dup lapply(no_duplicates_append_r … no_dup) #H1
1514                lapply(no_duplicates_append_l … H1) whd in match (foldr ?????); -H1
1515                change with ([?]@?) in match (?::?); #H1
1516                lapply(no_duplicates_append_r … H1) >append_nil //
1517            ]
1518          ]
1519          #abs_top''' * #abs_tail''' * #st3' * #t' ** #Hst3st3' #EQcosts #EQlen
1520          %{([a_return_post lbl'] @ abs_top''')}
1521          %{abs_tail'''} %{st3'} %{(t_ind … (call_act f (f_lab … env_it')) …  t')}
1522          [ @hide_prf @call /2 width=10 by jmeq_to_eq/ ] % [2: whd in ⊢ (??%%); >EQlen %]
1523          %{Hst3st3'} >map_labels_on_trace_append whd in match (get_costlabels_of_trace ????) in ⊢ (???%);
1524          >EQlab_env_it >associative_append >associative_append
1525          >associative_append in ⊢ (???%); >(associative_append … [?]) in ⊢ (???%);
1526          whd in match (map_labels_on_trace ??); >EQgen_labels
1527          whd in match (foldr ?????); >append_nil
1528           @is_permutation_cons
1529          >append_nil whd in match (append ???) in ⊢ (???%); //
1530       
1531
1532        ]
1533    | whd in ⊢ (???% → ?); #EQ destruct
1534    ]
1535|       
1536   
1537
1538         
1539 
1540 
1541cases daemon (*TODO*)
1542qed.
Note: See TracBrowser for help on using the repository browser.