src/HOL/MicroJava/BV/JVMType.thy
author wenzelm
Tue Mar 29 17:30:26 2011 +0200 (2011-03-29)
changeset 42150 b0c0638c4aad
parent 35417 47ee18b6ae32
child 42463 f270e3e18be5
permissions -rw-r--r--
tuned headers;
wenzelm@42150
     1
(*  Title:      HOL/MicroJava/BV/JVMType.thy
kleing@10812
     2
    Author:     Gerwin Klein
kleing@10812
     3
    Copyright   2000 TUM
kleing@10812
     4
*)
kleing@10812
     5
kleing@12911
     6
header {* \isaheader{The JVM Type System as Semilattice} *}
kleing@10812
     7
haftmann@33954
     8
theory JVMType
haftmann@33954
     9
imports JType
haftmann@33954
    10
begin
kleing@10812
    11
kleing@10812
    12
types
kleing@10812
    13
  locvars_type = "ty err list"
kleing@10812
    14
  opstack_type = "ty list"
kleing@10812
    15
  state_type   = "opstack_type \<times> locvars_type"
kleing@12516
    16
  state        = "state_type option err"    -- "for Kildall"
kleing@12516
    17
  method_type  = "state_type option list"   -- "for BVSpec"
kleing@13006
    18
  class_type   = "sig \<Rightarrow> method_type"
kleing@13006
    19
  prog_type    = "cname \<Rightarrow> class_type"
kleing@10812
    20
kleing@10812
    21
haftmann@35416
    22
definition stk_esl :: "'c prog \<Rightarrow> nat \<Rightarrow> ty list esl" where
kleing@10812
    23
  "stk_esl S maxs == upto_esl maxs (JType.esl S)"
kleing@10812
    24
haftmann@35416
    25
definition reg_sl :: "'c prog \<Rightarrow> nat \<Rightarrow> ty err list sl" where
kleing@10812
    26
  "reg_sl S maxr == Listn.sl maxr (Err.sl (JType.esl S))"
kleing@10812
    27
haftmann@35416
    28
definition sl :: "'c prog \<Rightarrow> nat \<Rightarrow> nat \<Rightarrow> state sl" where
kleing@10812
    29
  "sl S maxs maxr ==
kleing@10812
    30
  Err.sl(Opt.esl(Product.esl (stk_esl S maxs) (Err.esl(reg_sl S maxr))))"
kleing@10812
    31
haftmann@35416
    32
definition states :: "'c prog \<Rightarrow> nat \<Rightarrow> nat \<Rightarrow> state set" where
kleing@10812
    33
  "states S maxs maxr == fst(sl S maxs maxr)"
kleing@10812
    34
haftmann@35416
    35
definition le :: "'c prog \<Rightarrow> nat \<Rightarrow> nat \<Rightarrow> state ord" where
kleing@10812
    36
  "le S maxs maxr == fst(snd(sl S maxs maxr))"
kleing@10812
    37
haftmann@35416
    38
definition  sup :: "'c prog \<Rightarrow> nat \<Rightarrow> nat \<Rightarrow> state binop" where
kleing@10812
    39
  "sup S maxs maxr == snd(snd(sl S maxs maxr))"
kleing@10812
    40
haftmann@35416
    41
definition sup_ty_opt :: "['code prog,ty err,ty err] \<Rightarrow> bool"
haftmann@35416
    42
                 ("_ |- _ <=o _" [71,71] 70) where 
kleing@10812
    43
  "sup_ty_opt G == Err.le (subtype G)"
kleing@10812
    44
haftmann@35416
    45
definition sup_loc :: "['code prog,locvars_type,locvars_type] \<Rightarrow> bool" 
haftmann@35416
    46
              ("_ |- _ <=l _"  [71,71] 70) where
kleing@10812
    47
  "sup_loc G == Listn.le (sup_ty_opt G)"
kleing@10812
    48
haftmann@35416
    49
definition sup_state :: "['code prog,state_type,state_type] \<Rightarrow> bool"   
haftmann@35416
    50
               ("_ |- _ <=s _"  [71,71] 70) where
kleing@10812
    51
  "sup_state G == Product.le (Listn.le (subtype G)) (sup_loc G)"
