src/HOL/Hoare_Parallel/RG_Syntax.thy
author wenzelm
Thu Feb 11 22:19:58 2010 +0100 (2010-02-11)
changeset 35113 1a0c129bb2e0
parent 35107 bdca9f765ee4
child 35145 f132a4fd8679
permissions -rw-r--r--
modernized translations;
formal markup of @{syntax_const} and @{const_syntax};
     1 header {* \section{Concrete Syntax} *}
     2 
     3 theory RG_Syntax
     4 imports RG_Hoare Quote_Antiquote
     5 begin
     6 
     7 abbreviation Skip :: "'a com"  ("SKIP")
     8   where "SKIP \<equiv> Basic id"
     9 
    10 notation Seq  ("(_;;/ _)" [60,61] 60)
    11 
    12 syntax
    13   "_Assign"    :: "idt \<Rightarrow> 'b \<Rightarrow> 'a com"                     ("(\<acute>_ :=/ _)" [70, 65] 61)
    14   "_Cond"      :: "'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a com \<Rightarrow> 'a com"   ("(0IF _/ THEN _/ ELSE _/FI)" [0, 0, 0] 61)
    15   "_Cond2"     :: "'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a com"             ("(0IF _ THEN _ FI)" [0,0] 56)
    16   "_While"     :: "'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a com"             ("(0WHILE _ /DO _ /OD)"  [0, 0] 61)
    17   "_Await"     :: "'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a com"             ("(0AWAIT _ /THEN /_ /END)"  [0,0] 61)
    18   "_Atom"      :: "'a com \<Rightarrow> 'a com"                        ("(\<langle>_\<rangle>)" 61)
    19   "_Wait"      :: "'a bexp \<Rightarrow> 'a com"                       ("(0WAIT _ END)" 61)
    20 
    21 translations
    22   "\<acute>x := a" \<rightharpoonup> "CONST Basic \<guillemotleft>\<acute>(_update_name x (\<lambda>_. a))\<guillemotright>"
    23   "IF b THEN c1 ELSE c2 FI" \<rightharpoonup> "CONST Cond .{b}. c1 c2"
    24   "IF b THEN c FI" \<rightleftharpoons> "IF b THEN c ELSE SKIP FI"
    25   "WHILE b DO c OD" \<rightharpoonup> "CONST While .{b}. c"
    26   "AWAIT b THEN c END" \<rightleftharpoons> "CONST Await .{b}. c"
    27   "\<langle>c\<rangle>" \<rightleftharpoons> "AWAIT CONST True THEN c END"
    28   "WAIT b END" \<rightleftharpoons> "AWAIT b THEN SKIP END"
    29 
    30 nonterminals
    31   prgs
    32 
    33 syntax
    34   "_PAR"        :: "prgs \<Rightarrow> 'a"              ("COBEGIN//_//COEND" 60)
    35   "_prg"        :: "'a \<Rightarrow> prgs"              ("_" 57)
    36   "_prgs"       :: "['a, prgs] \<Rightarrow> prgs"      ("_//\<parallel>//_" [60,57] 57)
    37 
    38 translations
    39   "_prg a" \<rightharpoonup> "[a]"
    40   "_prgs a ps" \<rightharpoonup> "a # ps"
    41   "_PAR ps" \<rightharpoonup> "ps"
    42 
    43 syntax
    44   "_prg_scheme" :: "['a, 'a, 'a, 'a] \<Rightarrow> prgs"  ("SCHEME [_ \<le> _ < _] _" [0,0,0,60] 57)
    45 
    46 translations
    47   "_prg_scheme j i k c" \<rightleftharpoons> "(CONST map (\<lambda>i. c) [j..<k])"
    48 
    49 text {* Translations for variables before and after a transition: *}
    50 
    51 syntax 
    52   "_before" :: "id \<Rightarrow> 'a" ("\<ordmasculine>_")
    53   "_after"  :: "id \<Rightarrow> 'a" ("\<ordfeminine>_")
    54  
    55 translations
    56   "\<ordmasculine>x" \<rightleftharpoons> "x \<acute>CONST fst"
    57   "\<ordfeminine>x" \<rightleftharpoons> "x \<acute>CONST snd"
    58 
    59 print_translation {*
    60   let
    61     fun quote_tr' f (t :: ts) =
    62           Term.list_comb (f $ Syntax.quote_tr' @{syntax_const "_antiquote"} t, ts)
    63       | quote_tr' _ _ = raise Match;
    64 
    65     val assert_tr' = quote_tr' (Syntax.const @{syntax_const "_Assert"});
    66 
    67     fun bexp_tr' name ((Const (@{const_syntax Collect}, _) $ t) :: ts) =
    68           quote_tr' (Syntax.const name) (t :: ts)
    69       | bexp_tr' _ _ = raise Match;
    70 
    71     fun upd_tr' (x_upd, T) =
    72       (case try (unsuffix Record.updateN) x_upd of
    73         SOME x => (x, if T = dummyT then T else Term.domain_type T)
    74       | NONE => raise Match);
    75 
    76     fun update_name_tr' (Free x) = Free (upd_tr' x)
    77       | update_name_tr' ((c as Const (@{syntax_const "_free"}, _)) $ Free x) =
    78           c $ Free (upd_tr' x)
    79       | update_name_tr' (Const x) = Const (upd_tr' x)
    80       | update_name_tr' _ = raise Match;
    81 
    82     fun K_tr' (Abs (_, _, t)) =
    83           if null (loose_bnos t) then t else raise Match
    84       | K_tr' (Abs (_, _, Abs (_, _, t) $ Bound 0)) =
    85           if null (loose_bnos t) then t else raise Match
    86       | K_tr' _ = raise Match;
    87 
    88     fun assign_tr' (Abs (x, _, f $ k $ Bound 0) :: ts) =
    89           quote_tr' (Syntax.const @{syntax_const "_Assign"} $ update_name_tr' f)
    90             (Abs (x, dummyT, K_tr' k) :: ts)
    91       | assign_tr' _ = raise Match;
    92   in
    93    [(@{const_syntax Collect}, assert_tr'),
    94     (@{const_syntax Basic}, assign_tr'),
    95     (@{const_syntax Cond}, bexp_tr' @{syntax_const "_Cond"}),
    96     (@{const_syntax While}, bexp_tr' @{syntax_const "_While"})]
    97   end
    98 *}
    99 
   100 end