src/HOL/Bali/Trans.thy
author berghofe
Mon Sep 30 16:14:02 2002 +0200 (2002-09-30)
changeset 13601 fd3e3d6b37b2
parent 13384 a34e38154413
child 13688 a0b16d42d489
permissions -rw-r--r--
Adapted to new simplifier.
wenzelm@12857
     1
(*  Title:      HOL/Bali/Trans.thy
schirmer@12854
     2
    ID:         $Id$
schirmer@12854
     3
    Author:     David von Oheimb
wenzelm@12858
     4
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
schirmer@12854
     5
schirmer@12854
     6
Operational transition (small-step) semantics of the 
schirmer@12854
     7
execution of Java expressions and statements
schirmer@12854
     8
schirmer@12854
     9
PRELIMINARY!!!!!!!!
schirmer@12854
    10
*)
schirmer@12854
    11
schirmer@13337
    12
theory Trans = Evaln:
schirmer@13337
    13
schirmer@13337
    14
constdefs groundVar:: "var \<Rightarrow> bool"
schirmer@13337
    15
"groundVar v \<equiv> (case v of
schirmer@13337
    16
                   LVar ln \<Rightarrow> True
schirmer@13337
    17
                 | {accC,statDeclC,stat}e..fn \<Rightarrow> \<exists> a. e=Lit a
schirmer@13337
    18
                 | e1.[e2] \<Rightarrow> \<exists> a i. e1= Lit a \<and> e2 = Lit i
schirmer@13337
    19
                 | InsInitV c v \<Rightarrow> False)"
schirmer@13337
    20
schirmer@13337
    21
lemma groundVar_cases [consumes 1, case_names LVar FVar AVar]:
schirmer@13337
    22
  assumes ground: "groundVar v" and
schirmer@13337
    23
          LVar: "\<And> ln. \<lbrakk>v=LVar ln\<rbrakk> \<Longrightarrow> P" and
schirmer@13337
    24
          FVar: "\<And> accC statDeclC stat a fn. 
schirmer@13337
    25
                    \<lbrakk>v={accC,statDeclC,stat}(Lit a)..fn\<rbrakk> \<Longrightarrow> P" and
schirmer@13337
    26
          AVar: "\<And> a i. \<lbrakk>v=(Lit a).[Lit i]\<rbrakk> \<Longrightarrow> P"
schirmer@13337
    27
  shows "P"
schirmer@13337
    28
proof -
schirmer@13337
    29
  from ground LVar FVar AVar
schirmer@13337
    30
  show ?thesis
schirmer@13337
    31
    apply (cases v)
schirmer@13337
    32
    apply (simp add: groundVar_def)
schirmer@13337
    33
    apply (simp add: groundVar_def,blast)
schirmer@13337
    34
    apply (simp add: groundVar_def,blast)
schirmer@13337
    35
    apply (simp add: groundVar_def)
schirmer@13337
    36
    done
schirmer@13337
    37
qed
schirmer@13337
    38
schirmer@13337
    39
constdefs groundExprs:: "expr list \<Rightarrow> bool"
schirmer@13337
    40
"groundExprs es \<equiv> list_all (\<lambda> e. \<exists> v. e=Lit v) es"
schirmer@13337
    41
  
schirmer@13337
    42
consts the_val:: "expr \<Rightarrow> val"
schirmer@13337
    43
primrec
schirmer@13337
    44
"the_val (Lit v) = v"
schirmer@13337
    45
schirmer@13337
    46
consts the_var:: "prog \<Rightarrow> state \<Rightarrow> var \<Rightarrow> (vvar \<times> state)"
schirmer@13337
    47
primrec
schirmer@13337
    48
"the_var G s (LVar ln)                    =(lvar ln (store s),s)"
schirmer@13337
    49
the_var_FVar_def:
schirmer@13337
    50
"the_var G s ({accC,statDeclC,stat}a..fn) =fvar statDeclC stat fn (the_val a) s"
schirmer@13337
    51
the_var_AVar_def:
schirmer@13337
    52
"the_var G s(a.[i])                       =avar G (the_val i) (the_val a) s"
schirmer@13337
    53
schirmer@13337
    54
lemma the_var_FVar_simp[simp]:
schirmer@13337
    55
"the_var G s ({accC,statDeclC,stat}(Lit a)..fn) = fvar statDeclC stat fn a s"
schirmer@13337
    56
by (simp)
schirmer@13337
    57
declare the_var_FVar_def [simp del]
schirmer@13337
    58
schirmer@13337
    59
lemma the_var_AVar_simp:
schirmer@13337
    60
"the_var G s ((Lit a).[Lit i]) = avar G i a s"
schirmer@13337
    61
by (simp)
schirmer@13337
    62
declare the_var_AVar_def [simp del]
schirmer@12854
    63
schirmer@12854
    64
consts
schirmer@13337
    65
  step	:: "prog \<Rightarrow> ((term \<times> state) \<times> (term \<times> state)) set"
schirmer@12854
    66
schirmer@12854
    67
syntax (symbols)
schirmer@13337
    68
  step :: "[prog,term \<times> state,term \<times> state] \<Rightarrow> bool" ("_\<turnstile>_ \<mapsto>1 _"[61,82,82] 81)
schirmer@13337
    69
  stepn:: "[prog, term \<times> state,nat,term \<times> state] \<Rightarrow> bool" 