kleing@10812
    52
haftmann@35416
    53
definition sup_state_opt :: "['code prog,state_type option,state_type option] \<Rightarrow> bool" 
haftmann@35416
    54
                   ("_ |- _ <=' _"  [71,71] 70) where
kleing@10812
    55
  "sup_state_opt G == Opt.le (sup_state G)"
kleing@10812
    56
kleing@10812
    57
wenzelm@35355
    58
notation (xsymbols)
wenzelm@35355
    59
  sup_ty_opt  ("_ \<turnstile> _ <=o _" [71,71] 70) and
wenzelm@35355
    60
  sup_loc  ("_ \<turnstile> _ <=l _" [71,71] 70) and
wenzelm@35355
    61
  sup_state  ("_ \<turnstile> _ <=s _" [71,71] 70) and
wenzelm@35355
    62
  sup_state_opt  ("_ \<turnstile> _ <=' _" [71,71] 70)
kleing@10812
    63
                   
kleing@10812
    64
kleing@10812
    65
lemma JVM_states_unfold: 
kleing@10812
    66
  "states S maxs maxr == err(opt((Union {list n (types S) |n. n <= maxs}) <*>
kleing@10812
    67
                                  list maxr (err(types S))))"
kleing@10812
    68
  apply (unfold states_def sl_def Opt.esl_def Err.sl_def
kleing@10812
    69
         stk_esl_def reg_sl_def Product.esl_def
kleing@10812
    70
         Listn.sl_def upto_esl_def JType.esl_def Err.esl_def)
kleing@10812
    71
  by simp
kleing@10812
    72
kleing@10812
    73
kleing@10812
    74
lemma JVM_le_unfold:
kleing@10812
    75
 "le S m n == 
kleing@10812
    76
  Err.le(Opt.le(Product.le(Listn.le(subtype S))(Listn.le(Err.le(subtype S)))))" 
kleing@10812
    77
  apply (unfold le_def sl_def Opt.esl_def Err.sl_def
kleing@10812
    78
         stk_esl_def reg_sl_def Product.esl_def  
kleing@10812
    79
         Listn.sl_def upto_esl_def JType.esl_def Err.esl_def) 
kleing@10812
    80
  by simp
kleing@10812
    81
kleing@10812
    82
lemma JVM_le_convert:
kleing@10812
    83
  "le G m n (OK t1) (OK t2) = G \<turnstile> t1 <=' t2"
kleing@10812
    84
  by (simp add: JVM_le_unfold Err.le_def lesub_def sup_state_opt_def 
kleing@10812
    85
                sup_state_def sup_loc_def sup_ty_opt_def)
kleing@10812
    86
kleing@10812
    87
lemma JVM_le_Err_conv:
kleing@10812
    88
  "le G m n = Err.le (sup_state_opt G)"
kleing@10812
    89
  by (unfold sup_state_opt_def sup_state_def sup_loc_def  
kleing@10812
    90
             sup_ty_opt_def JVM_le_unfold) simp
kleing@10812
    91
kleing@10812
    92
lemma zip_map [rule_format]:
kleing@13006
    93
  "\<forall>a. length a = length b \<longrightarrow> 
kleing@12516
    94
  zip (map f a) (map g b) = map (\<lambda>(x,y). (f x, g y)) (zip a b)"
kleing@10812
    95
  apply (induct b) 
kleing@10812
    96
   apply simp
kleing@10812
    97
  apply clarsimp
kleing@10812
    98
  apply (case_tac aa)
kleing@10812
    99
  apply simp+
kleing@10812
   100
  done
kleing@10812
   101
kleing@10812
   102
lemma [simp]: "Err.le r (OK a) (OK b) = r a b"
kleing@10812
   103
  by (simp add: Err.le_def lesub_def)
kleing@10812
   104
kleing@10812
   105
lemma stk_convert:
kleing@10812
   106
  "Listn.le (subtype G) a b = G \<turnstile> map OK a <=l map OK b"
kleing@10812
   107
proof 
kleing@10812
   108
  assume "Listn.le (subtype G) a b"
kleing@10812
   109
kleing@10812
   110
  hence le: "list_all2 (subtype G) a b"
kleing@10812
   111
    by (unfold Listn.le_def lesub_def)
