Ignore:
Timestamp:
Feb 21, 2013, 6:03:46 PM (7 years ago)
Author:
tranquil
Message:
  • in Arithmeticcs.ma: commented include that breaks script in latest matita
  • moved COST_LABEL out of joint_seq
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/joint/semantics_blocks.ma

    r2674 r2688  
    7878  let src ≝ point_of_pc p (pc … st) in
    7979  seq_list_in_code … (joint_if_code … curr_fn) src b l dst →
    80   All ? (no_cost_label …) b →
    8180  repeat_eval_seq_no_pc p curr_id curr_fn b st = return st' →
    8281  Σtaaf : trace_any_any_free (joint_abstract_status p) st
     
    8483  (not_empty … b ↔ bool_to_Prop (taaf_non_empty … taaf)) ≝
    8584  match b
    86   return λb.∀l,dst.?→?→?→?→?→ Σtaaf.(not_empty ? b ↔ bool_to_Prop (taaf_non_empty … taaf))
     85  return λb.∀l,dst.?→?→?→?→ Σtaaf.(not_empty ? b ↔ bool_to_Prop (taaf_non_empty … taaf))
    8786  with
    8887  [ nil ⇒
    89     λl,dst,st',fd_prf,in_code,all_other,EQ1.
     88    λl,dst,st',fd_prf,in_code,EQ1.
    9089    «taaf_base (joint_abstract_status p) st
    9190    ⌈trace_any_any_free ??? ↦ ?⌉,?»
    9291  | cons hd tl ⇒
    9392    λl.
    94     match l return λx.∀dst,st'.?→?→?→?→Σtaaf.(True ↔ bool_to_Prop (taaf_non_empty … taaf)) with
     93    match l return λx.∀dst,st'.?→?→?→Σtaaf.(True ↔ bool_to_Prop (taaf_non_empty … taaf)) with
    9594    [ nil ⇒ λdst,st',fd_prf,in_code.⊥
    9695    | cons _ rest ⇒ λdst.
    9796      let mid ≝ match rest with [ nil ⇒ dst | cons mid _ ⇒ mid ] in
    98       λst',fd_prf,in_code,all_other,EQ1.
     97      λst',fd_prf,in_code,EQ1.
    9998      let mid_pc ≝ pc_of_point p (pc_block (pc … st)) mid in
    10099      match eval_seq_no_pc … (ev_genv p) curr_id curr_fn hd st
     
    106105        let tr_tl ≝ produce_trace_any_any_free_aux ?
    107106            (mk_state_pc ? st_mid mid_pc (last_pop … st))
    108             curr_id curr_fn tl rest dst ????? in
     107            curr_id curr_fn tl rest dst ???? in
    109108        «taaf_cons … tr_tl ?,?»
    110109      | _ ⇒ λEQ2.⊥
     
    118117  >pc_of_point_of_pc cases st // #a #b #c #e >(K ?? e) normalize nodelta *
    119118| cases in_code #a * #b ** #ABS destruct
    120 |12: whd in EQ1 : (??%%); >EQ2 in EQ1; whd in ⊢ (??%?→?); #EQ1 destruct(EQ1)
     119|11: whd in EQ1 : (??%%); >EQ2 in EQ1; whd in ⊢ (??%?→?); #EQ1 destruct(EQ1)
    121120|4: cases tr_tl -tr_tl #tr_tl * #_ #H
    122121  @if_elim [2: #_ % ] #G lapply (H G) -H -G
    123  cases tl in in_code all_other; [ #_ #_ * ]
     122 cases tl in in_code; [ #_ * ]
    124123 #hd' #tl' * #mid' * #rest' ** #EQ * #nxt * #EQstmt_at #EQ_nxt
    125  * #mid'' * #rest'' ** #EQ' * #nxt' * #EQstmt_at' #EQnxt' #_
     124 * #mid'' * #rest'' ** #EQ' * #nxt' * #EQstmt_at' #EQnxt'
    126125 normalize nodelta -mid_pc destruct
    127  * #_ * #H #_ #_ % whd in ⊢ (%→?);
     126 #_ #_ % whd in ⊢ (%→?);
    128127 whd in ⊢ (?(??%?)→?); whd in match (as_pc_of ??);
    129128  >fetch_statement_eq [2: whd in match point_of_pc;
    130129  normalize nodelta >point_of_offset_of_point @EQstmt_at' |3: @fd_prf |*:]
    131   normalize nodelta
    132   >(no_label_uncosted … H) * #ABS @ABS %
     130  normalize nodelta * #ABS @ABS %
    133131|7: % [2: #_ %] #_ @taaf_cons_non_empty
    134132]
     
    138136#nxt * #EQ_stmt_at #EQ_mid' #rest_in_code
    139137normalize nodelta
    140 cases all_other -all_other #hd_no_cost #tl_other
    141138#EQ3 destruct skip (mid_pc)
    142139try assumption
     
    168165  let src ≝ point_of_pc p (pc … st) in
    169166  seq_list_in_code … (joint_if_code … curr_fn) src b l dst →
    170   All ? (no_cost_label …) b →
    171167  repeat_eval_seq_no_pc p curr_id curr_fn b st = return st' →
    172168  trace_any_any_free (joint_abstract_status p) st
    173169    (mk_state_pc ? st' (pc_of_point p (pc_block (pc … st)) dst) (last_pop … st)) ≝
    174   λp,st,curr_id,curr_fn,b,l,dst,st',prf1,prf2,prf3,prf4.
    175   produce_trace_any_any_free_aux p st curr_id curr_fn b l dst st' prf1 prf2 prf3 prf4.
     170  λp,st,curr_id,curr_fn,b,l,dst,st',prf1,prf2,prf3.
     171  produce_trace_any_any_free_aux p st curr_id curr_fn b l dst st' prf1 prf2 prf3.
    176172
    177173(* when a seq_list is coerced to a step_block *)
     
    188184  let src ≝ point_of_pc p (pc … st) in
    189185  src ~❨b, l❩~> dst in joint_if_code … curr_fn →
    190   All ? (no_cost_label …) b →
    191186  repeat_eval_seq_no_pc p curr_id curr_fn b st = return st' →
    192187  trace_any_any_free (joint_abstract_status p) st
     
    196191lapply (coerced_step_list_in_code … prf)
    197192inversion b normalize nodelta
    198 [ #_ #in_code #_ whd in ⊢ (??%%→?); #EQ destruct
     193[ #_ #in_code whd in ⊢ (??%%→?); #EQ destruct
    199194  cases (produce_step_trace … fd_prf … in_code (refl …))
    200195  #H #G
Note: See TracChangeset for help on using the changeset viewer.