schirmer@13337
    70
                                                  ("_\<turnstile>_ \<mapsto>_ _"[61,82,82] 81)
schirmer@13337
    71
"step*":: "[prog,term \<times> state,term \<times> state] \<Rightarrow> bool" ("_\<turnstile>_ \<mapsto>* _"[61,82,82] 81)
schirmer@13337
    72
  Ref  :: "loc \<Rightarrow> expr"
schirmer@13337
    73
  SKIP :: "expr"
schirmer@12854
    74
schirmer@12854
    75
translations
schirmer@13337
    76
  "G\<turnstile>p \<mapsto>1 p' " == "(p,p') \<in> step G"
schirmer@13337
    77
  "G\<turnstile>p \<mapsto>n p' " == "(p,p') \<in> (step G)^n"
schirmer@13337
    78
  "G\<turnstile>p \<mapsto>* p' " == "(p,p') \<in> (step G)\<^sup>*"
schirmer@12854
    79
  "Ref a" == "Lit (Addr a)"
schirmer@13337
    80
  "SKIP"  == "Lit Unit"
schirmer@12854
    81
schirmer@13337
    82
inductive "step G" intros 
schirmer@12854
    83
schirmer@12854
    84
(* evaluation of expression *)
schirmer@12854
    85
  (* cf. 15.5 *)
schirmer@13337
    86
Abrupt:	         "\<lbrakk>\<forall>v. t \<noteq> \<langle>Lit v\<rangle>;
schirmer@13337
    87
                  \<forall> t. t \<noteq> \<langle>l\<bullet> Skip\<rangle>;
schirmer@13337
    88
                  \<forall> C vn c.  t \<noteq> \<langle>Try Skip Catch(C vn) c\<rangle>;
schirmer@13337
    89
                  \<forall> x c. t \<noteq> \<langle>Skip Finally c\<rangle> \<and> xc \<noteq> Xcpt x;
schirmer@13337
    90
                  \<forall> a c. t \<noteq> \<langle>FinA a c\<rangle>\<rbrakk> 
schirmer@13337
    91
                \<Longrightarrow> 
schirmer@13337
    92
                  G\<turnstile>(t,Some xc,s) \<mapsto>1 (\<langle>Lit arbitrary\<rangle>,Some xc,s)"
schirmer@12854
    93
schirmer@13337
    94
InsInitE: "\<lbrakk>G\<turnstile>(\<langle>c\<rangle>,Norm s) \<mapsto>1 (\<langle>c'\<rangle>, s')\<rbrakk>
schirmer@13337
    95
           \<Longrightarrow> 
schirmer@13337
    96
           G\<turnstile>(\<langle>InsInitE c e\<rangle>,Norm s) \<mapsto>1 (\<langle>InsInitE c' e\<rangle>, s')"
schirmer@12854
    97
schirmer@13337
    98
(* SeqE: "G\<turnstile>(\<langle>Seq Skip e\<rangle>,Norm s) \<mapsto>1 (\<langle>e\<rangle>, Norm s)" *)
schirmer@13337
    99
(* Specialised rules to evaluate: 
schirmer@13337
   100
   InsInitE Skip (NewC C), InisInitE Skip (NewA T[e]) *)
schirmer@13337
   101
 
schirmer@13337
   102
  (* cf. 15.8.1 *)
schirmer@13337
   103
NewC: "G\<turnstile>(\<langle>NewC C\<rangle>,Norm s) \<mapsto>1 (\<langle>InsInitE (Init C) (NewC C)\<rangle>, Norm s)"
schirmer@13337
   104
NewCInited: "\<lbrakk>G\<turnstile> Norm s \<midarrow>halloc (CInst C)\<succ>a\<rightarrow> s'\<rbrakk> 
schirmer@13337
   105
             \<Longrightarrow> 