kleing@10812
   112
  
kleing@10812
   113
  { fix x' y'
kleing@10812
   114
    assume "length a = length b"
kleing@10812
   115
           "(x',y') \<in> set (zip (map OK a) (map OK b))"
kleing@10812
   116
    then
kleing@10812
   117
    obtain x y where OK:
kleing@10812
   118
      "x' = OK x" "y' = OK y" "(x,y) \<in> set (zip a b)"
kleing@10812
   119
      by (auto simp add: zip_map)
kleing@10812
   120
    with le
kleing@10812
   121
    have "subtype G x y"
kleing@10812
   122
      by (simp add: list_all2_def Ball_def)
kleing@10812
   123
    with OK
kleing@10812
   124
    have "G \<turnstile> x' <=o y'"
kleing@10812
   125
      by (simp add: sup_ty_opt_def)
kleing@10812
   126
  }
kleing@10812
   127
  
kleing@10812
   128
  with le
kleing@10812
   129
  show "G \<turnstile> map OK a <=l map OK b"
kleing@10812
   130
    by (unfold sup_loc_def Listn.le_def lesub_def list_all2_def) auto
kleing@10812
   131
next
kleing@10812
   132
  assume "G \<turnstile> map OK a <=l map OK b"
kleing@10812
   133
kleing@10812
   134
  thus "Listn.le (subtype G) a b"
kleing@10812
   135
    apply (unfold sup_loc_def list_all2_def Listn.le_def lesub_def)
kleing@10812
   136
    apply (clarsimp simp add: zip_map)
kleing@10812
   137
    apply (drule bspec, assumption)
kleing@10812
   138
    apply (auto simp add: sup_ty_opt_def subtype_def)
kleing@10812
   139
    done
kleing@10812
   140
qed
kleing@10812
   141
kleing@10812
   142
kleing@10812
   143
lemma sup_state_conv:
kleing@12516
   144
  "(G \<turnstile> s1 <=s s2) == 
kleing@12516
   145
  (G \<turnstile> map OK (fst s1) <=l map OK (fst s2)) \<and> (G \<turnstile> snd s1 <=l snd s2)"
kleing@10812
   146
  by (auto simp add: sup_state_def stk_convert lesub_def Product.le_def split_beta)
kleing@10812
   147
kleing@10812
   148
kleing@10812
   149
lemma subtype_refl [simp]:
kleing@10812
   150
  "subtype G t t"
kleing@10812
   151
  by (simp add: subtype_def)
kleing@10812
   152
kleing@10812
   153
theorem sup_ty_opt_refl [simp]:
kleing@10812
   154
  "G \<turnstile> t <=o t"
kleing@10812
   155
  by (simp add: sup_ty_opt_def Err.le_def lesub_def split: err.split)
kleing@10812
   156
kleing@10812
   157
lemma le_list_refl2 [simp]: 
kleing@10812
   158
  "(\<And>xs. r xs xs) \<Longrightarrow> Listn.le r xs xs"
kleing@10812
   159
  by (induct xs, auto simp add: Listn.le_def lesub_def)
kleing@10812
   160
kleing@10812
   161
theorem sup_loc_refl [simp]:
kleing@10812
   162
  "G \<turnstile> t <=l t"
kleing@10812
   163
  by (simp add: sup_loc_def)
kleing@10812
   164
kleing@10812
   165
theorem sup_state_refl [simp]:
kleing@10812
   166
  "G \<turnstile> s <=s s"
kleing@10812
   167
  by (auto simp add: sup_state_def Product.le_def lesub_def)
kleing@10812
   168
kleing@10812
   169
theorem sup_state_opt_refl [simp]:
kleing@10812
   170
  "G \<turnstile> s <=' s"
kleing@10812
   171
  by (simp add: sup_state_opt_def Opt.le_def lesub_def split: option.split)
kleing@10812
   172
  
kleing@10812
   173
kleing@10812
   174
theorem anyConvErr [simp]:
kleing@10812
   175
  "(G \<turnstile> Err <=o any) = (any = Err)"
kleing@10812
   176
  by (simp add: sup_ty_opt_def Err.le_def split: err.split)
kleing@10812
   177
