src/HOL/Hoare/Hoare.thy
author nipkow
Mon Oct 28 14:29:51 2002 +0100 (2002-10-28)
changeset 13682 91674c8a008b
parent 11606 43abedd4467e
child 13696 631460c31a1f
permissions -rw-r--r--
conversion ML -> thy
clasohm@1476
     1
(*  Title:      HOL/Hoare/Hoare.thy
nipkow@1335
     2
    ID:         $Id$
nipkow@5646
     3
    Author:     Leonor Prensa Nieto & Tobias Nipkow
nipkow@5646
     4
    Copyright   1998 TUM
nipkow@1335
     5
nipkow@1335
     6
Sugared semantic embedding of Hoare logic.
nipkow@5646
     7
Strictly speaking a shallow embedding (as implemented by Norbert Galm
nipkow@5646
     8
following Mike Gordon) would suffice. Maybe the datatype com comes in useful
nipkow@5646
     9
later.
nipkow@1335
    10
*)
nipkow@1335
    11
nipkow@13682
    12
theory Hoare  = Main
nipkow@13682
    13
files ("Hoare.ML"):
nipkow@1335
    14
nipkow@1335
    15
types
nipkow@13682
    16
    'a bexp = "'a set"
nipkow@13682
    17
    'a assn = "'a set"
nipkow@5646
    18
nipkow@5646
    19
datatype
nipkow@13682
    20
 'a com = Basic "'a \<Rightarrow> 'a"         
nipkow@13682
    21
   | Seq "'a com" "'a com"               ("(_;/ _)"      [61,60] 60)
nipkow@13682
    22
   | Cond "'a bexp" "'a com" "'a com"    ("(1IF _/ THEN _ / ELSE _/ FI)"  [0,0,0] 61)
nipkow@13682
    23
   | While "'a bexp" "'a assn" "'a com"  ("(1WHILE _/ INV {_} //DO _ /OD)"  [0,0,0] 61)
nipkow@5646
    24
  
nipkow@5646
    25
syntax
nipkow@13682
    26
  "@assign"  :: "id => 'b => 'a com"        ("(2_ :=/ _)" [70,65] 61)
nipkow@13682
    27
  "@annskip" :: "'a com"                    ("SKIP")
nipkow@5646
    28
nipkow@5646
    29
translations
nipkow@5646
    30
            "SKIP" == "Basic id"
nipkow@5646
    31
nipkow@13682
    32
types 'a sem = "'a => 'a => bool"
nipkow@5646
    33
nipkow@13682
    34
consts iter :: "nat => 'a bexp => 'a sem => 'a sem"
nipkow@5646
    35
primrec
nipkow@5646
    36
"iter 0 b S = (%s s'. s ~: b & (s=s'))"
nipkow@5646
    37
"iter (Suc n) b S = (%s s'. s : b & (? s''. S s s'' & iter n b S s'' s'))"
nipkow@5646
    38
nipkow@13682
    39
consts Sem :: "'a com => 'a sem"
nipkow@5646
    40
primrec
nipkow@5646
    41
"Sem(Basic f) s s' = (s' = f s)"
nipkow@5646
    42
"Sem(c1;c2) s s' = (? s''. Sem c1 s s'' & Sem c2 s'' s')"
nipkow@5646
    43
