author | wenzelm |
Thu, 10 Nov 2005 21:14:05 +0100 | |
changeset 18153 | a084aa91f701 |
parent 16417 | 9bc16273c2d4 |
child 18193 | 54419506df9e |
permissions | -rw-r--r-- |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
1 |
(* Title: HOL/Isar_examples/ExprCompiler.thy |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
2 |
ID: $Id$ |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
3 |
Author: Markus Wenzel, TU Muenchen |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
4 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
5 |
Correctness of a simple expression/stack-machine compiler. |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
6 |
*) |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
7 |
|
10007 | 8 |
header {* Correctness of a simple expression compiler *} |
7748 | 9 |
|
16417 | 10 |
theory ExprCompiler imports Main begin |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
11 |
|
7869 | 12 |
text {* |
7874 | 13 |
This is a (rather trivial) example of program verification. We model |
14 |
a compiler for translating expressions to stack machine instructions, |
|
15 |
and prove its correctness wrt.\ some evaluation semantics. |
|
10007 | 16 |
*} |
7869 | 17 |
|
18 |
||
10007 | 19 |
subsection {* Binary operations *} |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
20 |
|
6744 | 21 |
text {* |
7869 | 22 |
Binary operations are just functions over some type of values. This |
7982 | 23 |
is both for abstract syntax and semantics, i.e.\ we use a ``shallow |
7874 | 24 |
embedding'' here. |
10007 | 25 |
*} |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
26 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
27 |
types |
10007 | 28 |
'val binop = "'val => 'val => 'val" |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
29 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
30 |
|
10007 | 31 |
subsection {* Expressions *} |
7869 | 32 |
|
33 |
text {* |
|
34 |
The language of expressions is defined as an inductive type, |
|
35 |
consisting of variables, constants, and binary operations on |
|
36 |
expressions. |
|
10007 | 37 |
*} |
7869 | 38 |
|
39 |
datatype ('adr, 'val) expr = |
|
40 |
Variable 'adr | |
|
41 |
Constant 'val | |
|
10007 | 42 |
Binop "'val binop" "('adr, 'val) expr" "('adr, 'val) expr" |
7869 | 43 |
|
44 |
text {* |
|
7874 | 45 |
Evaluation (wrt.\ some environment of variable assignments) is |
46 |
defined by primitive recursion over the structure of expressions. |
|
10007 | 47 |
*} |
7869 | 48 |
|
49 |
consts |
|
10007 | 50 |
eval :: "('adr, 'val) expr => ('adr => 'val) => 'val" |
7869 | 51 |
|
52 |
primrec |
|
53 |
"eval (Variable x) env = env x" |
|
54 |
"eval (Constant c) env = c" |
|
10007 | 55 |
"eval (Binop f e1 e2) env = f (eval e1 env) (eval e2 env)" |
7869 | 56 |
|
57 |
||
10007 | 58 |
subsection {* Machine *} |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
59 |
|
6744 | 60 |
text {* |
6792 | 61 |
Next we model a simple stack machine, with three instructions. |
10007 | 62 |
*} |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
63 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
64 |
datatype ('adr, 'val) instr = |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
65 |
Const 'val | |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
66 |
Load 'adr | |
10007 | 67 |
Apply "'val binop" |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
68 |
|
6744 | 69 |
text {* |
7869 | 70 |
Execution of a list of stack machine instructions is easily defined |
71 |
as follows. |
|
10007 | 72 |
*} |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
73 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
74 |
consts |
7761 | 75 |
exec :: "(('adr, 'val) instr) list |
10007 | 76 |
=> 'val list => ('adr => 'val) => 'val list" |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
77 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
78 |
primrec |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
79 |
"exec [] stack env = stack" |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
80 |
"exec (instr # instrs) stack env = |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
81 |
(case instr of |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
82 |
Const c => exec instrs (c # stack) env |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
83 |
| Load x => exec instrs (env x # stack) env |
7761 | 84 |
| Apply f => exec instrs (f (hd stack) (hd (tl stack)) |
10007 | 85 |
# (tl (tl stack))) env)" |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
86 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
87 |
constdefs |
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
88 |
execute :: "(('adr, 'val) instr) list => ('adr => 'val) => 'val" |
10007 | 89 |
"execute instrs env == hd (exec instrs [] env)" |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
90 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
91 |
|
10007 | 92 |
subsection {* Compiler *} |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
93 |
|
6744 | 94 |
text {* |
7869 | 95 |
We are ready to define the compilation function of expressions to |
6792 | 96 |
lists of stack machine instructions. |
10007 | 97 |
*} |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
98 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
99 |
consts |
10007 | 100 |
compile :: "('adr, 'val) expr => (('adr, 'val) instr) list" |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
101 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
102 |
primrec |
8031
826c6222cca2
renamed comp to compile (avoids clash with Relation.comp);
wenzelm
parents:
7982
diff
changeset
|
103 |
"compile (Variable x) = [Load x]" |
826c6222cca2
renamed comp to compile (avoids clash with Relation.comp);
wenzelm
parents:
7982
diff
changeset
|
104 |
"compile (Constant c) = [Const c]" |
10007 | 105 |
"compile (Binop f e1 e2) = compile e2 @ compile e1 @ [Apply f]" |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
106 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
107 |
|
6744 | 108 |
text {* |
8051 | 109 |
The main result of this development is the correctness theorem for |
110 |
$\idt{compile}$. We first establish a lemma about $\idt{exec}$ and |
|
111 |
list append. |
|
10007 | 112 |
*} |
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
113 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
114 |
lemma exec_append: |
18153 | 115 |
"exec (xs @ ys) stack env = |
116 |
exec ys (exec xs stack env) env" |
|
117 |
proof (induct xs fixing: stack) |
|
118 |
case Nil |
|
119 |
show ?case by simp |
|
11809 | 120 |
next |
18153 | 121 |
case (Cons x xs) |
122 |
show ?case |
|
11809 | 123 |
proof (induct x) |
18153 | 124 |
case Const show ?case by simp |
125 |
next |
|
126 |
case Load show ?case by simp |
|
127 |
next |
|
128 |
case Apply show ?case by simp |
|
10007 | 129 |
qed |
130 |
qed |
|
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
131 |
|
10007 | 132 |
theorem correctness: "execute (compile e) env = eval e env" |
133 |
proof - |
|
18153 | 134 |
have "!!stack. exec (compile e) stack env = eval e env # stack" |
11809 | 135 |
proof (induct e) |
18153 | 136 |
case Variable show ?case by simp |
137 |
next |
|
138 |
case Constant show ?case by simp |
|
139 |
next |
|
140 |
case Binop then show ?case by (simp add: exec_append) |
|
10007 | 141 |
qed |
142 |
thus ?thesis by (simp add: execute_def) |
|
143 |
qed |
|
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
144 |
|
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
145 |
|
8051 | 146 |
text {* |
147 |
\bigskip In the proofs above, the \name{simp} method does quite a lot |
|
148 |
of work behind the scenes (mostly ``functional program execution''). |
|
149 |
Subsequently, the same reasoning is elaborated in detail --- at most |
|
150 |
one recursive function definition is used at a time. Thus we get a |
|
151 |
better idea of what is actually going on. |
|
10007 | 152 |
*} |
8051 | 153 |
|
13524 | 154 |
lemma exec_append': |
18153 | 155 |
"exec (xs @ ys) stack env = exec ys (exec xs stack env) env" |
156 |
proof (induct xs fixing: stack) |
|
157 |
case (Nil s) |
|
158 |
have "exec ([] @ ys) s env = exec ys s env" by simp |
|
159 |
also have "... = exec ys (exec [] s env) env" by simp |
|
160 |
finally show ?case . |
|
161 |
next |
|
162 |
case (Cons x xs s) |
|
163 |
show ?case |
|
10007 | 164 |
proof (induct x) |
18153 | 165 |
case (Const val) |
166 |
have "exec ((Const val # xs) @ ys) s env = exec (Const val # xs @ ys) s env" |
|
167 |
by simp |
|
168 |
also have "... = exec (xs @ ys) (val # s) env" by simp |
|
169 |
also from Cons have "... = exec ys (exec xs (val # s) env) env" . |
|
170 |
also have "... = exec ys (exec (Const val # xs) s env) env" by simp |
|
171 |
finally show ?case . |
|
10007 | 172 |
next |
18153 | 173 |
case (Load adr) |
174 |
from Cons show ?case by simp -- {* same as above *} |
|
175 |
next |
|
176 |
case (Apply fun) |
|
177 |
have "exec ((Apply fun # xs) @ ys) s env = |
|
178 |
exec (Apply fun # xs @ ys) s env" by simp |
|
179 |
also have "... = |
|
180 |
exec (xs @ ys) (fun (hd s) (hd (tl s)) # (tl (tl s))) env" by simp |
|
181 |
also from Cons have "... = |
|
182 |
exec ys (exec xs (fun (hd s) (hd (tl s)) # tl (tl s)) env) env" . |
|
183 |
also have "... = exec ys (exec (Apply fun # xs) s env) env" by simp |
|
184 |
finally show ?case . |
|
10007 | 185 |
qed |
186 |
qed |
|
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
187 |
|
13537 | 188 |
theorem correctness': "execute (compile e) env = eval e env" |
10007 | 189 |
proof - |
8052 | 190 |
have exec_compile: |
18153 | 191 |
"!!stack. exec (compile e) stack env = eval e env # stack" |
10007 | 192 |
proof (induct e) |
18153 | 193 |
case (Variable adr s) |
194 |
have "exec (compile (Variable adr)) s env = exec [Load adr] s env" |
|
195 |
by simp |
|
196 |
also have "... = env adr # s" by simp |
|
197 |
also have "env adr = eval (Variable adr) env" by simp |
|
198 |
finally show ?case . |
|
10007 | 199 |
next |
18153 | 200 |
case (Constant val s) |
201 |
show ?case by simp -- {* same as above *} |
|
10007 | 202 |
next |
18153 | 203 |
case (Binop fun e1 e2 s) |
204 |
have "exec (compile (Binop fun e1 e2)) s env = |
|
205 |
exec (compile e2 @ compile e1 @ [Apply fun]) s env" by simp |
|
206 |
also have "... = exec [Apply fun] |
|
207 |
(exec (compile e1) (exec (compile e2) s env) env) env" |
|
208 |
by (simp only: exec_append) |
|
209 |
also have "exec (compile e2) s env = eval e2 env # s" by fact |
|
210 |
also have "exec (compile e1) ... env = eval e1 env # ..." by fact |
|
211 |
also have "exec [Apply fun] ... env = |
|
10007 | 212 |
fun (hd ...) (hd (tl ...)) # (tl (tl ...))" by simp |
18153 | 213 |
also have "... = fun (eval e1 env) (eval e2 env) # s" by simp |
214 |
also have "fun (eval e1 env) (eval e2 env) = |
|
215 |
eval (Binop fun e1 e2) env" |
|
216 |
by simp |
|
217 |
finally show ?case . |
|
10007 | 218 |
qed |
8051 | 219 |
|
10007 | 220 |
have "execute (compile e) env = hd (exec (compile e) [] env)" |
221 |
by (simp add: execute_def) |
|
222 |
also from exec_compile |
|
18153 | 223 |
have "exec (compile e) [] env = [eval e env]" . |
10007 | 224 |
also have "hd ... = eval e env" by simp |
225 |
finally show ?thesis . |
|
226 |
qed |
|
6444
2ebe9e630cab
Miscellaneous Isabelle/Isar examples for Higher-Order Logic.
wenzelm
parents:
diff
changeset
|
227 |
|
10007 | 228 |
end |