kleing@10812
   178
theorem OKanyConvOK [simp]:
kleing@10812
   179
  "(G \<turnstile> (OK ty') <=o (OK ty)) = (G \<turnstile> ty' \<preceq> ty)"
kleing@10812
   180
  by (simp add: sup_ty_opt_def Err.le_def lesub_def subtype_def)
kleing@10812
   181
kleing@10812
   182
theorem sup_ty_opt_OK:
kleing@13006
   183
  "G \<turnstile> a <=o (OK b) \<Longrightarrow> \<exists> x. a = OK x"
kleing@10812
   184
  by (clarsimp simp add: sup_ty_opt_def Err.le_def split: err.splits)
kleing@10812
   185
kleing@10812
   186
lemma widen_PrimT_conv1 [simp]:
kleing@13006
   187
  "\<lbrakk> G \<turnstile> S \<preceq> T; S = PrimT x\<rbrakk> \<Longrightarrow> T = PrimT x"
berghofe@22271
   188
  by (auto elim: widen.cases)
kleing@10812
   189
kleing@10812
   190
theorem sup_PTS_eq:
kleing@10812
   191
  "(G \<turnstile> OK (PrimT p) <=o X) = (X=Err \<or> X = OK (PrimT p))"
kleing@10812
   192
  by (auto simp add: sup_ty_opt_def Err.le_def lesub_def subtype_def 
kleing@10812
   193
              split: err.splits)
kleing@10812
   194
kleing@10812
   195
theorem sup_loc_Nil [iff]:
kleing@10812
   196
  "(G \<turnstile> [] <=l XT) = (XT=[])"
kleing@10812
   197
  by (simp add: sup_loc_def Listn.le_def)
kleing@10812
   198
kleing@10812
   199
theorem sup_loc_Cons [iff]:
kleing@10812
   200
  "(G \<turnstile> (Y#YT) <=l XT) = (\<exists>X XT'. XT=X#XT' \<and> (G \<turnstile> Y <=o X) \<and> (G \<turnstile> YT <=l XT'))"
kleing@10812
   201
  by (simp add: sup_loc_def Listn.le_def lesub_def list_all2_Cons1)
kleing@10812
   202
kleing@10812
   203
theorem sup_loc_Cons2:
kleing@10812
   204
  "(G \<turnstile> YT <=l (X#XT)) = (\<exists>Y YT'. YT=Y#YT' \<and> (G \<turnstile> Y <=o X) \<and> (G \<turnstile> YT' <=l XT))"
kleing@10812
   205
  by (simp add: sup_loc_def Listn.le_def lesub_def list_all2_Cons2)
kleing@10812
   206
streckem@13672
   207
lemma sup_state_Cons:
streckem@13672
   208
  "(G \<turnstile> (x#xt, a) <=s (y#yt, b)) = 
streckem@13672
   209
   ((G \<turnstile> x \<preceq> y) \<and> (G \<turnstile> (xt,a) <=s (yt,b)))"
streckem@13672
   210
  by (auto simp add: sup_state_def stk_convert lesub_def Product.le_def)
streckem@13672
   211
kleing@10812
   212
kleing@10812
   213
theorem sup_loc_length:
kleing@13006
   214
  "G \<turnstile> a <=l b \<Longrightarrow> length a = length b"
kleing@10812
   215
proof -
kleing@10812
   216
  assume G: "G \<turnstile> a <=l b"
kleing@13006
   217
  have "\<forall>b. (G \<turnstile> a <=l b) \<longrightarrow> length a = length b"
kleing@10812
   218
    by (induct a, auto)
kleing@10812
   219
  with G
kleing@10812
   220
  show ?thesis by blast
kleing@10812
   221
qed
kleing@10812
   222
kleing@10812
   223
theorem sup_loc_nth:
kleing@13006
   224
  "\<lbrakk> G \<turnstile> a <=l b; n < length a \<rbrakk> \<Longrightarrow> G \<turnstile> (a!n) <=o (b!n)"
kleing@10812
   225
proof -
kleing@10812
   226
  assume a: "G \<turnstile> a <=l b" "n < length a"
kleing@13006
   227
  have "\<forall> n b. (G \<turnstile> a <=l b) \<longrightarrow> n < length a \<longrightarrow> (G \<turnstile> (a!n) <=o (b!n))"