"Sem(IF b THEN c1 ELSE c2 FI) s s' = ((s  : b --> Sem c1 s s') &
nipkow@5646
    44
                                      (s ~: b --> Sem c2 s s'))"
nipkow@5646
    45
"Sem(While b x c) s s' = (? n. iter n b (Sem c) s s')"
nipkow@5646
    46
nipkow@13682
    47
constdefs Valid :: "'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a bexp \<Rightarrow> bool"
nipkow@5646
    48
  "Valid p c q == !s s'. Sem c s s' --> s : p --> s' : q"
wenzelm@5007
    49
wenzelm@5007
    50
wenzelm@5007
    51
nonterminals
nipkow@5646
    52
  vars
nipkow@1335
    53
nipkow@1335
    54
syntax
nipkow@5646
    55
  ""		     :: "id => vars"		       ("_")
nipkow@5646
    56
  "_vars" 	     :: "[id, vars] => vars"	       ("_ _")
clasohm@1558
    57
nipkow@5646
    58
syntax
nipkow@13682
    59
 "@hoare_vars" :: "[vars, 'a assn,'a com,'a assn] => bool"
nipkow@5646
    60
                 ("|- VARS _.// {_} // _ // {_}" [0,0,55,0] 50)
nipkow@5646
    61
syntax ("" output)
nipkow@13682
    62
 "@hoare"      :: "['a assn,'a com,'a assn] => bool"
nipkow@5646
    63
                 ("|- {_} // _ // {_}" [0,55,0] 50)
nipkow@1335
    64
nipkow@5646
    65
(** parse translations **)
nipkow@1335
    66
nipkow@13682
    67
ML{*
nipkow@5646
    68
fun mk_abstuple []     body = absfree ("x", dummyT, body)
nipkow@5646
    69
  | mk_abstuple [v]    body = absfree ((fst o dest_Free) v, dummyT, body)
nipkow@5646
    70
  | mk_abstuple (v::w) body = Syntax.const "split" $
nipkow@5646
    71
                              absfree ((fst o dest_Free) v, dummyT, mk_abstuple w body);
nipkow@1335
    72
nipkow@5646
    73
  
wenzelm@11606
    74
fun mk_fbody v e []      = Syntax.const "Unity"
nipkow@5646
    75
  | mk_fbody v e [x]     = if v=x then e else x
nipkow@5646
    76
  | mk_fbody v e (x::xs) = Syntax.const "Pair" $ (if v=x then e else x) $
nipkow@5646
    77
                           mk_fbody v e xs;
nipkow@1335
    78
nipkow@5646
    79
fun mk_fexp v e xs = mk_abstuple xs (mk_fbody v e xs);
nipkow@13682
    80
*}
nipkow@1335
    81
nipkow@5646
    82
(* bexp_tr & assn_tr *)
prensani@9397
    83
(*all meta-variables for bexp except for TRUE are translated as if they
nipkow@5646
    84
  were boolean expressions*)
nipkow@13682
    85
ML{*
nipkow@5646
    86
fun bexp_tr (Const ("TRUE", _)) xs = Syntax.const "TRUE"
nipkow@5646
    87
  | bexp_tr b xs = Syntax.const "Collect" $ mk_abstuple xs b;
nipkow@5646
    88
  
nipkow@5646
    89
fun assn_tr r xs = Syntax.const "Collect" $ mk_abstuple xs r;
nipkow@13682
    90
*}
nipkow@1335
    91
nipkow@5646
    92
(* com_tr *)
nipkow@13682
    93
ML{*
nipkow@5646
    94
fun assign_tr [Free (V,_),E] xs = Syntax.const "Basic" $
nipkow@5646
    95
                                      mk_fexp (Free(V,dummyT)) E xs
nipkow@5646
    96
  | assign_tr ts _ = raise TERM ("assign_tr", ts);
nipkow@1335
    97
nipkow@5646
    98
fun com_tr (Const("@assign",_) $ Free (V,_) $ E) xs =
nipkow@5646
    99
               assign_tr [Free (V,dummyT),E] xs
nipkow@5646
   100
  | com_tr (Const ("Basic",_) $ f) xs = Syntax.const "Basic" $ f
nipkow@5646
   101
  | com_tr (Const ("Seq",_) $ c1 $ c2) xs = Syntax.const "Seq" $
nipkow@5646
   102
                                                 com_tr c1 xs $ com_tr c2 xs
nipkow@5646
   103
  | com_tr (Const ("Cond",_) $ b $ c1 $ c2) xs = Syntax.const "Cond" $
nipkow@5646
   104
                                  bexp_tr b xs $ com_tr c1 xs $ com_tr c2 xs
nipkow@5646
   105
  | com_tr (Const ("While",_) $ b $ I $ c) xs = Syntax.const "While" $
nipkow@5646
   106
                                         bexp_tr b xs $ assn_tr I xs $ com_tr c xs
nipkow@5646
   107
  | com_tr trm _ = trm;
nipkow@13682
   108
*}
nipkow@5646
   109
nipkow@5646
   110
(* triple_tr *)
nipkow@13682
   111
ML{*
nipkow@5646
   112
fun vars_tr (x as Free _) = [x]
nipkow@5646
   113
  | vars_tr (Const ("_vars", _) $ (x as Free _) $ vars) = x :: vars_tr vars
nipkow@5646
   114
  | vars_tr t = raise TERM ("vars_tr", [t]);
nipkow@5646
   115
nipkow@5646
   116
fun hoare_vars_tr [vars, pre, prg, post] =
nipkow@5646
   117
      let val xs = vars_tr vars
nipkow@5646
   118
      in Syntax.const "Valid" $
nipkow@5646
   119
           assn_tr pre xs $ com_tr prg xs $ assn_tr post xs
nipkow@5646
   120
      end
nipkow@5646
   121
  | hoare_vars_tr ts = raise TERM ("hoare_vars_tr", ts);
nipkow@13682
   122
*}
nipkow@5646
   123
nipkow@13682
   124
parse_translation {* [("@hoare_vars", hoare_vars_tr)] *}
nipkow@1335
   125
nipkow@1335
   126
nipkow@5646
   127
(*****************************************************************************)
nipkow@5646
   128
nipkow@5646
   129
(*** print translations ***)
nipkow@13682
   130
ML{*
nipkow@5646
   131
fun dest_abstuple (Const ("split",_) $ (Abs(v,_, body))) =
nipkow@5646
   132
                            subst_bound (Syntax.free v, dest_abstuple body)
nipkow@5646
   133
  | dest_abstuple (Abs(v,_, body)) = subst_bound (Syntax.free v, body)
nipkow@5646
   134
  | dest_abstuple trm = trm;
nipkow@1335
   135
nipkow@5646
   136
fun abs2list (Const ("split",_) $ (Abs(x,T,t))) = Free (x, T)::abs2list t
nipkow@5646
   137
  | abs2list (Abs(x,T,t)) = [Free (x, T)]
nipkow@5646
   138
  | abs2list _ = [];
nipkow@1335
   139
nipkow@5646
   140
fun mk_ts (Const ("split",_) $ (Abs(x,_,t))) = mk_ts t
nipkow@5646
   141
  | mk_ts (Abs(x,_,t)) = mk_ts t
nipkow@5646
   142
  | mk_ts (Const ("Pair",_) $ a $ b) = a::(mk_ts b)
nipkow@5646
   143
  | mk_ts t = [t];
nipkow@1335
   144
nipkow@5646
   145
fun mk_vts (Const ("split",_) $ (Abs(x,_,t))) = 
nipkow@5646
   146
           ((Syntax.free x)::(abs2list t), mk_ts t)
nipkow@5646
   147
  | mk_vts (Abs(x,_,t)) = ([Syntax.free x], [t])
nipkow@5646
   148
  | mk_vts t = raise Match;
nipkow@5646
   149
  
nipkow@5646
   150
fun find_ch [] i xs = (false, (Syntax.free "not_ch",Syntax.free "not_ch" ))
nipkow@5646
   151
  | find_ch ((v,t)::vts) i xs = if t=(Bound i) then find_ch vts (i-1) xs
nipkow@5646
   152
              else (true, (v, subst_bounds (xs,t)));
nipkow@5646
   153
  
nipkow@5646
   154
fun is_f (Const ("split",_) $ (Abs(x,_,t))) = true
nipkow@5646
   155
  | is_f (Abs(x,_,t)) = true
nipkow@5646
   156
  | is_f t = false;
nipkow@13682
   157
*}
nipkow@13682
   158
nipkow@5646
   159
(* assn_tr' & bexp_tr'*)
nipkow@13682
   160
ML{*  
nipkow@5646
   161
fun assn_tr' (Const ("Collect",_) $ T) = dest_abstuple T
nipkow@5646
   162
  | assn_tr' (Const ("op Int",_) $ (Const ("Collect",_) $ T1) $ 
nipkow@5646
   163
                                   (Const ("Collect",_) $ T2)) =  
nipkow@5646
   164
            Syntax.const "op Int" $ dest_abstuple T1 $ dest_abstuple T2
nipkow@5646
   165
  | assn_tr' t = t;
nipkow@1335
   166
nipkow@5646
   167
fun bexp_tr' (Const ("Collect",_) $ T) = dest_abstuple T 
nipkow@5646
   168
  | bexp_tr' t = t;
nipkow@13682
   169
*}
nipkow@5646
   170
