15425
|
1 |
theory OG_Syntax
|
|
2 |
imports OG_Tactics Quote_Antiquote
|
|
3 |
begin
|
13020
|
4 |
|
|
5 |
text{* Syntax for commands and for assertions and boolean expressions in
|
|
6 |
commands @{text com} and annotated commands @{text ann_com}. *}
|
|
7 |
|
|
8 |
syntax
|
|
9 |
"_Assign" :: "idt \<Rightarrow> 'b \<Rightarrow> 'a com" ("(\<acute>_ :=/ _)" [70, 65] 61)
|
|
10 |
"_AnnAssign" :: "'a assn \<Rightarrow> idt \<Rightarrow> 'b \<Rightarrow> 'a com" ("(_ \<acute>_ :=/ _)" [90,70,65] 61)
|
|
11 |
|
|
12 |
translations
|
25706
|
13 |
"\<acute>\<spacespace>x := a" \<rightharpoonup> "Basic \<guillemotleft>\<acute>\<spacespace>(_update_name x (\<lambda>_. a))\<guillemotright>"
|
|
14 |
"r \<acute>\<spacespace>x := a" \<rightharpoonup> "AnnBasic r \<guillemotleft>\<acute>\<spacespace>(_update_name x (\<lambda>_. a))\<guillemotright>"
|
13020
|
15 |
|
|
16 |
syntax
|
|
17 |
"_AnnSkip" :: "'a assn \<Rightarrow> 'a ann_com" ("_//SKIP" [90] 63)
|
|
18 |
"_AnnSeq" :: "'a ann_com \<Rightarrow> 'a ann_com \<Rightarrow> 'a ann_com" ("_;;/ _" [60,61] 60)
|
|
19 |
|
|
20 |
"_AnnCond1" :: "'a assn \<Rightarrow> 'a bexp \<Rightarrow> 'a ann_com \<Rightarrow> 'a ann_com \<Rightarrow> 'a ann_com"
|
|
21 |
("_ //IF _ /THEN _ /ELSE _ /FI" [90,0,0,0] 61)
|
|
22 |
"_AnnCond2" :: "'a assn \<Rightarrow> 'a bexp \<Rightarrow> 'a ann_com \<Rightarrow> 'a ann_com"
|
|
23 |
("_ //IF _ /THEN _ /FI" [90,0,0] 61)
|
|
24 |
"_AnnWhile" :: "'a assn \<Rightarrow> 'a bexp \<Rightarrow> 'a assn \<Rightarrow> 'a ann_com \<Rightarrow> 'a ann_com"
|
|
25 |
("_ //WHILE _ /INV _ //DO _//OD" [90,0,0,0] 61)
|
|
26 |
"_AnnAwait" :: "'a assn \<Rightarrow> 'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a ann_com"
|
|
27 |
("_ //AWAIT _ /THEN /_ /END" [90,0,0] 61)
|
|
28 |
"_AnnAtom" :: "'a assn \<Rightarrow> 'a com \<Rightarrow> 'a ann_com" ("_//\<langle>_\<rangle>" [90,0] 61)
|
|
29 |
"_AnnWait" :: "'a assn \<Rightarrow> 'a bexp \<Rightarrow> 'a ann_com" ("_//WAIT _ END" [90,0] 61)
|
|
30 |
|
|
31 |
"_Skip" :: "'a com" ("SKIP" 63)
|
|
32 |
"_Seq" :: "'a com \<Rightarrow> 'a com \<Rightarrow> 'a com" ("_,,/ _" [55, 56] 55)
|
|
33 |
"_Cond" :: "'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a com \<Rightarrow> 'a com"
|
|
34 |
("(0IF _/ THEN _/ ELSE _/ FI)" [0, 0, 0] 61)
|
|
35 |
"_Cond2" :: "'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a com" ("IF _ THEN _ FI" [0,0] 56)
|
|
36 |
"_While_inv" :: "'a bexp \<Rightarrow> 'a assn \<Rightarrow> 'a com \<Rightarrow> 'a com"
|
|
37 |
("(0WHILE _/ INV _ //DO _ /OD)" [0, 0, 0] 61)
|
|
38 |
"_While" :: "'a bexp \<Rightarrow> 'a com \<Rightarrow> 'a com"
|
|
39 |
("(0WHILE _ //DO _ /OD)" [0, 0] 61)
|
|
40 |
|
|
41 |
translations
|
|
42 |
"SKIP" \<rightleftharpoons> "Basic id"
|
|
43 |
"c_1,, c_2" \<rightleftharpoons> "Seq c_1 c_2"
|
|
44 |
|
|
45 |
"IF b THEN c1 ELSE c2 FI" \<rightharpoonup> "Cond .{b}. c1 c2"
|
|
46 |
"IF b THEN c FI" \<rightleftharpoons> "IF b THEN c ELSE SKIP FI"
|
|
47 |
"WHILE b INV i DO c OD" \<rightharpoonup> "While .{b}. i c"
|
|
48 |
"WHILE b DO c OD" \<rightleftharpoons> "WHILE b INV arbitrary DO c OD"
|
|
49 |
|
|
50 |
"r SKIP" \<rightleftharpoons> "AnnBasic r id"
|
|
51 |
"c_1;; c_2" \<rightleftharpoons> "AnnSeq c_1 c_2"
|
|
52 |
"r IF b THEN c1 ELSE c2 FI" \<rightharpoonup> "AnnCond1 r .{b}. c1 c2"
|
|
53 |
"r IF b THEN c FI" \<rightharpoonup> "AnnCond2 r .{b}. c"
|
|
54 |
"r WHILE b INV i DO c OD" \<rightharpoonup> "AnnWhile r .{b}. i c"
|
|
55 |
"r AWAIT b THEN c END" \<rightharpoonup> "AnnAwait r .{b}. c"
|
|
56 |
"r \<langle>c\<rangle>" \<rightleftharpoons> "r AWAIT True THEN c END"
|
|
57 |
"r WAIT b END" \<rightleftharpoons> "r AWAIT b THEN SKIP END"
|
|
58 |
|
|
59 |
nonterminals
|
|
60 |
prgs
|
|
61 |
|
|
62 |
syntax
|
|
63 |
"_PAR" :: "prgs \<Rightarrow> 'a" ("COBEGIN//_//COEND" [57] 56)
|
|
64 |
"_prg" :: "['a, 'a] \<Rightarrow> prgs" ("_//_" [60, 90] 57)
|
|
65 |
"_prgs" :: "['a, 'a, prgs] \<Rightarrow> prgs" ("_//_//\<parallel>//_" [60,90,57] 57)
|
|
66 |
|
|
67 |
"_prg_scheme" :: "['a, 'a, 'a, 'a, 'a] \<Rightarrow> prgs"
|
|
68 |
("SCHEME [_ \<le> _ < _] _// _" [0,0,0,60, 90] 57)
|
|
69 |
|
|
70 |
translations
|
|
71 |
"_prg c q" \<rightleftharpoons> "[(Some c, q)]"
|
|
72 |
"_prgs c q ps" \<rightleftharpoons> "(Some c, q) # ps"
|
|
73 |
"_PAR ps" \<rightleftharpoons> "Parallel ps"
|
|
74 |
|
15425
|
75 |
"_prg_scheme j i k c q" \<rightleftharpoons> "map (\<lambda>i. (Some c, q)) [j..<k]"
|
13020
|
76 |
|
|
77 |
print_translation {*
|
|
78 |
let
|
|
79 |
fun quote_tr' f (t :: ts) =
|
|
80 |
Term.list_comb (f $ Syntax.quote_tr' "_antiquote" t, ts)
|
|
81 |
| quote_tr' _ _ = raise Match;
|
|
82 |
|
|
83 |
fun annquote_tr' f (r :: t :: ts) =
|
|
84 |
Term.list_comb (f $ r $ Syntax.quote_tr' "_antiquote" t, ts)
|
|
85 |
| annquote_tr' _ _ = raise Match;
|
|
86 |
|
|
87 |
val assert_tr' = quote_tr' (Syntax.const "_Assert");
|
|
88 |
|
|
89 |
fun bexp_tr' name ((Const ("Collect", _) $ t) :: ts) =
|
|
90 |
quote_tr' (Syntax.const name) (t :: ts)
|
|
91 |
| bexp_tr' _ _ = raise Match;
|
|
92 |
|
|
93 |
fun annbexp_tr' name (r :: (Const ("Collect", _) $ t) :: ts) =
|
|
94 |
annquote_tr' (Syntax.const name) (r :: t :: ts)
|
|
95 |
| annbexp_tr' _ _ = raise Match;
|
|
96 |
|
|
97 |
fun upd_tr' (x_upd, T) =
|
|
98 |
(case try (unsuffix RecordPackage.updateN) x_upd of
|
15531
|
99 |
SOME x => (x, if T = dummyT then T else Term.domain_type T)
|
|
100 |
| NONE => raise Match);
|
13020
|
101 |
|
|
102 |
fun update_name_tr' (Free x) = Free (upd_tr' x)
|
|
103 |
| update_name_tr' ((c as Const ("_free", _)) $ Free x) =
|
|
104 |
c $ Free (upd_tr' x)
|
|
105 |
| update_name_tr' (Const x) = Const (upd_tr' x)
|
|
106 |
| update_name_tr' _ = raise Match;
|
|
107 |
|
25706
|
108 |
fun K_tr' (Abs (_,_,t)) = if null (loose_bnos t) then t else raise Match
|
|
109 |
| K_tr' (Abs (_,_,Abs (_,_,t)$Bound 0)) = if null (loose_bnos t) then t else raise Match
|
|
110 |
| K_tr' _ = raise Match;
|
|
111 |
|
|
112 |
fun assign_tr' (Abs (x, _, f $ k $ Bound 0) :: ts) =
|
13020
|
113 |
quote_tr' (Syntax.const "_Assign" $ update_name_tr' f)
|
25706
|
114 |
(Abs (x, dummyT, K_tr' k) :: ts)
|
13020
|
115 |
| assign_tr' _ = raise Match;
|
|
116 |
|
25706
|
117 |
fun annassign_tr' (r :: Abs (x, _, f $ k $ Bound 0) :: ts) =
|
13020
|
118 |
quote_tr' (Syntax.const "_AnnAssign" $ r $ update_name_tr' f)
|
25706
|
119 |
(Abs (x, dummyT, K_tr' k) :: ts)
|
13020
|
120 |
| annassign_tr' _ = raise Match;
|
|
121 |
|
|
122 |
fun Parallel_PAR [(Const ("Cons",_) $ (Const ("Pair",_) $ (Const ("Some",_) $ t1 ) $ t2) $ Const ("Nil",_))] =
|
|
123 |
(Syntax.const "_prg" $ t1 $ t2)
|
|
124 |
| Parallel_PAR [(Const ("Cons",_) $ (Const ("Pair",_) $ (Const ("Some",_) $ t1) $ t2) $ ts)] =
|
|
125 |
(Syntax.const "_prgs" $ t1 $ t2 $ Parallel_PAR [ts])
|
|
126 |
| Parallel_PAR _ = raise Match;
|
|
127 |
|
|
128 |
fun Parallel_tr' ts = Syntax.const "_PAR" $ Parallel_PAR ts;
|
|
129 |
in
|
|
130 |
[("Collect", assert_tr'), ("Basic", assign_tr'),
|
|
131 |
("Cond", bexp_tr' "_Cond"), ("While", bexp_tr' "_While_inv"),
|
|
132 |
("AnnBasic", annassign_tr'),
|
|
133 |
("AnnWhile", annbexp_tr' "_AnnWhile"), ("AnnAwait", annbexp_tr' "_AnnAwait"),
|
|
134 |
("AnnCond1", annbexp_tr' "_AnnCond1"), ("AnnCond2", annbexp_tr' "_AnnCond2")]
|
|
135 |
|
|
136 |
end
|
|
137 |
|
|
138 |
*}
|
|
139 |
|
|
140 |
end |