kleing@10812
   228
    (is "?P a")
kleing@10812
   229
  proof (induct a)
kleing@10812
   230
    show "?P []" by simp
kleing@10812
   231
    
kleing@10812
   232
    fix x xs assume IH: "?P xs"
kleing@10812
   233
kleing@10812
   234
    show "?P (x#xs)"
kleing@10812
   235
    proof (intro strip)
kleing@10812
   236
      fix n b
kleing@10812
   237
      assume "G \<turnstile> (x # xs) <=l b" "n < length (x # xs)"
kleing@10812
   238
      with IH
kleing@10812
   239
      show "G \<turnstile> ((x # xs) ! n) <=o (b ! n)"
kleing@10812
   240
        by - (cases n, auto)
kleing@10812
   241
    qed
kleing@10812
   242
  qed
kleing@10812
   243
  with a
kleing@10812
   244
  show ?thesis by blast
kleing@10812
   245
qed
kleing@10812
   246
kleing@10812
   247
theorem all_nth_sup_loc:
kleing@13006
   248
  "\<forall>b. length a = length b \<longrightarrow> (\<forall> n. n < length a \<longrightarrow> (G \<turnstile> (a!n) <=o (b!n))) 
kleing@13006
   249
  \<longrightarrow> (G \<turnstile> a <=l b)" (is "?P a")
kleing@10812
   250
proof (induct a)
kleing@10812
   251
  show "?P []" by simp
kleing@10812
   252
kleing@10812
   253
  fix l ls assume IH: "?P ls"
kleing@10812
   254
  
kleing@10812
   255
  show "?P (l#ls)"
kleing@10812
   256
  proof (intro strip)
kleing@10812
   257
    fix b
kleing@13006
   258
    assume f: "\<forall>n. n < length (l # ls) \<longrightarrow> (G \<turnstile> ((l # ls) ! n) <=o (b ! n))"
kleing@10812
   259
    assume l: "length (l#ls) = length b"
kleing@10812
   260
    
kleing@10812
   261
    then obtain b' bs where b: "b = b'#bs"
kleing@10812
   262
      by - (cases b, simp, simp add: neq_Nil_conv, rule that)
kleing@10812
   263
kleing@10812
   264
    with f
kleing@13006
   265
    have "\<forall>n. n < length ls \<longrightarrow> (G \<turnstile> (ls!n) <=o (bs!n))"
kleing@10812
   266
      by auto
kleing@10812
   267
kleing@10812
   268
    with f b l IH
kleing@10812
   269
    show "G \<turnstile> (l # ls) <=l b"
kleing@10812
   270
      by auto
kleing@10812
   271
  qed
kleing@10812
   272
qed
kleing@10812
   273
kleing@10812
   274
kleing@10812
   275
theorem sup_loc_append:
kleing@13006
   276
  "length a = length b \<Longrightarrow> 
kleing@10812
   277
   (G \<turnstile> (a@x) <=l (b@y)) = ((G \<turnstile> a <=l b) \<and> (G \<turnstile> x <=l y))"
kleing@10812
   278
proof -
kleing@10812
   279
  assume l: "length a = length b"
kleing@10812
   280
kleing@13006
   281
  have "\<forall>b. length a = length b \<longrightarrow> (G \<turnstile> (a@x) <=l (b@y)) = ((G \<turnstile> a <=l b) \<and> 
kleing@10812
   282
            (G \<turnstile> x <=l y))" (is "?P a") 
kleing@10812
   283
  proof (induct a)
kleing@10812
   284
    show "?P []" by simp
kleing@10812
   285
    
kleing@10812
   286
    fix l ls assume IH: "?P ls"    
kleing@10812
   287
    show "?P (l#ls)" 
kleing@10812
   288
    proof (intro strip)
kleing@10812
   289
      fix b
kleing@10812
   290
      assume "length (l#ls) = length (b::ty err list)"
kleing@10812
   291
      with IH
kleing@10812
   292
      show "(G \<turnstile> ((l#ls)@x) <=l (b@y)) = ((G \<turnstile> (l#ls) <=l b) \<and> (G \<turnstile> x <=l y))"