nipkow@5646
   171
(*com_tr' *)
nipkow@13682
   172
ML{*
nipkow@5646
   173
fun mk_assign f =
nipkow@5646
   174
  let val (vs, ts) = mk_vts f;
nipkow@5646
   175
      val (ch, which) = find_ch (vs~~ts) ((length vs)-1) (rev vs)
nipkow@5646
   176
  in if ch then Syntax.const "@assign" $ fst(which) $ snd(which)
nipkow@5646
   177
     else Syntax.const "@skip" end;
nipkow@1335
   178
nipkow@5646
   179
fun com_tr' (Const ("Basic",_) $ f) = if is_f f then mk_assign f
nipkow@5646
   180
                                           else Syntax.const "Basic" $ f
nipkow@5646
   181
  | com_tr' (Const ("Seq",_) $ c1 $ c2) = Syntax.const "Seq" $
nipkow@5646
   182
                                                 com_tr' c1 $ com_tr' c2
nipkow@5646
   183
  | com_tr' (Const ("Cond",_) $ b $ c1 $ c2) = Syntax.const "Cond" $
nipkow@5646
   184
                                           bexp_tr' b $ com_tr' c1 $ com_tr' c2
nipkow@5646
   185
  | com_tr' (Const ("While",_) $ b $ I $ c) = Syntax.const "While" $
nipkow@5646
   186
                                               bexp_tr' b $ assn_tr' I $ com_tr' c
nipkow@5646
   187
  | com_tr' t = t;
nipkow@1335
   188
nipkow@1335
   189
nipkow@5646
   190
fun spec_tr' [p, c, q] =
nipkow@5646
   191
  Syntax.const "@hoare" $ assn_tr' p $ com_tr' c $ assn_tr' q
nipkow@13682
   192
*}
nipkow@13682
   193
nipkow@13682
   194
print_translation {* [("Valid", spec_tr')] *}
nipkow@13682
   195
nipkow@13682
   196
use "Hoare.ML"
nipkow@13682
   197
nipkow@13682
   198
method_setup vcg = {*
nipkow@13682
   199
  Method.no_args
nipkow@13682
   200
    (Method.SIMPLE_METHOD' HEADGOAL (hoare_tac (K all_tac))) *}
nipkow@13682
   201
  "verification condition generator"
nipkow@13682
   202
nipkow@13682
   203
method_setup vcg_simp = {*
nipkow@13682
   204
  Method.ctxt_args (fn ctxt =>
nipkow@13682
   205
    Method.METHOD (fn facts => 
nipkow@13682
   206
      hoare_tac (asm_full_simp_tac (Simplifier.get_local_simpset ctxt))1)) *}
nipkow@13682
   207
  "verification condition generator plus simplification"
nipkow@13682
   208
nipkow@13682
   209
end