|
12442
|
1 |
(* Title: HOL/MicroJava/JVM/JVMListExample.thy
|
|
|
2 |
ID: $Id$
|
|
|
3 |
Author: Stefan Berghofer
|
|
|
4 |
*)
|
|
|
5 |
|
|
|
6 |
header {* Example for generating executable code from Java semantics *}
|
|
|
7 |
|
|
|
8 |
theory JListExample = Eval:
|
|
|
9 |
|
|
|
10 |
ML {* Syntax.ambiguity_level := 100000 *}
|
|
|
11 |
|
|
|
12 |
consts
|
|
|
13 |
list_name :: cname
|
|
|
14 |
append_name :: mname
|
|
|
15 |
val_nam :: vnam
|
|
|
16 |
next_nam :: vnam
|
|
|
17 |
l_nam :: vnam
|
|
|
18 |
l1_nam :: vnam
|
|
|
19 |
l2_nam :: vnam
|
|
|
20 |
l3_nam :: vnam
|
|
|
21 |
l4_nam :: vnam
|
|
|
22 |
|
|
|
23 |
constdefs
|
|
|
24 |
val_name :: vname
|
|
|
25 |
"val_name == VName val_nam"
|
|
|
26 |
|
|
|
27 |
next_name :: vname
|
|
|
28 |
"next_name == VName next_nam"
|
|
|
29 |
|
|
|
30 |
l_name :: vname
|
|
|
31 |
"l_name == VName l_nam"
|
|
|
32 |
|
|
|
33 |
l1_name :: vname
|
|
|
34 |
"l1_name == VName l1_nam"
|
|
|
35 |
|
|
|
36 |
l2_name :: vname
|
|
|
37 |
"l2_name == VName l2_nam"
|
|
|
38 |
|
|
|
39 |
l3_name :: vname
|
|
|
40 |
"l3_name == VName l3_nam"
|
|
|
41 |
|
|
|
42 |
l4_name :: vname
|
|
|
43 |
"l4_name == VName l4_nam"
|
|
|
44 |
|
|
|
45 |
list_class :: "java_mb class"
|
|
|
46 |
"list_class ==
|
|
|
47 |
(Object,
|
|
|
48 |
[(val_name, PrimT Integer), (next_name, RefT (ClassT list_name))],
|
|
|
49 |
[((append_name, [RefT (ClassT list_name)]), PrimT Void,
|
|
|
50 |
([l_name], [],
|
|
|
51 |
If(BinOp Eq ({list_name}(LAcc This)..next_name) (Lit Null))
|
|
|
52 |
Expr ({list_name}(LAcc This)..next_name:=LAcc l_name)
|
|
|
53 |
Else
|
|
|
54 |
Expr ({list_name}({list_name}(LAcc This)..next_name)..
|
|
|
55 |
append_name({[RefT (ClassT list_name)]}[LAcc l_name])),
|
|
|
56 |
Lit Unit))])"
|
|
|
57 |
|
|
|
58 |
example_prg :: "java_mb prog"
|
|
|
59 |
"example_prg == [ObjectC, (list_name, list_class)]"
|
|
|
60 |
|
|
|
61 |
types_code
|
|
|
62 |
cname ("string")
|
|
|
63 |
vnam ("string")
|
|
|
64 |
mname ("string")
|
|
|
65 |
loc ("int")
|
|
|
66 |
|
|
|
67 |
consts_code
|
|
|
68 |
"new_Addr" ("new'_addr {* %x. case x of None => True | Some y => False *}/ {* None *}")
|
|
|
69 |
|
|
|
70 |
"wf" ("true?")
|
|
|
71 |
|
|
|
72 |
"arbitrary" ("(raise ERROR)")
|
|
|
73 |
"arbitrary" :: "val" ("{* Unit *}")
|
|
|
74 |
"arbitrary" :: "cname" ("\"\"")
|
|
|
75 |
|
|
|
76 |
"Object" ("\"Object\"")
|
|
|
77 |
"list_name" ("\"list\"")
|
|
|
78 |
"append_name" ("\"append\"")
|
|
|
79 |
"val_nam" ("\"val\"")
|
|
|
80 |
"next_nam" ("\"next\"")
|
|
|
81 |
"l_nam" ("\"l\"")
|
|
|
82 |
"l1_nam" ("\"l1\"")
|
|
|
83 |
"l2_nam" ("\"l2\"")
|
|
|
84 |
"l3_nam" ("\"l3\"")
|
|
|
85 |
"l4_nam" ("\"l4\"")
|
|
|
86 |
|
|
|
87 |
ML {*
|
|
|
88 |
fun new_addr p none hp =
|
|
|
89 |
let fun nr i = if p (hp i) then (i, none) else nr (i+1);
|
|
|
90 |
in nr 0 end;
|
|
|
91 |
*}
|
|
|
92 |
|
|
|
93 |
generate_code
|
|
12565
|
94 |
test = "example_prg\<turnstile>Norm (Map.empty, Map.empty)
|
|
12442
|
95 |
-(Expr (l1_name::=NewC list_name);;
|
|
|
96 |
Expr ({list_name}(LAcc l1_name)..val_name:=Lit (Intg 1));;
|
|
|
97 |
Expr (l2_name::=NewC list_name);;
|
|
|
98 |
Expr ({list_name}(LAcc l2_name)..val_name:=Lit (Intg 2));;
|
|
|
99 |
Expr (l3_name::=NewC list_name);;
|
|
|
100 |
Expr ({list_name}(LAcc l3_name)..val_name:=Lit (Intg 3));;
|
|
|
101 |
Expr (l4_name::=NewC list_name);;
|
|
|
102 |
Expr ({list_name}(LAcc l4_name)..val_name:=Lit (Intg 4));;
|
|
|
103 |
Expr ({list_name}(LAcc l1_name)..
|
|
|
104 |
append_name({[RefT (ClassT list_name)]}[LAcc l2_name]));;
|
|
|
105 |
Expr ({list_name}(LAcc l1_name)..
|
|
|
106 |
append_name({[RefT (ClassT list_name)]}[LAcc l3_name]));;
|
|
|
107 |
Expr ({list_name}(LAcc l1_name)..
|
|
12565
|
108 |
append_name({[RefT (ClassT list_name)]}[LAcc l4_name])))-> _"
|
|
12442
|
109 |
|
|
|
110 |
subsection {* Big step execution *}
|
|
|
111 |
|
|
|
112 |
ML {*
|
|
|
113 |
|
|
|
114 |
val Library.Some ((_, (heap, locs)), _) = Seq.pull test;
|
|
|
115 |
locs l1_name;
|
|
|
116 |
locs l2_name;
|
|
|
117 |
locs l3_name;
|
|
|
118 |
locs l4_name;
|
|
|
119 |
snd (the (heap 0)) (val_name, "list");
|
|
|
120 |
snd (the (heap 0)) (next_name, "list");
|
|
|
121 |
snd (the (heap 1)) (val_name, "list");
|
|
|
122 |
snd (the (heap 1)) (next_name, "list");
|
|
|
123 |
snd (the (heap 2)) (val_name, "list");
|
|
|
124 |
snd (the (heap 2)) (next_name, "list");
|
|
|
125 |
snd (the (heap 3)) (val_name, "list");
|
|
|
126 |
snd (the (heap 3)) (next_name, "list");
|
|
|
127 |
|
|
|
128 |
*}
|
|
|
129 |
|
|
|
130 |
end
|