kleing@10812
   293
        by - (cases b, auto)
kleing@10812
   294
    qed
kleing@10812
   295
  qed
kleing@10812
   296
  with l
kleing@10812
   297
  show ?thesis by blast
kleing@10812
   298
qed
kleing@10812
   299
kleing@10812
   300
theorem sup_loc_rev [simp]:
kleing@10812
   301
  "(G \<turnstile> (rev a) <=l rev b) = (G \<turnstile> a <=l b)"
kleing@10812
   302
proof -
kleing@10812
   303
  have "\<forall>b. (G \<turnstile> (rev a) <=l rev b) = (G \<turnstile> a <=l b)" (is "\<forall>b. ?Q a b" is "?P a")
kleing@10812
   304
  proof (induct a)
kleing@10812
   305
    show "?P []" by simp
kleing@10812
   306
kleing@10812
   307
    fix l ls assume IH: "?P ls"
kleing@10812
   308
kleing@10812
   309
    { 
kleing@10812
   310
      fix b
kleing@10812
   311
      have "?Q (l#ls) b"
wenzelm@25362
   312
      proof (cases b)
kleing@10812
   313
        case Nil
kleing@10812
   314
        thus ?thesis by (auto dest: sup_loc_length)
kleing@10812
   315
      next
wenzelm@25362
   316
        case (Cons a list)
kleing@10812
   317
        show ?thesis
kleing@10812
   318
        proof
kleing@10812
   319
          assume "G \<turnstile> (l # ls) <=l b"
kleing@10812
   320
          thus "G \<turnstile> rev (l # ls) <=l rev b"
kleing@10812
   321
            by (clarsimp simp add: Cons IH sup_loc_length sup_loc_append)
kleing@10812
   322
        next
kleing@10812
   323
          assume "G \<turnstile> rev (l # ls) <=l rev b"
kleing@10812
   324
          hence G: "G \<turnstile> (rev ls @ [l]) <=l (rev list @ [a])"
kleing@10812
   325
            by (simp add: Cons)          
kleing@10812
   326
          
kleing@10812
   327
          hence "length (rev ls) = length (rev list)"
kleing@10812
   328
            by (auto dest: sup_loc_length)
kleing@10812
   329
kleing@10812
   330
          from this G
kleing@10812
   331
          obtain "G \<turnstile> rev ls <=l rev list" "G \<turnstile> l <=o a"
kleing@10812
   332
            by (simp add: sup_loc_append)
kleing@10812
   333
kleing@10812
   334
          thus "G \<turnstile> (l # ls) <=l b"
kleing@10812
   335
            by (simp add: Cons IH)
kleing@10812
   336
        qed
kleing@10812
   337
      qed    
kleing@10812
   338
    }
kleing@10812
   339
    thus "?P (l#ls)" by blast
kleing@10812
   340
  qed
kleing@10812
   341
kleing@10812
   342
  thus ?thesis by blast
kleing@10812
   343
qed
kleing@10812
   344
kleing@10812
   345
kleing@10812
   346
theorem sup_loc_update [rule_format]:
kleing@13006
   347
  "\<forall> n y. (G \<turnstile> a <=o b) \<longrightarrow> n < length y \<longrightarrow> (G \<turnstile> x <=l y) \<longrightarrow> 
kleing@10812
   348
          (G \<turnstile> x[n := a] <=l y[n := b])" (is "?P x")
kleing@10812
   349
proof (induct x)
kleing@10812
   350
  show "?P []" by simp
kleing@10812
   351
kleing@10812
   352
  fix l ls assume IH: "?P ls"
kleing@10812
   353
  show "?P (l#ls)"
kleing@10812
   354
  proof (intro strip)
kleing@10812
   355
    fix n y
kleing@10812
   356
    assume "G \<turnstile>a <=o b" "G \<turnstile> (l # ls) <=l y" "n < length y"
kleing@10812
   357
    with IH
kleing@10812
   358
    show "G \<turnstile> (l # ls)[n := a] <=l y[n := b]"
kleing@10812
   359
      by - (cases n, auto simp add: sup_loc_Cons2 list_all2_Cons1)
kleing@10812
   360
  qed
kleing@10812
   361
