walther@59603
|
1 |
(* title: ProgLang/Prog_Expr.thy
|
walther@59603
|
2 |
functions for expressions (which do NOT contain Prog_Tac and Tactical, by definition))
|
walther@59603
|
3 |
author: Walther Neuper, Aug.2019
|
walther@59603
|
4 |
(c) copyright due to lincense terms.
|
walther@59603
|
5 |
*)
|
walther@59603
|
6 |
|
walther@59619
|
7 |
theory Prog_Expr
|
walther@59717
|
8 |
imports Calculate ListC Program
|
walther@59603
|
9 |
begin
|
walther@59603
|
10 |
|
walther@59619
|
11 |
text \<open>Abstract:
|
walther@59619
|
12 |
Specific constants are defined for pre-conditions of programs and for program-expressions.
|
walther@59619
|
13 |
The constants are connected with ML functions for evaluation of respective expressions
|
walther@59619
|
14 |
(all named eval_*), such that Isac's rewrite engine can handle it.
|
walther@59619
|
15 |
\<close>
|
walther@59619
|
16 |
|
walther@59603
|
17 |
subsection \<open>consts of functions in pre-conditions and program-expressions\<close>
|
walther@59603
|
18 |
consts
|
walther@59603
|
19 |
lhs :: "bool => real" (*of an equality*)
|
walther@59603
|
20 |
rhs :: "bool => real" (*of an equality*)
|
walther@59603
|
21 |
Vars :: "'a => real list" (*get the variables of a term *)
|
walther@59603
|
22 |
matches :: "['a, 'a] => bool"
|
walther@59603
|
23 |
matchsub :: "['a, 'a] => bool"
|
walther@60278
|
24 |
some_occur_in :: "[real list, 'a] => bool" ("some'_of _ occur'_in _")
|
walther@60278
|
25 |
occurs_in :: "[real , 'a] => bool" ("_ occurs'_in _")
|
walther@59603
|
26 |
|
walther@59603
|
27 |
abs :: "real => real" ("(|| _ ||)")
|
walther@59619
|
28 |
(* ~~~ FIXXXME Isabelle2002 has abs already !!!*)
|
walther@59603
|
29 |
absset :: "real set => real" ("(||| _ |||)")
|
walther@60278
|
30 |
is_atom :: "real => bool" ("_ is'_atom" 10)
|
walther@60343
|
31 |
is_num :: "real => bool" ("_ is'_num" 10)
|
walther@60278
|
32 |
is_even :: "real => bool" ("_ is'_even" 10)
|
walther@59603
|
33 |
|
walther@59603
|
34 |
(* identity on term level*)
|
walther@59603
|
35 |
ident :: "['a, 'a] => bool" ("(_ =!=/ _)" [51, 51] 50)
|
walther@60278
|
36 |
argument_in :: "real => real" ("argument'_in _" 10)
|
walther@60278
|
37 |
sameFunId :: "[real, bool] => bool" (* "same_funid _ _" 10
|
walther@59619
|
38 |
WN0609 changed the id, because ".. _ _" inhibits currying *)
|
walther@60278
|
39 |
filter_sameFunId:: "[real, bool list] => bool list" ("filter'_sameFunId _ _" 10)
|
walther@59603
|
40 |
boollist2sum :: "bool list => real"
|
walther@59603
|
41 |
lastI :: "'a list \<Rightarrow> 'a"
|
walther@59603
|
42 |
|
walther@59603
|
43 |
subsection \<open>ML code for functions in pre-conditions and program-expressions\<close>
|
walther@59603
|
44 |
ML \<open>
|
walther@59603
|
45 |
signature PROG_EXPR =
|
walther@59603
|
46 |
sig
|
walther@59603
|
47 |
val eval_lhs: 'a -> string -> term -> 'b -> (string * term) option
|
walther@59603
|
48 |
val eval_matches: string -> string -> term -> theory -> (string * term) option
|
walther@59603
|
49 |
val matchsub: theory -> term -> term -> bool
|
walther@59603
|
50 |
val eval_matchsub: string -> string -> term -> theory -> (string * term) option
|
walther@59603
|
51 |
val eval_rhs: 'a -> string -> term -> 'b -> (string * term) option
|
walther@59603
|
52 |
val eval_var: string -> string -> term -> theory -> (string * term) option
|
walther@59603
|
53 |
|
walther@59603
|
54 |
val or2list: term -> term
|
walther@60391
|
55 |
|
walther@59603
|
56 |
val occurs_in: term -> term -> bool
|
walther@59603
|
57 |
val eval_occurs_in: 'a -> string -> term -> 'b -> (string * term) option
|
walther@59603
|
58 |
val some_occur_in: term list -> term -> bool
|
walther@59603
|
59 |
val eval_some_occur_in: 'a -> string -> term -> 'b -> (string * term) option
|
walther@59603
|
60 |
val eval_is_atom: string -> string -> term -> 'a -> (string * term) option
|
walther@60343
|
61 |
val eval_is_num: string -> string -> term -> 'a -> (string * term) option
|
walther@59603
|
62 |
val even: int -> bool
|
walther@59603
|
63 |
val eval_is_even: string -> string -> term -> 'a -> (string * term) option
|
walther@59603
|
64 |
val eval_equ: string -> string -> term -> 'a -> (string * term) option
|
walther@59603
|
65 |
val eval_ident: string -> string -> term -> theory -> (string * term) option
|
walther@59603
|
66 |
val eval_equal: string -> string -> term -> theory -> (string * term) option
|
walther@59603
|
67 |
val eval_cancel: string -> string -> term -> 'a -> (string * term) option
|
walther@59603
|
68 |
val eval_argument_in: string -> string -> term -> 'a -> (string * term) option
|
walther@59603
|
69 |
val same_funid: term -> term -> bool
|
walther@59603
|
70 |
val eval_sameFunId: string -> string -> term -> 'a -> (string * term) option
|
walther@59603
|
71 |
val eval_filter_sameFunId: string -> string -> term -> 'a -> (string * term) option
|
walther@59603
|
72 |
val list2sum: term list -> term
|
walther@59603
|
73 |
val eval_boollist2sum: string -> string -> term -> 'a -> (string * term) option
|
walther@59603
|
74 |
|
walther@59603
|
75 |
val mk_thmid_f: string -> (int * int) * (int * int) -> (int * int) * (int * int) -> string
|
walther@59603
|
76 |
end
|
walther@59603
|
77 |
|
walther@59603
|
78 |
(**)
|
walther@59603
|
79 |
structure Prog_Expr(**): PROG_EXPR =(**)
|
walther@59603
|
80 |
struct
|
walther@59603
|
81 |
(**)
|
walther@59603
|
82 |
|
walther@59603
|
83 |
(*+ for Or_to_List +*)
|
wenzelm@60309
|
84 |
fun or2list (Const (\<^const_name>\<open>True\<close>,_)) = ((*tracing"### or2list True";*) UniversalList)
|
wenzelm@60309
|
85 |
| or2list (Const (\<^const_name>\<open>False\<close>,_)) = ((*tracing"### or2list False";*) EmptyList)
|
wenzelm@60309
|
86 |
| or2list (t as Const (\<^const_name>\<open>HOL.eq\<close>,_) $ _ $ _) = TermC.list2isalist HOLogic.boolT [t]
|
walther@59603
|
87 |
| or2list ors =
|
walther@59618
|
88 |
let
|
wenzelm@60309
|
89 |
fun get ls (Const (\<^const_name>\<open>disj\<close>,_) $ o1 $ o2) =
|
walther@59618
|
90 |
(case o2 of
|
wenzelm@60309
|
91 |
Const (\<^const_name>\<open>disj\<close>,_) $ _ $ _ => get (ls @ [o1]) o2
|
walther@59618
|
92 |
| _ => ls @ [o1, o2])
|
walther@59618
|
93 |
| get _ t = raise TERM ("or2list: missing pattern in fun.def", [t])
|
walther@59618
|
94 |
in (((TermC.list2isalist HOLogic.boolT) o (get [])) ors) end
|
walther@59603
|
95 |
(*>val t = @{term True};
|
walther@59603
|
96 |
> val t' = or2list t;
|
walther@59603
|
97 |
> term2str t';
|
walther@59620
|
98 |
"ListC.UniversalList"
|
walther@59603
|
99 |
> val t = @{term False};
|
walther@59603
|
100 |
> val t' = or2list t;
|
walther@59603
|
101 |
> term2str t';
|
walther@59603
|
102 |
"[]"
|
walther@59603
|
103 |
> val t=(Thm.term_of o the o (parse thy)) "x=3";
|
walther@59603
|
104 |
> val t' = or2list t;
|
walther@59603
|
105 |
> term2str t';
|
walther@59603
|
106 |
"[x = 3]"
|
walther@59603
|
107 |
> val t=(Thm.term_of o the o (parse thy))"(x=3) | (x=-3) | (x=0)";
|
walther@59603
|
108 |
> val t' = or2list t;
|
walther@59603
|
109 |
> term2str t';
|
walther@59603
|
110 |
"[x = #3, x = #-3, x = #0]" : string *)
|
walther@59603
|
111 |
|
walther@59603
|
112 |
|
walther@59603
|
113 |
(** evaluation on the meta-level **)
|
walther@59603
|
114 |
|
walther@59603
|
115 |
(*. evaluate the predicate matches (match on whole term only) .*)
|
walther@59603
|
116 |
(*("matches",("Prog_Expr.matches", eval_matches "#matches_")):calc*)
|
walther@60335
|
117 |
fun eval_matches (_:string) "Prog_Expr.matches" (t as Const (\<^const_name>\<open>Prog_Expr.matches\<close>, _) $ pat $ tst) thy =
|
walther@59603
|
118 |
if TermC.matches thy tst pat
|
walther@59603
|
119 |
then
|
walther@59603
|
120 |
let
|
walther@59603
|
121 |
val prop = HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True}))
|
walther@59870
|
122 |
in SOME (UnparseC.term_in_thy thy prop, prop) end
|
walther@59603
|
123 |
else
|
walther@59603
|
124 |
let
|
walther@59603
|
125 |
val prop = HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False}))
|
walther@59870
|
126 |
in SOME (UnparseC.term_in_thy thy prop, prop) end
|
walther@59603
|
127 |
| eval_matches _ _ _ _ = NONE;
|
walther@59603
|
128 |
(*
|
walther@59603
|
129 |
> val t = (Thm.term_of o the o (parse thy))
|
walther@60242
|
130 |
"matches (?x = 0) (1 * x \<up> 2 = 0)";
|
walther@59603
|
131 |
> eval_matches "/thmid/" "/op_/" t thy;
|
walther@59603
|
132 |
val it =
|
walther@59603
|
133 |
SOME
|
walther@60242
|
134 |
("matches (x = 0) (1 * x \<up> 2 = 0) = False",
|
walther@59603
|
135 |
Const (#,#) $ (# $ # $ Const #)) : (string * term) option
|
walther@59603
|
136 |
|
walther@59603
|
137 |
> val t = (Thm.term_of o the o (parse thy))
|
walther@60242
|
138 |
"matches (?a = #0) (#1 * x \<up> #2 = #0)";
|
walther@59603
|
139 |
> eval_matches "/thmid/" "/op_/" t thy;
|
walther@59603
|
140 |
val it =
|
walther@59603
|
141 |
SOME
|
walther@60242
|
142 |
("matches (?a = #0) (#1 * x \<up> #2 = #0) = True",
|
walther@59603
|
143 |
Const (#,#) $ (# $ # $ Const #)) : (string * term) option
|
walther@59603
|
144 |
|
walther@59603
|
145 |
> val t = (Thm.term_of o the o (parse thy))
|
walther@60242
|
146 |
"matches (?a * x = #0) (#1 * x \<up> #2 = #0)";
|
walther@59603
|
147 |
> eval_matches "/thmid/" "/op_/" t thy;
|
walther@59603
|
148 |
val it =
|
walther@59603
|
149 |
SOME
|
walther@60242
|
150 |
("matches (?a * x = #0) (#1 * x \<up> #2 = #0) = False",
|
walther@59603
|
151 |
Const (#,#) $ (# $ # $ Const #)) : (string * term) option
|
walther@59603
|
152 |
|
walther@59603
|
153 |
> val t = (Thm.term_of o the o (parse thy))
|
walther@60242
|
154 |
"matches (?a * x \<up> #2 = #0) (#1 * x \<up> #2 = #0)";
|
walther@59603
|
155 |
> eval_matches "/thmid/" "/op_/" t thy;
|
walther@59603
|
156 |
val it =
|
walther@59603
|
157 |
SOME
|
walther@60242
|
158 |
("matches (?a * x \<up> #2 = #0) (#1 * x \<up> #2 = #0) = True",
|
walther@59603
|
159 |
Const (#,#) $ (# $ # $ Const #)) : (string * term) option
|
walther@59603
|
160 |
----- before ?patterns ---:
|
walther@59603
|
161 |
> val t = (Thm.term_of o the o (parse thy))
|
walther@60260
|
162 |
"matches (a * b \<up> #2 = c) (#3 * x \<up> #2 = #1)";
|
walther@59603
|
163 |
> eval_matches "/thmid/" "/op_/" t thy;
|
walther@59603
|
164 |
SOME
|
walther@60242
|
165 |
("matches (a * b \<up> #2 = c) (#3 * x \<up> #2 = #1) = True",
|
walther@59997
|
166 |
Const ("HOL.Trueprop", "bool => prop") $ (Const # $ (# $ #) $ Const (#,#)))
|
walther@59603
|
167 |
: (string * term) option
|
walther@59603
|
168 |
|
walther@59603
|
169 |
> val t = (Thm.term_of o the o (parse thy))
|
walther@60260
|
170 |
"matches (a * b \<up> #2 = c) (#3 * x \<up> #2222 = #1)";
|
walther@59603
|
171 |
> eval_matches "/thmid/" "/op_/" t thy;
|
walther@60242
|
172 |
SOME ("matches (a * b \<up> #2 = c) (#3 * x \<up> #2222 = #1) = False",
|
walther@59997
|
173 |
Const ("HOL.Trueprop", "bool => prop") $ (Const # $ (# $ #) $ Const (#,#)))
|
walther@59603
|
174 |
|
walther@59603
|
175 |
> val t = (Thm.term_of o the o (parse thy))
|
walther@59603
|
176 |
"matches (a = b) (x + #1 + #-1 * #2 = #0)";
|
walther@59603
|
177 |
> eval_matches "/thmid/" "/op_/" t thy;
|
walther@59603
|
178 |
SOME ("matches (a = b) (x + #1 + #-1 * #2 = #0) = True",Const # $ (# $ #))
|
walther@59603
|
179 |
*)
|
walther@59603
|
180 |
|
walther@59603
|
181 |
(*.does a pattern match some subterm ?.*)
|
walther@59603
|
182 |
fun matchsub thy t pat =
|
walther@59603
|
183 |
let
|
walther@59603
|
184 |
fun matchs (t as Const _) = TermC.matches thy t pat
|
walther@59603
|
185 |
| matchs (t as Free _) = TermC.matches thy t pat
|
walther@59603
|
186 |
| matchs (t as Var _) = TermC.matches thy t pat
|
walther@59603
|
187 |
| matchs (Bound _) = false
|
walther@59603
|
188 |
| matchs (t as Abs (_, _, body)) =
|
walther@59603
|
189 |
if TermC.matches thy t pat then true else TermC.matches thy body pat
|
walther@59603
|
190 |
| matchs (t as f1 $ f2) =
|
walther@59603
|
191 |
if TermC.matches thy t pat then true
|
walther@59603
|
192 |
else if matchs f1 then true else matchs f2
|
walther@59603
|
193 |
in matchs t end;
|
walther@59603
|
194 |
|
walther@59603
|
195 |
(*("matchsub",("Prog_Expr.matchsub", eval_matchsub "#matchsub_")):calc*)
|
walther@59618
|
196 |
fun eval_matchsub (_:string) "Prog_Expr.matchsub"
|
walther@60335
|
197 |
(t as Const (\<^const_name>\<open>Prog_Expr.matchsub\<close>, _) $ pat $ tst) thy =
|
walther@59603
|
198 |
if matchsub thy tst pat
|
walther@59603
|
199 |
then
|
walther@59603
|
200 |
let val prop = HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True}))
|
walther@59870
|
201 |
in SOME (UnparseC.term_in_thy thy prop, prop) end
|
walther@59603
|
202 |
else
|
walther@59603
|
203 |
let val prop = HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False}))
|
walther@59870
|
204 |
in SOME (UnparseC.term_in_thy thy prop, prop) end
|
walther@59603
|
205 |
| eval_matchsub _ _ _ _ = NONE;
|
walther@59603
|
206 |
|
walther@59603
|
207 |
(*get the variables in an isabelle-term*)
|
walther@59603
|
208 |
(*("Vars" ,("Prog_Expr.Vars" , eval_var "#Vars_")):calc*)
|
walther@59618
|
209 |
fun eval_var (thmid:string) "Prog_Expr.Vars" (t as (Const _ $ arg)) thy =
|
walther@59603
|
210 |
let
|
walther@59603
|
211 |
val t' = ((TermC.list2isalist HOLogic.realT) o TermC.vars) t;
|
walther@59870
|
212 |
val thmId = thmid ^ UnparseC.term_in_thy thy arg;
|
walther@59603
|
213 |
in SOME (thmId, HOLogic.Trueprop $ (TermC.mk_equality (t, t'))) end
|
walther@59603
|
214 |
| eval_var _ _ _ _ = NONE;
|
walther@59603
|
215 |
|
walther@59603
|
216 |
(*("lhs" ,("Prog_Expr.lhs" , eval_lhs "")):calc*)
|
walther@60335
|
217 |
fun eval_lhs _ "Prog_Expr.lhs" (t as (Const (\<^const_name>\<open>lhs\<close>,_) $ (Const (\<^const_name>\<open>HOL.eq\<close>,_) $ l $ _))) _ =
|
walther@59868
|
218 |
SOME ((UnparseC.term t) ^ " = " ^ (UnparseC.term l),
|
walther@59603
|
219 |
HOLogic.Trueprop $ (TermC.mk_equality (t, l)))
|
walther@59603
|
220 |
| eval_lhs _ _ _ _ = NONE;
|
walther@59603
|
221 |
(*
|
walther@60242
|
222 |
> val t = (Thm.term_of o the o (parse thy)) "lhs (1 * x \<up> 2 = 0)";
|
walther@59603
|
223 |
> val SOME (id,t') = eval_lhs 0 0 t 0;
|
walther@60242
|
224 |
val id = "Prog_Expr.lhs (1 * x \<up> 2 = 0) = 1 * x \<up> 2" : string
|
walther@59603
|
225 |
> term2str t';
|
walther@60242
|
226 |
val it = "Prog_Expr.lhs (1 * x \<up> 2 = 0) = 1 * x \<up> 2" : string
|
walther@59603
|
227 |
*)
|
walther@59603
|
228 |
|
wenzelm@60309
|
229 |
fun rhs (Const (\<^const_name>\<open>HOL.eq\<close>,_) $ _ $ r) = r
|
walther@59962
|
230 |
| rhs t = raise ERROR("rhs called with (" ^ UnparseC.term t ^ ")");
|
walther@59603
|
231 |
(*("rhs" ,("Prog_Expr.rhs" , eval_rhs "")):calc*)
|
walther@60335
|
232 |
fun eval_rhs _ "Prog_Expr.rhs" (t as (Const (\<^const_name>\<open>rhs\<close>,_) $ (Const (\<^const_name>\<open>HOL.eq\<close>,_) $ _ $ r))) _ =
|
walther@59868
|
233 |
SOME (UnparseC.term t ^ " = " ^ UnparseC.term r,
|
walther@59603
|
234 |
HOLogic.Trueprop $ (TermC.mk_equality (t, r)))
|
walther@59603
|
235 |
| eval_rhs _ _ _ _ = NONE;
|
walther@59603
|
236 |
(*\\------------------------- from Prog_Expr.thy-------------------------------------------------//*)
|
walther@59603
|
237 |
|
walther@59603
|
238 |
(*//------------------------- from Atools.thy------------------------------------------------\\*)
|
walther@59603
|
239 |
fun occurs_in v t = member op = (((map strip_thy) o TermC.ids2str) t) (Term.term_name v);
|
walther@59603
|
240 |
|
walther@60278
|
241 |
(*("occurs_in", ("Prog_Expr.occurs_in", Prog_Expr.eval_occurs_in ""))*)
|
walther@60335
|
242 |
fun eval_occurs_in _ "Prog_Expr.occurs_in" (p as (Const (\<^const_name>\<open>occurs_in\<close>, _) $ v $ t)) _ =
|
walther@59868
|
243 |
((*tracing("#>@ eval_occurs_in: v= "^(UnparseC.term v));
|
walther@59868
|
244 |
tracing("#>@ eval_occurs_in: t= "^(UnparseC.term t));*)
|
walther@59603
|
245 |
if occurs_in v t
|
walther@59868
|
246 |
then SOME ((UnparseC.term p) ^ " = True",
|
walther@59603
|
247 |
HOLogic.Trueprop $ (TermC.mk_equality (p, @{term True})))
|
walther@59868
|
248 |
else SOME ((UnparseC.term p) ^ " = False",
|
walther@59603
|
249 |
HOLogic.Trueprop $ (TermC.mk_equality (p, @{term False}))))
|
walther@59603
|
250 |
| eval_occurs_in _ _ _ _ = NONE;
|
walther@59603
|
251 |
|
walther@59603
|
252 |
(*some of the (bound) variables (eg. in an eqsys) "vs" occur in term "t"*)
|
walther@59603
|
253 |
fun some_occur_in vs t =
|
walther@59603
|
254 |
let fun occurs_in' a b = occurs_in b a
|
walther@59603
|
255 |
in foldl or_ (false, map (occurs_in' t) vs) end;
|
walther@59603
|
256 |
|
walther@60278
|
257 |
(*("some_occur_in", ("Prog_Expr.some_occur_in",
|
walther@59603
|
258 |
eval_some_occur_in "#eval_some_occur_in_"))*)
|
walther@60278
|
259 |
fun eval_some_occur_in _ "Prog_Expr.some_occur_in"
|
walther@60335
|
260 |
(p as (Const (\<^const_name>\<open>some_occur_in\<close>,_) $ vs $ t)) _ =
|
walther@59603
|
261 |
if some_occur_in (TermC.isalist2list vs) t
|
walther@59868
|
262 |
then SOME ((UnparseC.term p) ^ " = True",
|
walther@59603
|
263 |
HOLogic.Trueprop $ (TermC.mk_equality (p, @{term True})))
|
walther@59868
|
264 |
else SOME ((UnparseC.term p) ^ " = False",
|
walther@59603
|
265 |
HOLogic.Trueprop $ (TermC.mk_equality (p, @{term False})))
|
walther@59603
|
266 |
| eval_some_occur_in _ _ _ _ = NONE;
|
walther@59603
|
267 |
|
walther@60278
|
268 |
(*("is_atom",("Prog_Expr.is_atom", Prog_Expr.eval_is_atom "#is_atom_"))*)
|
walther@60320
|
269 |
fun eval_is_atom (thmid:string) "Prog_Expr.is_atom" (t as (Const _ $ arg)) _ =
|
walther@60320
|
270 |
if TermC.is_atom arg
|
walther@60322
|
271 |
then SOME (TermC.mk_thmid thmid (TermC.string_of_atom arg) "",
|
walther@60320
|
272 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))
|
walther@60322
|
273 |
else SOME (TermC.mk_thmid thmid (TermC.string_of_atom arg) "",
|
walther@60320
|
274 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False})))
|
walther@59603
|
275 |
| eval_is_atom _ _ _ _ = NONE;
|
walther@59603
|
276 |
|
walther@60343
|
277 |
(*("is_num",("Prog_Expr.is_num", Prog_Expr.eval_is_num "#is_num_"))*)
|
walther@60343
|
278 |
fun eval_is_num (thmid:string) "Prog_Expr.is_num" (t as (Const _ $ arg)) _ =
|
walther@60343
|
279 |
if TermC.is_num arg
|
walther@60343
|
280 |
then SOME (TermC.mk_thmid thmid (TermC.string_of_atom arg) "",
|
walther@60343
|
281 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))
|
walther@60343
|
282 |
else SOME (TermC.mk_thmid thmid (TermC.string_of_atom arg) "",
|
walther@60343
|
283 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False})))
|
walther@60343
|
284 |
| eval_is_num _ _ _ _ = NONE;
|
walther@60343
|
285 |
|
walther@59603
|
286 |
fun even i = (i div 2) * 2 = i;
|
walther@60278
|
287 |
(*("is_even",("Prog_Expr.is_even", eval_is_even "#is_even_"))*)
|
walther@60318
|
288 |
fun eval_is_even (thmid:string) "Prog_Expr.is_even" (t as (Const _ $ arg)) _ =
|
walther@60318
|
289 |
if TermC.is_num arg
|
walther@60318
|
290 |
then
|
walther@60318
|
291 |
let
|
walther@60318
|
292 |
val i = arg |> HOLogic.dest_number |> snd
|
walther@60318
|
293 |
in
|
walther@60318
|
294 |
if even i
|
walther@60318
|
295 |
then SOME (TermC.mk_thmid thmid (string_of_int i) "",
|
walther@60318
|
296 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))
|
walther@59603
|
297 |
else SOME (TermC.mk_thmid thmid "" "",
|
walther@60318
|
298 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False})))
|
walther@60318
|
299 |
end
|
walther@60318
|
300 |
else NONE
|
walther@59603
|
301 |
| eval_is_even _ _ _ _ = NONE;
|
walther@59603
|
302 |
|
walther@59603
|
303 |
(*. evaluate binary, associative, commutative operators: *,+,^ .*)
|
wenzelm@60309
|
304 |
(*("PLUS" ,(\<^const_name>\<open>plus\<close> , (**)eval_binop "#add_")),
|
wenzelm@60309
|
305 |
("TIMES" ,(\<^const_name>\<open>times\<close> , (**)eval_binop "#mult_")),
|
wenzelm@60405
|
306 |
("POWER" ,(\<^const_name>\<open>realpow\<close> , (**)eval_binop "#power_"))*)
|
walther@59603
|
307 |
|
walther@59603
|
308 |
(* val (thmid,op_,t as(Const (op0,t0) $ Free (n1,t1) $ Free(n2,t2)),thy) =
|
walther@59603
|
309 |
("xxxxxx",op_,t,thy);
|
walther@59603
|
310 |
*)
|
walther@59603
|
311 |
fun mk_thmid_f thmid ((v11, v12), (p11, p12)) ((v21, v22), (p21, p22)) = (* dropped *)
|
walther@59603
|
312 |
thmid ^ "Float ((" ^
|
walther@59997
|
313 |
(string_of_int v11)^", "^(string_of_int v12)^"), ("^
|
walther@59997
|
314 |
(string_of_int p11)^", "^(string_of_int p12)^")) __ (("^
|
walther@59997
|
315 |
(string_of_int v21)^", "^(string_of_int v22)^"), ("^
|
walther@59997
|
316 |
(string_of_int p21)^", "^(string_of_int p22)^"))";
|
walther@59603
|
317 |
|
walther@59603
|
318 |
(*.evaluate < and <= for numerals.*)
|
wenzelm@60309
|
319 |
(*("le" ,(\<^const_name>\<open>less\<close> , Prog_Expr.eval_equ "#less_")),
|
wenzelm@60309
|
320 |
("leq" ,(\<^const_name>\<open>less_eq\<close> , Prog_Expr.eval_equ "#less_equal_"))*)
|
walther@60331
|
321 |
|
walther@60317
|
322 |
fun eval_equ (thmid:string) (_(*op_*)) (t as (Const (op0, _)) $ t1 $ t2) _ =
|
walther@60317
|
323 |
if TermC.is_num t1 andalso TermC.is_num t2 then
|
walther@60317
|
324 |
let
|
walther@60317
|
325 |
val n1 = t1 |> HOLogic.dest_number |> snd
|
walther@60317
|
326 |
val n2 = t2 |> HOLogic.dest_number |> snd
|
walther@60317
|
327 |
in
|
walther@60317
|
328 |
if Eval.calc_equ (strip_thy op0) (n1, n2)
|
walther@60317
|
329 |
then SOME (TermC.mk_thmid thmid (string_of_int n1) (string_of_int n2),
|
walther@60317
|
330 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))
|
walther@60317
|
331 |
else SOME (TermC.mk_thmid thmid (string_of_int n1) (string_of_int n2),
|
walther@60317
|
332 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False})))
|
walther@60317
|
333 |
end
|
walther@60317
|
334 |
else NONE
|
walther@59603
|
335 |
| eval_equ _ _ _ _ = NONE;
|
walther@59603
|
336 |
|
walther@59603
|
337 |
|
walther@59603
|
338 |
(*evaluate identity
|
walther@59603
|
339 |
> reflI;
|
walther@59603
|
340 |
val it = "(?t = ?t) = True"
|
walther@59603
|
341 |
> val t = str2term "x = 0";
|
walther@59857
|
342 |
> val NONE = rewrite_ thy Rewrite_Ord.dummy_ord Rule_Set.empty false reflI t;
|
walther@59603
|
343 |
|
walther@59603
|
344 |
> val t = str2term "1 = 0";
|
walther@59857
|
345 |
> val NONE = rewrite_ thy Rewrite_Ord.dummy_ord Rule_Set.empty false reflI t;
|
walther@59878
|
346 |
----------- thus needs Rule.Eval !
|
walther@59603
|
347 |
> val t = str2term "0 = 0";
|
walther@59857
|
348 |
> val SOME (t',_) = rewrite_ thy Rewrite_Ord.dummy_ord Rule_Set.empty false reflI t;
|
walther@59868
|
349 |
> UnparseC.term t';
|
wenzelm@60309
|
350 |
val it = \<^const_name>\<open>True\<close>
|
walther@59603
|
351 |
|
walther@59603
|
352 |
val t = str2term "Not (x = 0)";
|
walther@59868
|
353 |
atomt t; UnparseC.term t;
|
walther@59603
|
354 |
*** -------------
|
walther@59603
|
355 |
*** Const ( Not)
|
walther@59603
|
356 |
*** . Const ( op =)
|
walther@59603
|
357 |
*** . . Free ( x, )
|
walther@59603
|
358 |
*** . . Free ( 0, )
|
walther@59603
|
359 |
val it = "x ~= 0" : string*)
|
walther@59603
|
360 |
|
walther@59603
|
361 |
(*.evaluate identity on the term-level, =!= ,i.e. without evaluation of
|
walther@59603
|
362 |
the arguments: thus special handling by 'fun eval_binop'*)
|
walther@59603
|
363 |
(*("ident" ,("Prog_Expr.ident", Prog_Expr.eval_ident "#ident_")):calc*)
|
walther@59603
|
364 |
fun eval_ident (thmid:string) "Prog_Expr.ident" (t as
|
walther@59603
|
365 |
(Const _(*op0, t0*) $ t1 $ t2 )) thy =
|
walther@59603
|
366 |
if t1 = t2
|
walther@59603
|
367 |
then SOME (TermC.mk_thmid thmid
|
walther@59870
|
368 |
("(" ^ (UnparseC.term_in_thy thy t1) ^ ")")
|
walther@59870
|
369 |
("(" ^ (UnparseC.term_in_thy thy t2) ^ ")"),
|
walther@59603
|
370 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))
|
walther@59603
|
371 |
else SOME (TermC.mk_thmid thmid
|
walther@59870
|
372 |
("(" ^ (UnparseC.term_in_thy thy t1) ^ ")")
|
walther@59870
|
373 |
("(" ^ (UnparseC.term_in_thy thy t2) ^ ")"),
|
walther@59603
|
374 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False})))
|
walther@59603
|
375 |
| eval_ident _ _ _ _ = NONE;
|
walther@59603
|
376 |
(* TODO
|
walther@59603
|
377 |
> val t = str2term "x =!= 0";
|
walther@59603
|
378 |
> val SOME (str, t') = eval_ident "ident_" "b" t thy;
|
walther@59868
|
379 |
> UnparseC.term t';
|
walther@59603
|
380 |
val str = "ident_(x)_(0)" : string
|
walther@59603
|
381 |
val it = "(x =!= 0) = False" : string
|
walther@59603
|
382 |
> val t = str2term "1 =!= 0";
|
walther@59603
|
383 |
> val SOME (str, t') = eval_ident "ident_" "b" t thy;
|
walther@59868
|
384 |
> UnparseC.term t';
|
walther@59603
|
385 |
val str = "ident_(1)_(0)" : string
|
walther@59603
|
386 |
val it = "(1 =!= 0) = False" : string
|
walther@59603
|
387 |
> val t = str2term "0 =!= 0";
|
walther@59603
|
388 |
> val SOME (str, t') = eval_ident "ident_" "b" t thy;
|
walther@59868
|
389 |
> UnparseC.term t';
|
walther@59603
|
390 |
val str = "ident_(0)_(0)" : string
|
walther@59603
|
391 |
val it = "(0 =!= 0) = True" : string
|
walther@59603
|
392 |
*)
|
walther@59603
|
393 |
|
walther@59841
|
394 |
|
walther@59841
|
395 |
(* evaluate identity of terms, which stay ready for further evaluation;
|
walther@59841
|
396 |
thus returns False only for atoms *)
|
wenzelm@60309
|
397 |
(*("equal" ,(\<^const_name>\<open>HOL.eq\<close>, Prog_Expr.eval_equal "#equal_")):calc*)
|
wenzelm@60309
|
398 |
fun eval_equal (thmid : string) \<^const_name>\<open>HOL.eq\<close> (t as (Const _(*op0,t0*) $ t1 $ t2 )) thy =
|
walther@59603
|
399 |
if t1 = t2
|
walther@59841
|
400 |
then
|
walther@59841
|
401 |
SOME (TermC.mk_thmid thmid
|
walther@59870
|
402 |
("(" ^ UnparseC.term_in_thy thy t1 ^ ")") ("(" ^ UnparseC.term_in_thy thy t2 ^ ")"),
|
walther@59841
|
403 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))
|
walther@59841
|
404 |
else
|
walther@59841
|
405 |
(case (TermC.is_atom t1, TermC.is_atom t2) of
|
walther@59841
|
406 |
(true, true) =>
|
walther@59841
|
407 |
if TermC.variable_constant_pair (t1, t2)
|
walther@59841
|
408 |
then NONE
|
walther@59841
|
409 |
else SOME (TermC.mk_thmid thmid
|
walther@59870
|
410 |
("(" ^ UnparseC.term_in_thy thy t1 ^ ")") ("(" ^ UnparseC.term_in_thy thy t2 ^ ")"),
|
walther@59841
|
411 |
HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False})))
|
walther@59841
|
412 |
| _ => NONE) (* NOT is_atom t1,t2 --> rew_sub *)
|
walther@59841
|
413 |
| eval_equal _ _ _ _ = NONE; (* error-exit *)
|
walther@59603
|
414 |
|
walther@59603
|
415 |
(*. evaluate HOL.divide .*)
|
walther@59603
|
416 |
(*("DIVIDE" ,("Rings.divide_class.divide" , eval_cancel "#divide_e"))*)
|
walther@60317
|
417 |
fun eval_cancel thmid "Rings.divide_class.divide" (t as (Const _ $ t1 $ t2)) _ =
|
walther@60317
|
418 |
if TermC.is_num t1 andalso TermC.is_num t2 then
|
walther@60317
|
419 |
let
|
walther@60317
|
420 |
val (T, _) = HOLogic.dest_number t1;
|
walther@60317
|
421 |
val (i1, i2) = (Eval.int_of_numeral t1, Eval.int_of_numeral t2);
|
walther@60392
|
422 |
val res_int as (d, (i1', i2')) = Eval.cancel_int (i1, i2);
|
walther@60317
|
423 |
in
|
walther@60392
|
424 |
if abs d = 1 andalso (abs i1, abs i2) = (abs i1', abs i2') then NONE
|
walther@60317
|
425 |
else
|
walther@60317
|
426 |
let
|
walther@60317
|
427 |
val res = TermC.mk_frac T res_int;
|
walther@60317
|
428 |
val prop = HOLogic.Trueprop $ (HOLogic.mk_eq (t, res));
|
walther@60317
|
429 |
in SOME (TermC.mk_thmid thmid (string_of_int i1) (string_of_int i2), prop) end
|
walther@60317
|
430 |
end
|
walther@60317
|
431 |
else NONE
|
walther@59603
|
432 |
| eval_cancel _ _ _ _ = NONE;
|
walther@59603
|
433 |
|
walther@59603
|
434 |
(* get the argument from a function-definition *)
|
walther@60278
|
435 |
(*("argument_in" ,("Prog_Expr.argument_in", Prog_Expr.eval_argument_in "Prog_Expr.argument_in"))*)
|
walther@60278
|
436 |
fun eval_argument_in _ "Prog_Expr.argument_in"
|
walther@60278
|
437 |
(t as (Const ("Prog_Expr.argument_in", _) $ (_(*f*) $ arg))) _ =
|
walther@60396
|
438 |
if TermC.is_atom arg (*could be something to be simplified before*)
|
walther@59603
|
439 |
then
|
walther@59868
|
440 |
SOME (UnparseC.term t ^ " = " ^ UnparseC.term arg,
|
walther@59603
|
441 |
HOLogic.Trueprop $ (TermC.mk_equality (t, arg)))
|
walther@59603
|
442 |
else NONE
|
walther@59603
|
443 |
| eval_argument_in _ _ _ _ = NONE;
|
walther@59603
|
444 |
|
walther@59603
|
445 |
(* check if the function-identifier of the first argument matches
|
walther@59603
|
446 |
the function-identifier of the lhs of the second argument *)
|
walther@59603
|
447 |
(*("sameFunId" ,("Prog_Expr.sameFunId", eval_same_funid "Prog_Expr.sameFunId"))*)
|
walther@59603
|
448 |
fun eval_sameFunId _ "Prog_Expr.sameFunId"
|
wenzelm@60309
|
449 |
(p as Const ("Prog_Expr.sameFunId",_) $ (f1 $ _) $ (Const (\<^const_name>\<open>HOL.eq\<close>, _) $ (f2 $ _) $ _)) _ =
|
walther@59603
|
450 |
if f1 = f2
|
walther@59868
|
451 |
then SOME ((UnparseC.term p) ^ " = True",
|
walther@59603
|
452 |
HOLogic.Trueprop $ (TermC.mk_equality (p, @{term True})))
|
walther@59868
|
453 |
else SOME ((UnparseC.term p) ^ " = False",
|
walther@59603
|
454 |
HOLogic.Trueprop $ (TermC.mk_equality (p, @{term False})))
|
walther@59603
|
455 |
| eval_sameFunId _ _ _ _ = NONE;
|
walther@59603
|
456 |
|
walther@59603
|
457 |
|
walther@59603
|
458 |
(*.from a list of fun-definitions "f x = ..." as 2nd argument
|
walther@59603
|
459 |
filter the elements with the same fun-identfier in "f y"
|
walther@59603
|
460 |
as the fst argument;
|
walther@59603
|
461 |
this is, because Isabelles filter takes more than 1 sec.*)
|
wenzelm@60309
|
462 |
fun same_funid f1 (Const (\<^const_name>\<open>HOL.eq\<close>, _) $ (f2 $ _) $ _) = f1 = f2
|
walther@59962
|
463 |
| same_funid f1 t = raise ERROR ("same_funid called with t = ("
|
walther@59868
|
464 |
^ UnparseC.term f1 ^ ") (" ^ UnparseC.term t ^ ")");
|
walther@60278
|
465 |
(*("filter_sameFunId" ,("Prog_Expr.filter_sameFunId",
|
walther@60278
|
466 |
eval_filter_sameFunId "Prog_Expr.filter_sameFunId"))*)
|
walther@60278
|
467 |
fun eval_filter_sameFunId _ "Prog_Expr.filter_sameFunId"
|
walther@60278
|
468 |
(p as Const ("Prog_Expr.filter_sameFunId",_) $
|
walther@59603
|
469 |
(fid $ _) $ fs) _ =
|
walther@59603
|
470 |
let val fs' = ((TermC.list2isalist HOLogic.boolT) o
|
walther@59603
|
471 |
(filter (same_funid fid))) (TermC.isalist2list fs)
|
walther@59868
|
472 |
in SOME (UnparseC.term (TermC.mk_equality (p, fs')),
|
walther@59603
|
473 |
HOLogic.Trueprop $ (TermC.mk_equality (p, fs'))) end
|
walther@59603
|
474 |
| eval_filter_sameFunId _ _ _ _ = NONE;
|
walther@59603
|
475 |
|
walther@59603
|
476 |
(* make a list of terms to a sum *)
|
walther@59962
|
477 |
fun list2sum [] = raise ERROR ("list2sum called with []")
|
walther@59603
|
478 |
| list2sum [s] = s
|
walther@59603
|
479 |
| list2sum (s::ss) =
|
walther@59603
|
480 |
let
|
wenzelm@60309
|
481 |
fun sum su [s'] = Const (\<^const_name>\<open>plus\<close>,
|
walther@59603
|
482 |
[HOLogic.realT,HOLogic.realT] ---> HOLogic.realT) $ su $ s'
|
wenzelm@60309
|
483 |
| sum su (s'::ss') = sum (Const (\<^const_name>\<open>plus\<close>,
|
walther@59603
|
484 |
[HOLogic.realT,HOLogic.realT] ---> HOLogic.realT) $ su $ s') ss'
|
walther@59603
|
485 |
| sum _ _ = raise ERROR "list2sum: pattern in fun.def is missing"
|
walther@59603
|
486 |
in sum s ss end;
|
walther@59603
|
487 |
|
walther@59603
|
488 |
(* make a list of equalities to the sum of the lhs *)
|
walther@59603
|
489 |
(*("boollist2sum" ,("Prog_Expr.boollist2sum" , eval_boollist2sum "")):calc*)
|
walther@59603
|
490 |
fun eval_boollist2sum _ "Prog_Expr.boollist2sum"
|
wenzelm@60309
|
491 |
(p as Const ("Prog_Expr.boollist2sum", _) $ (l as Const (\<^const_name>\<open>Cons\<close>, _) $ _ $ _)) _ =
|
walther@59603
|
492 |
let
|
walther@59603
|
493 |
val isal = TermC.isalist2list l
|
walther@60391
|
494 |
val lhss = map TermC.lhs isal
|
walther@59603
|
495 |
val sum = list2sum lhss
|
walther@59603
|
496 |
in
|
walther@59868
|
497 |
SOME ((UnparseC.term p) ^ " = " ^ (UnparseC.term sum),
|
walther@59603
|
498 |
HOLogic.Trueprop $ (TermC.mk_equality (p, sum)))
|
walther@59603
|
499 |
end
|
walther@59603
|
500 |
| eval_boollist2sum _ _ _ _ = NONE;
|
walther@59603
|
501 |
|
walther@59603
|
502 |
(**) end (*struct*)
|
walther@59603
|
503 |
\<close> text \<open>
|
walther@59603
|
504 |
open Prog_Expr
|
walther@59603
|
505 |
\<close> ML \<open>
|
walther@59603
|
506 |
\<close> ML \<open>
|
walther@59603
|
507 |
\<close>
|
walther@59603
|
508 |
|
walther@59603
|
509 |
subsection \<open>extend rule-set for evaluating pre-conditions and program-expressions\<close>
|
walther@59603
|
510 |
ML \<open>
|
wenzelm@60294
|
511 |
val prog_expr = Rule_Set.append_rules "prog_expr" prog_expr [\<^rule_eval>\<open>Prog_Expr.rhs\<close> (Prog_Expr.eval_rhs "")];
|
walther@59603
|
512 |
\<close> ML \<open>
|
walther@59603
|
513 |
\<close> ML \<open>
|
walther@59603
|
514 |
\<close>
|
walther@59603
|
515 |
|
walther@59603
|
516 |
subsection \<open>setup for rule-sets and ML-functions\<close>
|
wenzelm@60286
|
517 |
|
wenzelm@60289
|
518 |
rule_set_knowledge prog_expr = prog_expr
|
wenzelm@60313
|
519 |
|
walther@60387
|
520 |
calculation lhs = \<open>Prog_Expr.eval_lhs ""\<close>
|
walther@60387
|
521 |
calculation rhs = \<open>Prog_Expr.eval_rhs ""\<close>
|
walther@60387
|
522 |
calculation Vars = \<open>Prog_Expr.eval_var "#Vars_"\<close>
|
wenzelm@60313
|
523 |
calculation matches = \<open>Prog_Expr.eval_matches "#matches_"\<close>
|
wenzelm@60313
|
524 |
calculation matchsub = \<open>Prog_Expr.eval_matchsub "#matchsub_"\<close>
|
walther@60387
|
525 |
|
walther@60387
|
526 |
calculation some_occur_in = \<open>Prog_Expr.eval_some_occur_in "#some_occur_in_"\<close>
|
walther@60387
|
527 |
calculation occurs_in = \<open>Prog_Expr.eval_occurs_in "#occurs_in_"\<close>
|
walther@60387
|
528 |
calculation is_atom = \<open>Prog_Expr.eval_is_atom "#is_atom_"\<close>
|
walther@60387
|
529 |
calculation is_num = \<open>Prog_Expr.eval_is_num "#is_num_"\<close>
|
walther@60387
|
530 |
calculation is_even = \<open>Prog_Expr.eval_is_even "#is_even_"\<close>
|
walther@59603
|
531 |
ML \<open>
|
walther@59603
|
532 |
\<close> ML \<open>
|
walther@59603
|
533 |
\<close> ML \<open>
|
walther@59603
|
534 |
\<close>
|
walther@59603
|
535 |
|
walther@60275
|
536 |
end
|