schirmer@13337
   106
             G\<turnstile>(\<langle>InsInitE Skip (NewC C)\<rangle>,Norm s) \<mapsto>1 (\<langle>Ref a\<rangle>, s')"
schirmer@12854
   107
schirmer@12854
   108
schirmer@12854
   109
schirmer@13337
   110
(* Alternative when rule SeqE is present 
schirmer@13337
   111
NewCInited: "\<lbrakk>inited C (globs s); 
schirmer@13337
   112
              G\<turnstile> Norm s \<midarrow>halloc (CInst C)\<succ>a\<rightarrow> s'\<rbrakk> 
schirmer@13337
   113
             \<Longrightarrow> 
schirmer@13337
   114
              G\<turnstile>(\<langle>NewC C\<rangle>,Norm s) \<mapsto>1 (\<langle>Ref a\<rangle>, s')"
schirmer@13337
   115
schirmer@13337
   116
NewC:
schirmer@13337
   117
     "\<lbrakk>\<not> inited C (globs s)\<rbrakk> 
schirmer@13337
   118
     \<Longrightarrow> 
schirmer@13337
   119
      G\<turnstile>(\<langle>NewC C\<rangle>,Norm s) \<mapsto>1 (\<langle>Seq (Init C) (NewC C)\<rangle>, Norm s)"
schirmer@13337
   120
schirmer@13337
   121
*)
schirmer@13337
   122
  (* cf. 15.9.1 *)
schirmer@13337
   123
NewA: 
schirmer@13337
   124
   "G\<turnstile>(\<langle>New T[e]\<rangle>,Norm s) \<mapsto>1 (\<langle>InsInitE (init_comp_ty T) (New T[e])\<rangle>,Norm s)"
schirmer@13337
   125
InsInitNewAIdx: 
schirmer@13337
   126
   "\<lbrakk>G\<turnstile>(\<langle>e\<rangle>,Norm s) \<mapsto>1 (\<langle>e'\<rangle>, s')\<rbrakk>
schirmer@13337
   127
    \<Longrightarrow>  
schirmer@13337
   128
    G\<turnstile>(\<langle>InsInitE Skip (New T[e])\<rangle>,Norm s) \<mapsto>1 (\<langle>InsInitE Skip (New T[e'])\<rangle>,s')"
schirmer@13337
   129
InsInitNewA: 
schirmer@13337
   130
   "\<lbrakk>G\<turnstile>abupd (check_neg i) (Norm s) \<midarrow>halloc (Arr T (the_Intg i))\<succ>a\<rightarrow> s' \<rbrakk>
schirmer@13337
   131
    \<Longrightarrow>
schirmer@13337
   132
    G\<turnstile>(\<langle>InsInitE Skip (New T[Lit i])\<rangle>,Norm s) \<mapsto>1 (\<langle>Ref a\<rangle>,s')"
schirmer@13337
   133
 
schirmer@13337
   134
  (* cf. 15.15 *)
schirmer@13337
   135
CastE:	
schirmer@13337
   136
   "\<lbrakk>G\<turnstile>(\<langle>e\<rangle>,Norm s) \<mapsto>1 (\<langle>e'\<rangle>,s')\<rbrakk> 
schirmer@13337
   137
    \<Longrightarrow>
schirmer@13337
   138
    G\<turnstile>(\<langle>Cast T e\<rangle>,None,s) \<mapsto>1 (\<langle>Cast T e'\<rangle>,s')" 
schirmer@13337
   139
Cast:	
schirmer@13337
   140
   "\<lbrakk>s' = abupd (raise_if (\<not>G,s\<turnstile>v fits T)  ClassCast) (Norm s)\<rbrakk> 
schirmer@13337
   141
    \<Longrightarrow> 
schirmer@13337
   142
    G\<turnstile>(\<langle>Cast T (Lit v)\<rangle>,Norm s) \<mapsto>1 (\<langle>Lit v\<rangle>,s')"
schirmer@13337
   143
  (* can be written without abupd, since we know Norm s *)
schirmer@12854
   144
schirmer@12854
   145
schirmer@13337
   146
InstE: "\<lbrakk>G\<turnstile>(\<langle>e\<rangle>,Norm s) \<mapsto>1 (\<langle>e'::expr\<rangle>,s')\<rbrakk> 
schirmer@13337
   147
        \<Longrightarrow> 
schirmer@13337
   148
        G\<turnstile>(\<langle>e InstOf T\<rangle>,Norm s) \<mapsto>1 (\<langle>e'\<rangle>,s')" 
schirmer@13337
   149
Inst:  "\<lbrakk>b = (v\<noteq>Null \<and> G,s\<turnstile>v fits RefT T)\<rbrakk> 
schirmer@13337
   150
        \<Longrightarrow> 
schirmer@13337
   151
        G\<turnstile>(\<langle>(Lit v) InstOf T\<rangle>,Norm s) \<mapsto>1 (\<langle>Lit (Bool b)\<rangle>,s')"
schirmer@13337
   152
schirmer@13337
   153
  (* cf. 15.7.1 *)
schirmer@13337
   154
(*Lit				"G\<turnstile>(Lit v,None,s) \<mapsto>1 (Lit v,None,s)"*)
schirmer@13337
   155
schirmer@13337
   156
UnOpE:  "\<lbrakk>G\<turnstile>(\<langle>e\<rangle>,Norm s) \<mapsto>1 (\<langle>e'\<rangle>,s') \<rbrakk>
schirmer@13337
   157
         \<Longrightarrow> 
schirmer@13337
   158
         G\<turnstile>(\<langle>UnOp unop e\<rangle>,Norm s) \<mapsto>1 (\<langle>UnOp unop e'\<rangle>,s')"
schirmer@13337
   159
UnOp:   "G\<turnstile>(\<langle>UnOp unop (Lit v)\<rangle>,Norm s) \<mapsto>1 (\<langle>Lit (eval_unop unop v)\<rangle>,Norm s)"
schirmer@13337
   160
schirmer@13337
   161
BinOpE1:  "\<lbrakk>G\<turnstile>(\<langle>e1\<rangle>,Norm s) \<mapsto>1 (\<langle>e1'\<rangle>,s') \<rbrakk>
schirmer@13337
   162
           \<Longrightarrow> 
schirmer@13337
   163
           G\<turnstile>(\<langle>BinOp binop e1 e2\<rangle>,Norm s) \<mapsto>1 (\<langle>BinOp binop e1' e2\<rangle>,s')"
schirmer@13384
   164
BinOpE2:  "\<lbrakk>need_second_arg binop v1; G\<turnstile>(\<langle>e2\<rangle>,Norm s) \<mapsto>1 (\<langle>e2'\<rangle>,s') \<rbrakk>
schirmer@13337
   165
           \<Longrightarrow> 
schirmer@13337
   166
           G\<turnstile>(\<langle>BinOp binop (Lit v1) e2\<rangle>,Norm s) 
schirmer@13337
   167
            \<mapsto>1 (\<langle>BinOp binop (Lit v1) e2'\<rangle>,s')"
schirmer@13384
   168
BinOpTerm:  "\<lbrakk>\<not> need_second_arg binop v1\<rbrakk>
schirmer@13384
   169
             \<Longrightarrow> 
schirmer@13384
   170
             G\<turnstile>(\<langle>BinOp binop (Lit v1) e2\<rangle>,Norm s) 
schirmer@13384
   171
              \<mapsto>1 (\<langle>Lit v1\<rangle>,Norm s)"
schirmer@13337
   172
BinOp:    "G\<turnstile>(\<langle>BinOp binop (Lit v1) (Lit v2)\<rangle>,Norm s) 
schirmer@13337
   173
            \<mapsto>1 (\<langle>Lit (eval_binop binop v1 v2)\<rangle>,Norm s)"
schirmer@13384
   174
(* Maybe its more convenient to add: need_second_arg as precondition to BinOp 
schirmer@13384
   175
   to make the choice between BinOpTerm and BinOp deterministic *)
schirmer@13384
   176
   
schirmer@13337
   177
Super: "G\<turnstile>(\<langle>Super\<rangle>,Norm s) \<mapsto>1 (\<langle>Lit (val_this s)\<rangle>,Norm s)"
schirmer@13337
   178
schirmer@13337
   179
AccVA: "\<lbrakk>G\<turnstile>(\<langle>va\<rangle>,Norm s) \<mapsto>1 (\<langle>va'\<rangle>,s') \<rbrakk>
schirmer@13337
   180
        \<Longrightarrow> 
schirmer@13337
   181
        G\<turnstile>(\<langle>Acc va\<rangle>,Norm s) \<mapsto>1 (\<langle>Acc va'\<rangle>,s')"
schirmer@13337
   182
Acc:  "\<lbrakk>groundVar va; ((v,vf),s') = the_var G (Norm s) va\<rbrakk>
schirmer@13337
   183
       \<Longrightarrow>  
schirmer@13337
   184
       G\<turnstile>(\<langle>Acc va\<rangle>,Norm s) \<mapsto>1 (\<langle>Lit v\<rangle>,s')"
schirmer@13337
   185
schirmer@13337
   186
(*
schirmer@13337
   187
AccLVar: "G\<turnstile>(\<langle>Acc (LVar vn)\<rangle>,Norm s) \<mapsto>1 (\<langle>Lit (fst (lvar vn s))\<rangle>,Norm s)"
schirmer@13337
   188
AccFVar: "\<lbrakk>((v,vf),s') = fvar statDeclC stat fn a (Norm s)\<rbrakk>
schirmer@13337
   189
          \<Longrightarrow>  
schirmer@13337
   190
          G\<turnstile>(\<langle>Acc ({accC,statDeclC,stat}(Lit a)..fn)\<rangle>,Norm s) 
schirmer@13337
   191
           \<mapsto>1 (\<langle>Lit v\<rangle>,s')"
schirmer@13337
   192
AccAVar: "\<lbrakk>((v,vf),s') = avar G i a (Norm s)\<rbrakk>
schirmer@13337
   193
          \<Longrightarrow>  
schirmer@13337
   194
          G\<turnstile>(\<langle>Acc ((Lit a).[Lit i])\<rangle>,Norm s) \<mapsto>1 (\<langle>Lit v\<rangle>,s')"
schirmer@13337
   195
*) 
schirmer@13337
   196
AssVA:  "\<lbrakk>G\<turnstile>(\<langle>va\<rangle>,Norm s) \<mapsto>1 (\<langle>va'\<rangle>,s')\<rbrakk> 
schirmer@13337
   197
         \<Longrightarrow> 
schirmer@13337
   198
         G\<turnstile>(\<langle>va:=e\<rangle>,Norm s) \<mapsto>1 (\<langle>va':=e\<rangle>,s')"
schirmer@13337
   199
AssE:   "\<lbrakk>groundVar va; G\<turnstile>(\<langle>e\<rangle>,Norm s) \<mapsto>1 (\<langle>e'\<rangle>,s')\<rbrakk> 
schirmer@13337
   200
         \<Longrightarrow> 
schirmer@13337
   201
         G\<turnstile>(\<langle>va:=e\<rangle>,Norm s) \<mapsto>1 (\<langle>va:=e'\<rangle>,s')"
schirmer@13337
   202
Ass:    "\<lbrakk>groundVar va; ((w,f),s') = the_var G (Norm s) va\<rbrakk> 
schirmer@13337
   203
         \<Longrightarrow> 
schirmer@13337
   204
         G\<turnstile>(\<langle>va:=(Lit v)\<rangle>,Norm s) \<mapsto>1 (\<langle>Lit v\<rangle>,assign f v s')"
schirmer@13337
   205
schirmer@13337
   206
CondC: "\<lbrakk>G\<turnstile>(\<langle>e0\<rangle>,Norm s) \<mapsto>1 (\<langle>e0'\<rangle>,s')\<rbrakk> 
schirmer@13337
   207
        \<Longrightarrow> 
schirmer@13337
   208
        G\<turnstile>(\<langle>e0? e1:e2\<rangle>,Norm s) \<mapsto>1 (\<langle>e0'? e1:e2\<rangle>,s')"
schirmer@13337
   209
Cond:  "G\<turnstile>(\<langle>Lit b? e1:e2\<rangle>,Norm s) \<mapsto>1 (\<langle>if the_Bool b then e1 else e2\<rangle>,Norm s)"
schirmer@13337
   210
schirmer@13337
   211
schirmer@13337
   212
CallTarget: "\<lbrakk>G\<turnstile>(\<langle>e\<rangle>,Norm s) \<mapsto>1 (\<langle>e'\<rangle>,s')\<rbrakk> 
schirmer@13337
   213
             \<Longrightarrow>
schirmer@13337
   214
	     G\<turnstile>(\<langle>{accC,statT,mode}e\<cdot>mn({pTs}args)\<rangle>,Norm s) 
schirmer@13337
   215
              \<mapsto>1 (\<langle>{accC,statT,mode}e'\<cdot>mn({pTs}args)\<rangle>,s')"
schirmer@13337
   216
CallArgs:   "\<lbrakk>G\<turnstile>(\<langle>args\<rangle>,Norm s) \<mapsto>1 (\<langle>args'\<rangle>,s')\<rbrakk> 
schirmer@13337
   217
             \<Longrightarrow>
schirmer@13337
   218
	     G\<turnstile>(\<langle>{accC,statT,mode}Lit a\<cdot>mn({pTs}args)\<rangle>,Norm s) 
schirmer@13337
   219
              \<mapsto>1 (\<langle>{accC,statT,mode}Lit a\<cdot>mn({pTs}args')\<rangle>,s')"
schirmer@13337
   220
Call:       "\<lbrakk>groundExprs args; vs = map the_val args;
schirmer@13337
   221
              D = invocation_declclass G mode s a statT \<lparr>name=mn,parTs=pTs\<rparr>;
schirmer@13337
   222
              s'=init_lvars G D \<lparr>name=mn,parTs=pTs\<rparr> mode a' vs (Norm s)\<rbrakk> 
schirmer@13337
   223
             \<Longrightarrow> 
schirmer@13337
   224
             G\<turnstile>(\<langle>{accC,statT,mode}Lit a\<cdot>mn({pTs}args)\<rangle>,Norm s) 
schirmer@13337
   225
              \<mapsto>1 (\<langle>Callee (locals s) (Methd D \<lparr>name=mn,parTs=pTs\<rparr>)\<rangle>,s')"
schirmer@13337
   226
           
schirmer@13337
   227
Callee:     "\<lbrakk>G\<turnstile>(\<langle>e\<rangle>,Norm s) \<mapsto>1 (\<langle>e'::expr\<rangle>,s')\<rbrakk>
schirmer@13337
   228
             \<Longrightarrow> 
schirmer@13337
   229
             G\<turnstile>(\<langle>Callee lcls_caller e\<rangle>,Norm s) \<mapsto>1 (\<langle>e'\<rangle>,s')"
schirmer@13337
   230
schirmer@13337
   231
CalleeRet:   "G\<turnstile>(\<langle>Callee lcls_caller (Lit v)\<rangle>,Norm s) 
schirmer@13337
   232
               \<mapsto>1 (\<langle>Lit v\<rangle>,(set_lvars lcls_caller (Norm s)))"
schirmer@13337
   233
schirmer@13337
   234
Methd: "G\<turnstile>(\<langle>Methd D sig\<rangle>,Norm s) \<mapsto>1 (\<langle>body G D sig\<rangle>,Norm s)"
schirmer@13337
   235
schirmer@13337
   236
Body: "G\<turnstile>(\<langle>Body D c\<rangle>,Norm s) \<mapsto>1 (\<langle>InsInitE (Init D) (Body D c)\<rangle>,Norm s)"
schirmer@13337
   237
schirmer@13337
   238
InsInitBody: 
schirmer@13337
   239
    "\<lbrakk>G\<turnstile>(\<langle>c\<rangle>,Norm s) \<mapsto>1 (\<langle>c'\<rangle>,s')\<rbrakk>
schirmer@13337
   240
     \<Longrightarrow> 
schirmer@13337
   241
     G\<turnstile>(\<langle>InsInitE Skip (Body D c)\<rangle>,Norm s) \<mapsto>1(\<langle>InsInitE Skip (Body D c')\<rangle>,s')"
schirmer@13337
   242
InsInitBodyRet: 
schirmer@13337
   243
     "G\<turnstile>(\<langle>InsInitE Skip (Body D Skip)\<rangle>,Norm s)
schirmer@13337
   244
       \<mapsto>1 (\<langle>Lit (the ((locals s) Result))\<rangle>,abupd (absorb Ret) (Norm s))"
schirmer@13337
   245
schirmer@13337
   246
(*   LVar: "G\<turnstile>(LVar vn,Norm s)" is already evaluated *)
schirmer@13337
   247
  
schirmer@13337
   248
FVar: "\<lbrakk>\<not> inited statDeclC (globs s)\<rbrakk>
schirmer@13337
   249
       \<Longrightarrow> 
schirmer@13337
   250
       G\<turnstile>(\<langle>{accC,statDeclC,stat}e..fn\<rangle>,Norm s) 
schirmer@13337
   251
        \<mapsto>1 (\<langle>InsInitV (Init statDeclC) ({accC,statDeclC,stat}e..fn)\<rangle>,Norm s)"
schirmer@13337
   252
InsInitFVarE:
schirmer@13337
   253
      "\<lbrakk>G\<turnstile>(\<langle>e\<rangle>,Norm s) \<mapsto>1 (\<langle>e'\<rangle>,s')\<rbrakk>
schirmer@13337
   254
       \<Longrightarrow>
schirmer@13337
   255
       G\<turnstile>(\<langle>InsInitV Skip ({accC,statDeclC,stat}e..fn)\<rangle>,Norm s) 
schirmer@13337
   256
        \<mapsto>1 (\<langle>InsInitV Skip ({accC,statDeclC,stat}e'..fn)\<rangle>,s')"
schirmer@13337
   257
InsInitFVar:
schirmer@13337
   258
      "G\<turnstile>(\<langle>InsInitV Skip ({accC,statDeclC,stat}Lit a..fn)\<rangle>,Norm s) 
schirmer@13337
   259
        \<mapsto>1 (\<langle>{accC,statDeclC,stat}Lit a..fn\<rangle>,Norm s)"
schirmer@13337
   260
--  {* Notice, that we do not have literal values for @{text vars}. 
schirmer@13337
   261
The rules for accessing variables (@{text Acc}) and assigning to variables 
schirmer@13337
   262
(@{text Ass}), test this with the predicate @{text groundVar}.  After 
schirmer@13337
   263
initialisation is done and the @{text FVar} is evaluated, we can't just 
schirmer@13337
   264
throw away the @{text InsInitFVar} term and return a literal value, as in the 
schirmer@13337
   265
cases of @{text New}  or @{text NewC}. Instead we just return the evaluated 
schirmer@13337
   266
@{text FVar} and test for initialisation in the rule @{text FVar}. 
schirmer@13337
   267
*}
schirmer@13337
   268
schirmer@13337
   269
schirmer@13337
   270
AVarE1: "\<lbrakk>G\<turnstile>(\<langle>e1\<rangle>,Norm s) \<mapsto>1 (\<langle>e1'\<rangle>,s')\<rbrakk> 
schirmer@13337
   271
         \<Longrightarrow> 
schirmer@13337
   272
         G\<turnstile>(\<langle>e1.[e2]\<rangle>,Norm s) \<mapsto>1 (\<langle>e1'.[e2]\<rangle>,s')"
schirmer@13337
   273
schirmer@13337
   274
AVarE2: "G\<turnstile>(\<langle>e2\<rangle>,Norm s) \<mapsto>1 (\<langle>e2'\<rangle>,s') 
schirmer@13337
   275
         \<Longrightarrow> 
schirmer@13337
   276
         G\<turnstile>(\<langle>Lit a.[e2]\<rangle>,Norm s) \<mapsto>1 (\<langle>Lit a.[e2']\<rangle>,s')"
schirmer@13337
   277
schirmer@13337
   278
(* AVar: \<langle>(Lit a).[Lit i]\<rangle> is fully evaluated *)
schirmer@13337
   279
schirmer@13337
   280
(* evaluation of expression lists *)
schirmer@13337
   281
schirmer@13337
   282
  -- {* @{text Nil}  is fully evaluated *}
schirmer@13337
   283
schirmer@13337
   284
ConsHd: "\<lbrakk>G\<turnstile>(\<langle>e::expr\<rangle>,Norm s) \<mapsto>1 (\<langle>e'::expr\<rangle>,s')\<rbrakk> 
schirmer@13337
   285
         \<Longrightarrow>
schirmer@13337
   286
         G\<turnstile>(\<langle>e#es\<rangle>,Norm s) \<mapsto>1 (\<langle>e'#es\<rangle>,s')"
schirmer@13337
   287
  
schirmer@13337
   288
ConsTl: "\<lbrakk>G\<turnstile>(\<langle>es\<rangle>,Norm s) \<mapsto>1 (\<langle>es'\<rangle>,s')\<rbrakk> 
schirmer@13337
   289
         \<Longrightarrow>
schirmer@13337
   290
         G\<turnstile>(\<langle>(Lit v)#es\<rangle>,Norm s) \<mapsto>1 (\<langle>(Lit v)#es'\<rangle>,s')"
schirmer@12854
   291
schirmer@12854
   292
(* execution of statements *)
schirmer@12854
   293
schirmer@12854
   294
  (* cf. 14.5 *)
schirmer@13337
   295
Skip: "G\<turnstile>(\<langle>Skip\<rangle>,Norm s) \<mapsto>1 (\<langle>SKIP\<rangle>,Norm s)"
schirmer@12854
   296
schirmer@13337
   297
ExprE: "\<lbrakk>G\<turnstile>(\<langle>e\<rangle>,Norm s) \<mapsto>1 (\<langle>e'\<rangle>,s')\<rbrakk> 
schirmer@13337
   298
        \<Longrightarrow> 
schirmer@13337
   299
        G\<turnstile>(\<langle>Expr e\<rangle>,Norm s) \<mapsto>1 (\<langle>Expr e'\<rangle>,s')"
schirmer@13337
   300
Expr:  "G\<turnstile>(\<langle>Expr (Lit v)\<rangle>,Norm s) \<mapsto>1 (\<langle>Skip\<rangle>,Norm s)"
schirmer@12854
   301
schirmer@12854
   302
schirmer@13337
   303
LabC: "\<lbrakk>G\<turnstile>(\<langle>c\<rangle>,Norm s) \<mapsto>1 (\<langle>c'\<rangle>,s')\<rbrakk> 
schirmer@13337
   304
       \<Longrightarrow>  
schirmer@13337
   305
       G\<turnstile>(\<langle>l\<bullet> c\<rangle>,Norm s) \<mapsto>1 (\<langle>l\<bullet> c'\<rangle>,s')"
schirmer@13337
   306
Lab:  "G\<turnstile>(\<langle>l\<bullet> Skip\<rangle>,s) \<mapsto>1 (\<langle>Skip\<rangle>, abupd (absorb l) s)"
schirmer@13337
   307
schirmer@13337
   308
  (* cf. 14.2 *)
schirmer@13337
   309
CompC1:	"\<lbrakk>G\<turnstile>(\<langle>c1\<rangle>,Norm s) \<mapsto>1 (\<langle>c1'\<rangle>,s')\<rbrakk> 
schirmer@13337
   310
         \<Longrightarrow> 
schirmer@13337
   311
         G\<turnstile>(\<langle>c1;; c2\<rangle>,Norm s) \<mapsto>1 (\<langle>c1';; c2\<rangle>,s')"
schirmer@13337
   312
schirmer@13337
   313
Comp:   "G\<turnstile>(\<langle>Skip;; c2\<rangle>,Norm s) \<mapsto>1 (\<langle>c2\<rangle>,Norm s)"
schirmer@12854
   314
schirmer@12854
   315
  (* cf. 14.8.2 *)
schirmer@13337
   316
IfE: "\<lbrakk>G\<turnstile>(\<langle>e\<rangle> ,Norm s) \<mapsto>1 (\<langle>e'\<rangle>,s')\<rbrakk> 
schirmer@13337
   317
      \<Longrightarrow>
schirmer@13337
   318
      G\<turnstile>(\<langle>If(e) s1 Else s2\<rangle>,Norm s) \<mapsto>1 (\<langle>If(e') s1 Else s2\<rangle>,s')"
schirmer@13337
   319
If:  "G\<turnstile>(\<langle>If(Lit v) s1 Else s2\<rangle>,Norm s) 
schirmer@13337
   320
       \<mapsto>1 (\<langle>if the_Bool v then s1 else s2\<rangle>,Norm s)"
schirmer@12854
   321
schirmer@12854
   322
  (* cf. 14.10, 14.10.1 *)
schirmer@13337
   323
Loop: "G\<turnstile>(\<langle>l\<bullet> While(e) c\<rangle>,Norm s) 
schirmer@13337
   324
        \<mapsto>1 (\<langle>If(e) (Cont l\<bullet>c;; l\<bullet> While(e) c) Else Skip\<rangle>,Norm s)"
schirmer@13337
   325
schirmer@13337
   326
Do: "G\<turnstile>(\<langle>Do j\<rangle>,Norm s) \<mapsto>1 (\<langle>Skip\<rangle>,(Some (Jump j), s))"
schirmer@13337
   327
schirmer@13337
   328
ThrowE: "\<lbrakk>G\<turnstile>(\<langle>e\<rangle>,Norm s) \<mapsto>1 (\<langle>e'\<rangle>,s')\<rbrakk> 
schirmer@13337
   329
         \<Longrightarrow>
schirmer@13337
   330
         G\<turnstile>(\<langle>Throw e\<rangle>,Norm s) \<mapsto>1 (\<langle>Throw e'\<rangle>,s')"
schirmer@13337
   331
Throw:  "G\<turnstile>(\<langle>Throw (Lit a)\<rangle>,Norm s) \<mapsto>1 (\<langle>Skip\<rangle>,abupd (throw a) (Norm s))"
schirmer@13337
   332
schirmer@13337
   333
TryC1: "\<lbrakk>G\<turnstile>(\<langle>c1\<rangle>,Norm s) \<mapsto>1 (\<langle>c1'\<rangle>,s')\<rbrakk> 
schirmer@13337
   334
        \<Longrightarrow>
schirmer@13337
   335
        G\<turnstile>(\<langle>Try c1 Catch(C vn) c2\<rangle>, Norm s) \<mapsto>1 (\<langle>Try c1' Catch(C vn) c2\<rangle>,s')"
schirmer@13337
   336
Try:   "\<lbrakk>G\<turnstile>s \<midarrow>sxalloc\<rightarrow> s'\<rbrakk>
schirmer@13337
   337
        \<Longrightarrow>
schirmer@13337
   338
        G\<turnstile>(\<langle>Try Skip Catch(C vn) c2\<rangle>, s) 
schirmer@13337
   339
         \<mapsto>1 (if G,s'\<turnstile>catch C then (\<langle>c2\<rangle>,new_xcpt_var vn s')
schirmer@13337
   340
                              else (\<langle>Skip\<rangle>,s'))"
schirmer@13337
   341
schirmer@13337
   342
FinC1: "\<lbrakk>G\<turnstile>(\<langle>c1\<rangle>,Norm s) \<mapsto>1 (\<langle>c1'\<rangle>,s')\<rbrakk> 
schirmer@13337
   343
        \<Longrightarrow>
schirmer@13337
   344
        G\<turnstile>(\<langle>c1 Finally c2\<rangle>,Norm s) \<mapsto>1 (\<langle>c1' Finally c2\<rangle>,s')"
schirmer@13337
   345
schirmer@13337
   346
Fin:    "G\<turnstile>(\<langle>Skip Finally c2\<rangle>,(a,s)) \<mapsto>1 (\<langle>FinA a c2\<rangle>,Norm s)"
schirmer@13337
   347
schirmer@13337
   348
FinAC: "\<lbrakk>G\<turnstile>(\<langle>c\<rangle>,s) \<mapsto>1 (\<langle>c'\<rangle>,s')\<rbrakk>
schirmer@13337
   349
        \<Longrightarrow>
schirmer@13337
   350
        G\<turnstile>(\<langle>FinA a c\<rangle>,s) \<mapsto>1 (\<langle>FinA a c'\<rangle>,s')"
schirmer@13337
   351
FinA: "G\<turnstile>(\<langle>FinA a Skip\<rangle>,s) \<mapsto>1 (\<langle>Skip\<rangle>,abupd (abrupt_if (a\<noteq>None) a) s)"
schirmer@13337
   352
schirmer@13337
   353
schirmer@13337
   354
Init1: "\<lbrakk>inited C (globs s)\<rbrakk> 
schirmer@13337
   355
        \<Longrightarrow> 
schirmer@13337
   356
        G\<turnstile>(\<langle>Init C\<rangle>,Norm s) \<mapsto>1 (\<langle>Skip\<rangle>,Norm s)"
schirmer@13337
   357
Init: "\<lbrakk>the (class G C)=c; \<not> inited C (globs s)\<rbrakk>  
schirmer@13337
   358
       \<Longrightarrow> 
schirmer@13337
   359
       G\<turnstile>(\<langle>Init C\<rangle>,Norm s) 
schirmer@13337
   360
        \<mapsto>1 (\<langle>(if C = Object then Skip else (Init (super c)));;
schirmer@13337
   361
              Expr (Callee (locals s) (InsInitE (init c) SKIP))\<rangle>
schirmer@13337
   362
             ,Norm (init_class_obj G C s))"
schirmer@13337
   363
-- {* @{text InsInitE} is just used as trick to embed the statement 
schirmer@13337
   364
@{text "init c"} into an expression*} 
schirmer@13337
   365
InsInitESKIP:
schirmer@13337
   366
  "G\<turnstile>(\<langle>InsInitE Skip SKIP\<rangle>,Norm s) \<mapsto>1 (\<langle>SKIP\<rangle>,Norm s)"
schirmer@13337
   367
         
schirmer@13337
   368
(* Equivalenzen:
schirmer@13337
   369
  Bigstep zu Smallstep komplett.
schirmer@13337
   370
  Smallstep zu Bigstep, nur wenn nicht die Ausdrücke Callee, FinA ,\<dots>
schirmer@12925
   371
*)
schirmer@12854
   372
schirmer@13337
   373
lemma rtrancl_imp_rel_pow: "p \<in> R^* \<Longrightarrow> \<exists>n. p \<in> R^n"
schirmer@13337
   374
proof -
schirmer@13337
   375
  assume "p \<in> R\<^sup>*"
schirmer@13337
   376
  moreover obtain x y where p: "p = (x,y)" by (cases p)
schirmer@13337
   377
  ultimately have "(x,y) \<in> R\<^sup>*" by hypsubst
schirmer@13337
   378
  hence "\<exists>n. (x,y) \<in> R^n"
schirmer@13337
   379
  proof induct
schirmer@13337
   380
    fix a have "(a,a) \<in> R^0" by simp
schirmer@13337
   381
    thus "\<exists>n. (a,a) \<in> R ^ n" ..
schirmer@13337
   382
  next
schirmer@13337
   383
    fix a b c assume "\<exists>n. (a,b) \<in> R ^ n"
schirmer@13337
   384
    then obtain n where "(a,b) \<in> R^n" ..
schirmer@13337
   385
    moreover assume "(b,c) \<in> R"
schirmer@13337
   386
    ultimately have "(a,c) \<in> R^(Suc n)" by auto
schirmer@13337
   387
    thus "\<exists>n. (a,c) \<in> R^n" ..
schirmer@13337
   388
  qed
schirmer@13337
   389
  with p show ?thesis by hypsubst
schirmer@13337
   390
qed  
schirmer@13337
   391
schirmer@13337
   392
(*
schirmer@13337
   393
lemma imp_eval_trans:
schirmer@13337
   394
  assumes eval: "G\<turnstile>s0 \<midarrow>t\<succ>\<rightarrow> (v,s1)" 
schirmer@13337
   395
    shows trans: "G\<turnstile>(t,s0) \<mapsto>* (\<langle>Lit v\<rangle>,s1)"
schirmer@13337
   396
*)
schirmer@13337
   397
(* Jetzt muss man bei trans natürlich wieder unterscheiden: Stmt, Expr, Var!
schirmer@13337
   398
   Sowas blödes:
schirmer@13337
   399
   Am besten den Terminus ground auf Var,Stmt,Expr hochziehen und dann
schirmer@13337
   400
   the_vals definieren\<dots>
schirmer@13337
   401
  G\<turnstile>(t,s0) \<mapsto>* (t',s1) \<and> the_vals t' = v
schirmer@13337
   402
*)
schirmer@13337
   403
schirmer@13337
   404
schirmer@13337
   405
end