qed
kleing@10812
   362
kleing@10812
   363
kleing@10812
   364
theorem sup_state_length [simp]:
kleing@13006
   365
  "G \<turnstile> s2 <=s s1 \<Longrightarrow> 
kleing@10812
   366
   length (fst s2) = length (fst s1) \<and> length (snd s2) = length (snd s1)"
kleing@10812
   367
  by (auto dest: sup_loc_length simp add: sup_state_def stk_convert lesub_def Product.le_def);
kleing@10812
   368
kleing@10812
   369
theorem sup_state_append_snd:
kleing@13006
   370
  "length a = length b \<Longrightarrow> 
kleing@10812
   371
  (G \<turnstile> (i,a@x) <=s (j,b@y)) = ((G \<turnstile> (i,a) <=s (j,b)) \<and> (G \<turnstile> (i,x) <=s (j,y)))"
kleing@10812
   372
  by (auto simp add: sup_state_def stk_convert lesub_def Product.le_def sup_loc_append)
kleing@10812
   373
kleing@10812
   374
theorem sup_state_append_fst:
kleing@13006
   375
  "length a = length b \<Longrightarrow> 
kleing@10812
   376
  (G \<turnstile> (a@x,i) <=s (b@y,j)) = ((G \<turnstile> (a,i) <=s (b,j)) \<and> (G \<turnstile> (x,i) <=s (y,j)))"
kleing@10812
   377
  by (auto simp add: sup_state_def stk_convert lesub_def Product.le_def sup_loc_append)
kleing@10812
   378
kleing@10812
   379
theorem sup_state_Cons1:
kleing@10812
   380
  "(G \<turnstile> (x#xt, a) <=s (yt, b)) = 
kleing@10812
   381
   (\<exists>y yt'. yt=y#yt' \<and> (G \<turnstile> x \<preceq> y) \<and> (G \<turnstile> (xt,a) <=s (yt',b)))"
nipkow@14025
   382
  by (auto simp add: sup_state_def stk_convert lesub_def Product.le_def)
kleing@10812
   383
kleing@10812
   384
theorem sup_state_Cons2:
kleing@10812
   385
  "(G \<turnstile> (xt, a) <=s (y#yt, b)) = 
kleing@10812
   386
   (\<exists>x xt'. xt=x#xt' \<and> (G \<turnstile> x \<preceq> y) \<and> (G \<turnstile> (xt',a) <=s (yt,b)))"
nipkow@14025
   387
  by (auto simp add: sup_state_def stk_convert lesub_def Product.le_def sup_loc_Cons2)
kleing@10812
   388
kleing@10812
   389
theorem sup_state_ignore_fst:  
kleing@13006
   390
  "G \<turnstile> (a, x) <=s (b, y) \<Longrightarrow> G \<turnstile> (c, x) <=s (c, y)"
kleing@10812
   391
  by (simp add: sup_state_def lesub_def Product.le_def)
kleing@10812
   392
kleing@10812
   393
theorem sup_state_rev_fst:
kleing@10812
   394
  "(G \<turnstile> (rev a, x) <=s (rev b, y)) = (G \<turnstile> (a, x) <=s (b, y))"
kleing@10812
   395
proof -
kleing@13006
   396
  have m: "\<And>f x. map f (rev x) = rev (map f x)" by (simp add: rev_map)
kleing@10812
   397
  show ?thesis by (simp add: m sup_state_def stk_convert lesub_def Product.le_def)
kleing@10812
   398
qed
kleing@10812
   399
  
kleing@10812
   400
kleing@10812
   401
lemma sup_state_opt_None_any [iff]:
kleing@10812
   402
  "(G \<turnstile> None <=' any) = True"
kleing@10812
   403
  by (simp add: sup_state_opt_def Opt.le_def split: option.split)
kleing@10812
   404
kleing@10812
   405
lemma sup_state_opt_any_None [iff]:
kleing@10812
   406
  "(G \<turnstile> any <=' None) = (any = None)"
kleing@10812
   407
  by (simp add: sup_state_opt_def Opt.le_def split: option.split)
kleing@10812
   408
kleing@10812
   409
lemma sup_state_opt_Some_Some [iff]:
kleing@10812
   410
  "(G \<turnstile> (Some a) <=' (Some b)) = (G \<turnstile> a <=s b)"
kleing@10812
   411
  by (simp add: sup_state_opt_def Opt.le_def lesub_def del: split_paired_Ex)
kleing@10812
   412
kleing@10812
   413
lemma sup_state_opt_any_Some [iff]:
kleing@10812
   414
  "(G \<turnstile> (Some a) <=' any) = (\<exists>b. any = Some b \<and> G \<turnstile> a <=s b)"
kleing@10812
   415
  by (simp add: sup_state_opt_def Opt.le_def lesub_def split: option.split)
kleing@10812
   416
kleing@10812
   417
lemma sup_state_opt_Some_any:
kleing@10812
   418
  "(G \<turnstile> any <=' (Some b)) = (any = None \<or> (\<exists>a. any = Some a \<and> G \<turnstile> a <=s b))"
kleing@10812
   419
  by (simp add: sup_state_opt_def Opt.le_def lesub_def split: option.split)
kleing@10812
   420
kleing@10812
   421
kleing@10812
   422
theorem sup_ty_opt_trans [trans]:
kleing@13006
   423
  "\<lbrakk>G \<turnstile> a <=o b; G \<turnstile> b <=o c\<rbrakk> \<Longrightarrow> G \<turnstile> a <=o c"
kleing@10812
   424
  by (auto intro: widen_trans 
kleing@10812
   425
           simp add: sup_ty_opt_def Err.le_def lesub_def subtype_def 
kleing@10812
   426
           split: err.splits)
kleing@10812
   427
kleing@10812
   428
theorem sup_loc_trans [trans]:
kleing@13006
   429
  "\<lbrakk>G \<turnstile> a <=l b; G \<turnstile> b <=l c\<rbrakk> \<Longrightarrow> G \<turnstile> a <=l c"
kleing@10812
   430
proof -
kleing@10812
   431
  assume G: "G \<turnstile> a <=l b" "G \<turnstile> b <=l c"
kleing@10812
   432
 
kleing@13006
   433
  hence "\<forall> n. n < length a \<longrightarrow> (G \<turnstile> (a!n) <=o (c!n))"
kleing@10812
   434
  proof (intro strip)
kleing@10812
   435
    fix n 
kleing@10812
   436
    assume n: "n < length a"
kleing@10812
   437
    with G
kleing@10812
   438
    have "G \<turnstile> (a!n) <=o (b!n)"
kleing@10812
   439
      by - (rule sup_loc_nth)
kleing@10812
   440
    also 
kleing@10812
   441
    from n G
kleing@13006
   442
    have "G \<turnstile> \<dots> <=o (c!n)"
kleing@10812
   443
      by - (rule sup_loc_nth, auto dest: sup_loc_length)
kleing@10812
   444
    finally
kleing@10812
   445
    show "G \<turnstile> (a!n) <=o (c!n)" .
kleing@10812
   446
  qed
kleing@10812
   447
kleing@10812
   448
  with G
kleing@10812
   449
  show ?thesis 
kleing@10812
   450
    by (auto intro!: all_nth_sup_loc [rule_format] dest!: sup_loc_length) 
kleing@10812
   451
qed
kleing@10812
   452
  
kleing@10812
   453
kleing@10812
   454
theorem sup_state_trans [trans]:
kleing@13006
   455
  "\<lbrakk>G \<turnstile> a <=s b; G \<turnstile> b <=s c\<rbrakk> \<Longrightarrow> G \<turnstile> a <=s c"
kleing@10812
   456
  by (auto intro: sup_loc_trans simp add: sup_state_def stk_convert Product.le_def lesub_def)
kleing@10812
   457
kleing@10812
   458
theorem sup_state_opt_trans [trans]:
kleing@13006
   459
  "\<lbrakk>G \<turnstile> a <=' b; G \<turnstile> b <=' c\<rbrakk> \<Longrightarrow> G \<turnstile> a <=' c"
kleing@10812
   460
  by (auto intro: sup_state_trans 
kleing@10812
   461
           simp add: sup_state_opt_def Opt.le_def lesub_def 
kleing@10812
   462
           split: option.splits)
kleing@10812
   463
kleing@10812
   464
end