neuper@38025
|
1 |
(* Title: extends Isabelle/src/Pure/term.ML
|
e0726734@41962
|
2 |
Author: Walther Neuper 1999, Mathias Lehnfeld
|
neuper@38025
|
3 |
(c) due to copyright terms
|
neuper@38025
|
4 |
*)
|
neuper@38025
|
5 |
|
neuper@52087
|
6 |
fun isastr_of_int i = if i >= 0 then string_of_int i else "-" ^ string_of_int (abs i)
|
neuper@52087
|
7 |
|
neuper@38025
|
8 |
(*
|
neuper@38025
|
9 |
> (cterm_of thy) a_term;
|
neuper@38025
|
10 |
val it = "empty" : cterm *)
|
neuper@38025
|
11 |
|
neuper@38025
|
12 |
(*2003 fun match thy t pat =
|
neuper@38025
|
13 |
(snd (Pattern.match (Sign.tsig_of (sign_of thy)) (pat, t)))
|
neuper@38025
|
14 |
handle _ => [];
|
neuper@38025
|
15 |
fn : theory ->
|
neuper@38025
|
16 |
Term.term -> Term.term -> (Term.indexname * Term.term) list*)
|
neuper@38025
|
17 |
(*see src/Tools/eqsubst.ML fun clean_match*)
|
neuper@38025
|
18 |
(*2003 fun matches thy tm pa = if match thy tm pa = [] then false else true;*)
|
neuper@38025
|
19 |
fun matches thy tm pa =
|
neuper@38025
|
20 |
(Pattern.match thy (pa, tm) (Vartab.empty, Vartab.empty); true)
|
neuper@38025
|
21 |
handle _ => false
|
neuper@38025
|
22 |
|
neuper@38025
|
23 |
fun atomtyp t = (*WN10 see raw_pp_typ*)
|
neuper@38025
|
24 |
let
|
neuper@38025
|
25 |
fun ato n (Type (s,[])) =
|
neuper@38025
|
26 |
("\n*** "^indent n^"Type ("^s^",[])")
|
neuper@38025
|
27 |
| ato n (Type (s,Ts)) =
|
neuper@38025
|
28 |
("\n*** "^indent n^"Type ("^s^",["^ atol (n+1) Ts)
|
neuper@38025
|
29 |
|
neuper@38025
|
30 |
| ato n (TFree (s,sort)) =
|
neuper@38025
|
31 |
("\n*** "^indent n^"TFree ("^s^",["^ strs2str' sort)
|
neuper@38025
|
32 |
|
neuper@38025
|
33 |
| ato n (TVar ((s,i),sort)) =
|
neuper@38025
|
34 |
("\n*** "^indent n^"TVar (("^s^","^
|
neuper@38025
|
35 |
string_of_int i ^ strs2str' sort)
|
neuper@38025
|
36 |
and atol n [] =
|
neuper@38025
|
37 |
("\n*** "^indent n^"]")
|
neuper@38025
|
38 |
| atol n (T::Ts) = (ato n T ^ atol n Ts)
|
neuper@38048
|
39 |
in tracing (ato 0 t ^ "\n") end;
|
neuper@38025
|
40 |
(*
|
neuper@38025
|
41 |
> val T = (type_of o term_of o the o (parse thy)) "a::[real,int] => nat";
|
neuper@38025
|
42 |
> atomtyp T;
|
neuper@38025
|
43 |
*** Type (fun,[
|
neuper@38025
|
44 |
*** Type (RealDef.real,[])
|
neuper@38025
|
45 |
*** Type (fun,[
|
neuper@38025
|
46 |
*** Type (IntDef.int,[])
|
neuper@38025
|
47 |
*** Type (nat,[])
|
neuper@38025
|
48 |
*** ]
|
neuper@38025
|
49 |
*** ]
|
neuper@38025
|
50 |
*)
|
neuper@38025
|
51 |
|
neuper@38025
|
52 |
(*Prog.Tutorial.p.34, Makarius 1005 does the above like this..*)
|
neuper@38025
|
53 |
local
|
neuper@38025
|
54 |
fun pp_pair (x, y) = Pretty.list "(" ")" [x, y]
|
neuper@38025
|
55 |
fun pp_list xs = Pretty.list "[" "]" xs
|
neuper@38025
|
56 |
fun pp_str s = Pretty.str s
|
neuper@38025
|
57 |
fun pp_qstr s = Pretty.quote (pp_str s)
|
neuper@38025
|
58 |
fun pp_int i = pp_str (string_of_int i)
|
neuper@38025
|
59 |
fun pp_sort S = pp_list (map pp_qstr S)
|
neuper@38025
|
60 |
fun pp_constr a args = Pretty.block [pp_str a, Pretty.brk 1, args]
|
neuper@38025
|
61 |
in
|
neuper@38025
|
62 |
fun raw_pp_typ (TVar ((a, i), S)) =
|
neuper@38025
|
63 |
pp_constr "TVar" (pp_pair (pp_pair (pp_qstr a, pp_int i), pp_sort S))
|
neuper@38025
|
64 |
| raw_pp_typ (TFree (a, S)) =
|
neuper@38025
|
65 |
pp_constr "TFree" (pp_pair (pp_qstr a, pp_sort S))
|
neuper@38025
|
66 |
| raw_pp_typ (Type (a, tys)) =
|
neuper@38025
|
67 |
pp_constr "Type" (pp_pair (pp_qstr a, pp_list (map raw_pp_typ tys)))
|
neuper@38025
|
68 |
end
|
neuper@38025
|
69 |
(* install
|
neuper@38025
|
70 |
PolyML.addPrettyPrinter
|
neuper@38025
|
71 |
(fn _ => fn _ => ml_pretty o Pretty.to_ML o raw_pp_typ);
|
neuper@38025
|
72 |
de-install
|
neuper@38025
|
73 |
PolyML.addPrettyPrinter
|
neuper@38025
|
74 |
(fn _ => fn _ => ml_pretty o Pretty.to_ML o Proof_Display.pp_typ Pure.thy);
|
neuper@38025
|
75 |
*)
|
neuper@38025
|
76 |
|
neuper@38067
|
77 |
local
|
neuper@38067
|
78 |
fun ato (Const (a, _)) n =
|
neuper@38025
|
79 |
"\n*** " ^ indent n ^ "Const (" ^ a ^ ", _)"
|
neuper@38025
|
80 |
| ato (Free (a, _)) n =
|
neuper@38025
|
81 |
"\n*** " ^ indent n ^ "Free (" ^ a ^ ", _)"
|
neuper@38025
|
82 |
| ato (Var ((a, i), _)) n =
|
neuper@38025
|
83 |
"\n*** " ^ indent n ^ "Var (" ^ a ^ ", " ^
|
neuper@38025
|
84 |
string_of_int i ^ "), _)"
|
neuper@38025
|
85 |
| ato (Bound i) n =
|
neuper@38025
|
86 |
"\n*** " ^ indent n ^ "Bound " ^ string_of_int i
|
neuper@38025
|
87 |
| ato (Abs (a, _, body)) n =
|
neuper@38025
|
88 |
"\n*** " ^ indent n ^ "Abs(" ^ a ^ ", _" ^ ato body (n+1)
|
neuper@38025
|
89 |
| ato (f $ t) n = (ato f n ^ ato t (n + 1))
|
neuper@38067
|
90 |
in
|
neuper@38067
|
91 |
fun atomw t = writeln ("\n*** -------------" ^ ato t 0 ^ "\n***");
|
neuper@38067
|
92 |
fun atomt t = tracing ("\n*** -------------" ^ ato t 0 ^ "\n***");
|
neuper@38067
|
93 |
end;
|
neuper@38025
|
94 |
|
neuper@38025
|
95 |
fun term_detail2str t =
|
neuper@38025
|
96 |
let fun ato (Const (a, T)) n =
|
neuper@38025
|
97 |
"\n*** " ^ indent n ^ "Const (" ^ a ^ ", " ^ string_of_typ T ^ ")"
|
neuper@38025
|
98 |
| ato (Free (a, T)) n =
|
neuper@38025
|
99 |
"\n*** " ^ indent n ^ "Free (" ^ a ^ ", " ^ string_of_typ T ^ ")"
|
neuper@38025
|
100 |
| ato (Var ((a, i), T)) n =
|
neuper@38025
|
101 |
"\n*** " ^ indent n ^ "Var ((" ^ a ^ ", " ^ string_of_int i ^ "), "^
|
neuper@38025
|
102 |
string_of_typ T ^ ")"
|
neuper@38025
|
103 |
| ato (Bound i) n =
|
neuper@38025
|
104 |
"\n*** " ^ indent n ^ "Bound " ^ string_of_int i
|
neuper@38025
|
105 |
| ato (Abs(a, T, body)) n =
|
neuper@38025
|
106 |
"\n*** " ^ indent n ^ "Abs (" ^ a ^ ", " ^ string_of_typ T ^ ",.."
|
neuper@38025
|
107 |
^ ato body (n + 1)
|
neuper@38025
|
108 |
| ato (f $ t) n = ato f n ^ ato t (n + 1)
|
neuper@38025
|
109 |
in "\n*** " ^ ato t 0 ^ "\n***" end;
|
neuper@42376
|
110 |
fun term_detail2str_thy thy t =
|
neuper@42376
|
111 |
let fun ato (Const (a, T)) n =
|
neuper@42376
|
112 |
"\n*** " ^ indent n ^ "Const (" ^ a ^ ", " ^ string_of_typ_thy thy T ^ ")"
|
neuper@42376
|
113 |
| ato (Free (a, T)) n =
|
neuper@42376
|
114 |
"\n*** " ^ indent n ^ "Free (" ^ a ^ ", " ^ string_of_typ_thy thy T ^ ")"
|
neuper@42376
|
115 |
| ato (Var ((a, i), T)) n =
|
neuper@42376
|
116 |
"\n*** " ^ indent n ^ "Var ((" ^ a ^ ", " ^ string_of_int i ^ "), "^
|
neuper@42376
|
117 |
string_of_typ_thy thy T ^ ")"
|
neuper@42376
|
118 |
| ato (Bound i) n =
|
neuper@42376
|
119 |
"\n*** " ^ indent n ^ "Bound " ^ string_of_int i
|
neuper@42376
|
120 |
| ato (Abs(a, T, body)) n =
|
neuper@42376
|
121 |
"\n*** " ^ indent n ^ "Abs (" ^ a ^ ", " ^ string_of_typ_thy thy T ^ ",.."
|
neuper@42376
|
122 |
^ ato body (n + 1)
|
neuper@42376
|
123 |
| ato (f $ t) n = ato f n ^ ato t (n + 1)
|
neuper@42376
|
124 |
in "\n*** " ^ ato t 0 ^ "\n***" end;
|
neuper@38067
|
125 |
fun atomwy t = (writeln o term_detail2str) t;
|
neuper@38067
|
126 |
fun atomty t = (tracing o term_detail2str) t;
|
neuper@42376
|
127 |
fun atomty_thy thy t = (tracing o (term_detail2str_thy thy)) t;
|
neuper@38025
|
128 |
|
neuper@38025
|
129 |
fun term_str thy (Const(s,_)) = s
|
neuper@38025
|
130 |
| term_str thy (Free(s,_)) = s
|
neuper@38025
|
131 |
| term_str thy (Var((s,i),_)) = s^(string_of_int i)
|
neuper@38025
|
132 |
| term_str thy (Bound i) = "B."^(string_of_int i)
|
neuper@38025
|
133 |
| term_str thy (Abs(s,_,_)) = s
|
neuper@38031
|
134 |
| term_str thy t = error("term_str not for "^term2str t);
|
neuper@38025
|
135 |
|
neuper@38025
|
136 |
(*.contains the fst argument the second argument (a leave! of term).*)
|
neuper@38025
|
137 |
fun contains_term (Abs(_,_,body)) t = contains_term body t
|
neuper@38025
|
138 |
| contains_term (f $ f') t =
|
neuper@38025
|
139 |
contains_term f t orelse contains_term f' t
|
neuper@38025
|
140 |
| contains_term s t = t = s;
|
neuper@38025
|
141 |
(*.contains the term a VAR(("*",_),_) ?.*)
|
neuper@38025
|
142 |
fun contains_Var (Abs(_,_,body)) = contains_Var body
|
neuper@38025
|
143 |
| contains_Var (f $ f') = contains_Var f orelse contains_Var f'
|
neuper@38025
|
144 |
| contains_Var (Var _) = true
|
neuper@38025
|
145 |
| contains_Var _ = false;
|
neuper@38025
|
146 |
(* contains_Var (str2term "?z = 3") (*true*);
|
neuper@38025
|
147 |
contains_Var (str2term "z = 3") (*false*);
|
neuper@38025
|
148 |
*)
|
neuper@38025
|
149 |
|
neuper@38025
|
150 |
(*fun int_of_str str =
|
neuper@40836
|
151 |
let val ss = Symbol.explode str
|
neuper@38025
|
152 |
val str' = case ss of
|
neuper@38025
|
153 |
"("::s => drop_last s | _ => ss
|
neuper@38025
|
154 |
in case BasisLibrary.Int.fromString (implode str') of
|
neuper@38025
|
155 |
SOME i => SOME i
|
neuper@38025
|
156 |
| NONE => NONE end;*)
|
neuper@38025
|
157 |
fun int_of_str str =
|
neuper@40836
|
158 |
let val ss = Symbol.explode str
|
neuper@38025
|
159 |
val str' = case ss of
|
neuper@38025
|
160 |
"("::s => drop_last s | _ => ss
|
neuper@38025
|
161 |
in (SOME (Thy_Output.integer (implode str'))) handle _ => NONE end;
|
neuper@38025
|
162 |
(*
|
neuper@38025
|
163 |
> int_of_str "123";
|
neuper@38025
|
164 |
val it = SOME 123 : int option
|
neuper@38025
|
165 |
> int_of_str "(-123)";
|
neuper@38025
|
166 |
val it = SOME 123 : int option
|
neuper@38025
|
167 |
> int_of_str "#123";
|
neuper@38025
|
168 |
val it = NONE : int option
|
neuper@38025
|
169 |
> int_of_str "-123";
|
neuper@38025
|
170 |
val it = SOME ~123 : int option
|
neuper@38025
|
171 |
*)
|
neuper@38025
|
172 |
fun int_of_str' str =
|
neuper@38025
|
173 |
case int_of_str str of
|
neuper@38025
|
174 |
SOME i => i
|
neuper@38025
|
175 |
| NONE => raise TERM ("int_of_string: no int-string",[]);
|
neuper@38025
|
176 |
val str2int = int_of_str';
|
neuper@38025
|
177 |
|
neuper@38025
|
178 |
fun is_numeral str = case int_of_str str of
|
neuper@38025
|
179 |
SOME _ => true
|
neuper@38025
|
180 |
| NONE => false;
|
neuper@38025
|
181 |
val is_no = is_numeral;
|
neuper@52064
|
182 |
(* see /home/neuper/repos/FHpoly/src/HOL/Decision_Procs/Approximation.thy:
|
neuper@52064
|
183 |
|
neuper@52064
|
184 |
val mk_int = HOLogic.mk_number @{typ int} o @{code integer_of_int};
|
neuper@52064
|
185 |
val dest_int = @{code int_of_integer} o snd o HOLogic.dest_number;
|
neuper@52064
|
186 |
|
neuper@52064
|
187 |
fun nat_of_term t = @{code nat_of_integer}
|
neuper@52064
|
188 |
(HOLogic.dest_nat t handle TERM _ => snd (HOLogic.dest_number t));
|
neuper@52064
|
189 |
etc...
|
neuper@52064
|
190 |
*)
|
neuper@38025
|
191 |
fun is_num (Free (s,_)) = if is_numeral s then true else false
|
neuper@38025
|
192 |
| is_num _ = false;
|
neuper@38025
|
193 |
(*>
|
neuper@38025
|
194 |
> is_num ((term_of o the o (parse thy)) "#1");
|
neuper@38025
|
195 |
val it = true : bool
|
neuper@38025
|
196 |
> is_num ((term_of o the o (parse thy)) "#-1");
|
neuper@38025
|
197 |
val it = true : bool
|
neuper@38025
|
198 |
> is_num ((term_of o the o (parse thy)) "a123");
|
neuper@38025
|
199 |
val it = false : bool
|
neuper@38025
|
200 |
*)
|
neuper@38025
|
201 |
|
neuper@38025
|
202 |
(*fun int_of_Free (Free (intstr, _)) =
|
neuper@38025
|
203 |
(case BasisLibrary.Int.fromString intstr of
|
neuper@38025
|
204 |
SOME i => i
|
neuper@38031
|
205 |
| NONE => error ("int_of_Free ( "^ intstr ^", _)"))
|
neuper@38031
|
206 |
| int_of_Free t = error ("int_of_Free ( "^ term2str t ^" )");*)
|
neuper@38025
|
207 |
fun int_of_Free (Free (intstr, _)) = (Thy_Output.integer intstr
|
neuper@38031
|
208 |
handle _ => error ("int_of_Free ( "^ intstr ^", _)"))
|
neuper@38031
|
209 |
| int_of_Free t = error ("int_of_Free ( "^ term2str t ^" )");
|
neuper@38025
|
210 |
|
neuper@38025
|
211 |
fun vars t =
|
neuper@38025
|
212 |
let
|
neuper@38025
|
213 |
fun scan vs (Const(s,T)) = vs
|
neuper@38025
|
214 |
| scan vs (t as Free(s,T)) = if is_no s then vs else t::vs
|
neuper@38025
|
215 |
| scan vs (t as Var((s,i),T)) = t::vs
|
neuper@38025
|
216 |
| scan vs (Bound i) = vs
|
neuper@38025
|
217 |
| scan vs (Abs(s,T,t)) = scan vs t
|
neuper@38025
|
218 |
| scan vs (t1 $ t2) = (scan vs t1) @ (scan vs t2)
|
neuper@38025
|
219 |
in (distinct o (scan [])) t end;
|
neuper@38025
|
220 |
|
neuper@38025
|
221 |
fun is_Free (Free _) = true
|
neuper@38025
|
222 |
| is_Free _ = false;
|
neuper@38025
|
223 |
fun is_fun_id (Const _) = true
|
neuper@38025
|
224 |
| is_fun_id (Free _) = true
|
neuper@38025
|
225 |
| is_fun_id _ = false;
|
neuper@38025
|
226 |
fun is_f_x (f $ x) = is_fun_id f andalso is_Free x
|
neuper@38025
|
227 |
| is_f_x _ = false;
|
neuper@38025
|
228 |
(* is_f_x (str2term "q_0/2 * L * x") (*false*);
|
neuper@38025
|
229 |
is_f_x (str2term "M_b x") (*true*);
|
neuper@38025
|
230 |
*)
|
neuper@38025
|
231 |
fun vars_str t =
|
neuper@38025
|
232 |
let
|
neuper@38025
|
233 |
fun scan vs (Const(s,T)) = vs
|
neuper@38025
|
234 |
| scan vs (t as Free(s,T)) = if is_no s then vs else s::vs
|
neuper@38025
|
235 |
| scan vs (t as Var((s,i),T)) = (s^"_"^(string_of_int i))::vs
|
neuper@38025
|
236 |
| scan vs (Bound i) = vs
|
neuper@38025
|
237 |
| scan vs (Abs(s,T,t)) = scan vs t
|
neuper@38025
|
238 |
| scan vs (t1 $ t2) = (scan vs t1) @ (scan vs t2)
|
neuper@38025
|
239 |
in (distinct o (scan [])) t end;
|
neuper@38025
|
240 |
|
neuper@38025
|
241 |
fun ids2str t =
|
neuper@38025
|
242 |
let
|
neuper@38025
|
243 |
fun scan vs (Const(s,T)) = if is_no s then vs else s::vs
|
neuper@38025
|
244 |
| scan vs (t as Free(s,T)) = if is_no s then vs else s::vs
|
neuper@38025
|
245 |
| scan vs (t as Var((s,i),T)) = (s^"_"^(string_of_int i))::vs
|
neuper@38025
|
246 |
| scan vs (Bound i) = vs
|
neuper@38025
|
247 |
| scan vs (Abs(s,T,t)) = scan (s::vs) t
|
neuper@38025
|
248 |
| scan vs (t1 $ t2) = (scan vs t1) @ (scan vs t2)
|
neuper@38025
|
249 |
in (distinct o (scan [])) t end;
|
neuper@38025
|
250 |
fun is_bdv str =
|
neuper@40836
|
251 |
case Symbol.explode str of
|
neuper@38025
|
252 |
"b"::"d"::"v"::_ => true
|
neuper@38025
|
253 |
| _ => false;
|
neuper@38025
|
254 |
fun is_bdv_ (Free (s,_)) = is_bdv s
|
neuper@38025
|
255 |
| is_bdv_ _ = false;
|
neuper@38025
|
256 |
|
neuper@42426
|
257 |
(* is a term a substitution for a bdv as found in programs *)
|
neuper@42426
|
258 |
fun is_bdv_subst (Const ("List.list.Cons", _) $
|
neuper@42426
|
259 |
(Const ("Product_Type.Pair", _) $ Free (str, _) $ _) $ _) = is_bdv str
|
neuper@42426
|
260 |
| is_bdv_subst _ = false;
|
neuper@42426
|
261 |
|
neuper@38025
|
262 |
fun free2str (Free (s,_)) = s
|
neuper@52105
|
263 |
| free2str t = error ("free2str not for " ^ term2str t);
|
neuper@52103
|
264 |
fun str_of_free_opt (Free (s,_)) = SOME s
|
neuper@52103
|
265 |
| str_of_free_opt _ = NONE
|
neuper@38025
|
266 |
fun free2int (t as Free (s, _)) = ((str2int s)
|
neuper@52105
|
267 |
handle _ => error ("free2int: " ^ term_detail2str t))
|
neuper@52105
|
268 |
| free2int t = error ("free2int: " ^ term_detail2str t);
|
neuper@38025
|
269 |
|
neuper@42360
|
270 |
(*compare Logic.unvarify_global, which rejects Free*)
|
neuper@38025
|
271 |
fun var2free (t as Const(s,T)) = t
|
neuper@38025
|
272 |
| var2free (t as Free(s,T)) = t
|
neuper@38025
|
273 |
| var2free (Var((s,i),T)) = Free(s,T)
|
neuper@38025
|
274 |
| var2free (t as Bound i) = t
|
neuper@38025
|
275 |
| var2free (Abs(s,T,t)) = Abs(s,T,var2free t)
|
neuper@38025
|
276 |
| var2free (t1 $ t2) = (var2free t1) $ (var2free t2);
|
neuper@38025
|
277 |
|
neuper@38025
|
278 |
(*27.8.01: doesn't find some subterm ???!???*)
|
neuper@38025
|
279 |
(*2010 free2var -> Logic.varify, but take care of 'Free ("1",_)'*)
|
neuper@38025
|
280 |
fun free2var (t as Const (s, T)) = t
|
neuper@38025
|
281 |
| free2var (t as Free (s, T)) = if is_no s then t else Var ((s, 0), T)
|
neuper@38025
|
282 |
| free2var (t as Var ((s, i), T)) = t
|
neuper@38025
|
283 |
| free2var (t as Bound i) = t
|
neuper@38025
|
284 |
| free2var (Abs (s, T, t)) = Abs (s, T, free2var t)
|
neuper@38025
|
285 |
| free2var (t1 $ t2) = (free2var t1) $ (free2var t2);
|
neuper@38025
|
286 |
|
neuper@38025
|
287 |
|
neuper@38025
|
288 |
fun mk_listT T = Type ("List.list", [T]);
|
neuper@38025
|
289 |
fun list_const T =
|
neuper@38025
|
290 |
Const("List.list.Cons", [T, mk_listT T] ---> mk_listT T);
|
neuper@38025
|
291 |
(*28.8.01: TODO: get type from head of list: 1 arg less!!!*)
|
neuper@38025
|
292 |
fun list2isalist T [] = Const("List.list.Nil",mk_listT T)
|
neuper@38025
|
293 |
| list2isalist T (t::ts) = (list_const T) $ t $ (list2isalist T ts);
|
neuper@38025
|
294 |
(*
|
neuper@38025
|
295 |
> val tt = (term_of o the o (parse thy)) "R=(R::real)";
|
neuper@38025
|
296 |
> val TT = type_of tt;
|
neuper@38025
|
297 |
> val ss = list2isalist TT [tt,tt,tt];
|
neuper@38025
|
298 |
> (cterm_of thy) ss;
|
neuper@38025
|
299 |
val it = "[R = R, R = R, R = R]" : cterm *)
|
neuper@38025
|
300 |
|
neuper@41972
|
301 |
fun isapair2pair (Const ("Product_Type.Pair",_) $ a $ b) = (a,b)
|
neuper@38025
|
302 |
| isapair2pair t =
|
neuper@38031
|
303 |
error ("isapair2pair called with "^term2str t);
|
neuper@38025
|
304 |
|
neuper@38025
|
305 |
val listType = Type ("List.list",[Type ("bool",[])]);
|
neuper@38025
|
306 |
fun isalist2list ls =
|
neuper@38025
|
307 |
let
|
neuper@38025
|
308 |
fun get es (Const("List.list.Cons",_) $ t $ ls) = get (t::es) ls
|
neuper@38025
|
309 |
| get es (Const("List.list.Nil",_)) = es
|
neuper@38025
|
310 |
| get _ t =
|
neuper@38031
|
311 |
error ("isalist2list applied to NON-list '"^term2str t^"'")
|
neuper@38025
|
312 |
in (rev o (get [])) ls end;
|
neuper@38025
|
313 |
(*
|
neuper@38025
|
314 |
> val il = str2term "[a=b,c=d,e=f]";
|
neuper@38025
|
315 |
> val l = isalist2list il;
|
neuper@38025
|
316 |
> (tracing o terms2str) l;
|
neuper@38025
|
317 |
["a = b","c = d","e = f"]
|
neuper@38025
|
318 |
|
neuper@38025
|
319 |
> val il = str2term "ss___::bool list";
|
neuper@38025
|
320 |
> val l = isalist2list il;
|
neuper@38025
|
321 |
[Free ("ss___", "bool List.list")]
|
neuper@38025
|
322 |
*)
|
neuper@38025
|
323 |
|
neuper@38025
|
324 |
(*review Isabelle2009/src/HOL/Tools/hologic.ML*)
|
neuper@41924
|
325 |
(*val prop = Type ("HOL.Trueprop",[]); ~/Diss.99/Integers-Isa/tools.sml*)
|
neuper@41899
|
326 |
val bool = Type ("HOL.bool",[]); (* 2002 Integ.int *)
|
neuper@41924
|
327 |
val Trueprop = HOLogic.Trueprop;
|
neuper@41924
|
328 |
fun mk_prop t = HOLogic.mk_Trueprop t;
|
neuper@48760
|
329 |
val true_as_cterm = cterm_of (Thy_Info.get_theory "HOL") @{term True};
|
neuper@48760
|
330 |
val false_as_cterm = cterm_of (Thy_Info.get_theory "HOL") @{term False};
|
neuper@38025
|
331 |
|
neuper@38025
|
332 |
infixr 5 -->; (*2002 /Pure/term.ML *)
|
neuper@38025
|
333 |
infixr --->; (*2002 /Pure/term.ML *)
|
neuper@38025
|
334 |
fun S --> T = Type("fun",[S,T]); (*2002 /Pure/term.ML *)
|
neuper@38025
|
335 |
val op ---> = foldr (op -->); (*2002 /Pure/term.ML *)
|
neuper@38025
|
336 |
fun list_implies ([], B) = B : term (*2002 /term.ML *)
|
neuper@38025
|
337 |
| list_implies (A::AS, B) = Logic.implies $ A $ list_implies(AS,B);
|
neuper@38025
|
338 |
|
neuper@38025
|
339 |
|
neuper@38025
|
340 |
(** substitution **)
|
neuper@38025
|
341 |
|
neuper@38025
|
342 |
fun match_bvs(Abs(x,_,s),Abs(y,_,t), al) = (* = thm.ML *)
|
neuper@38025
|
343 |
match_bvs(s, t, if x="" orelse y="" then al
|
neuper@38025
|
344 |
else (x,y)::al)
|
neuper@38025
|
345 |
| match_bvs(f$s, g$t, al) = match_bvs(f,g,match_bvs(s,t,al))
|
neuper@38025
|
346 |
| match_bvs(_,_,al) = al;
|
neuper@38025
|
347 |
fun ren_inst(insts,prop,pat,obj) = (* = thm.ML *)
|
neuper@38025
|
348 |
let val ren = match_bvs(pat,obj,[])
|
neuper@38025
|
349 |
fun renAbs(Abs(x,T,b)) =
|
neuper@38025
|
350 |
Abs(case assoc_string(ren,x) of NONE => x
|
neuper@38025
|
351 |
| SOME(y) => y, T, renAbs(b))
|
neuper@38025
|
352 |
| renAbs(f$t) = renAbs(f) $ renAbs(t)
|
neuper@38025
|
353 |
| renAbs(t) = t
|
neuper@38025
|
354 |
in subst_vars insts (if null(ren) then prop else renAbs(prop)) end;
|
neuper@38025
|
355 |
|
neuper@38025
|
356 |
|
neuper@38025
|
357 |
|
neuper@38025
|
358 |
|
neuper@38025
|
359 |
|
neuper@38025
|
360 |
|
neuper@41922
|
361 |
fun dest_equals' (Const("HOL.eq",_) $ t $ u) = (t,u)(* logic.ML: Const("=="*)
|
neuper@38025
|
362 |
| dest_equals' t = raise TERM("dest_equals'", [t]);
|
neuper@38025
|
363 |
val lhs_ = (fst o dest_equals');
|
neuper@38025
|
364 |
val rhs_ = (snd o dest_equals');
|
neuper@38025
|
365 |
|
neuper@41922
|
366 |
fun is_equality (Const("HOL.eq",_) $ t $ u) = true (* logic.ML: Const("=="*)
|
neuper@38025
|
367 |
| is_equality _ = false;
|
neuper@41922
|
368 |
fun mk_equality (t,u) = (Const("HOL.eq",[type_of t,type_of u]--->bool) $ t $ u);
|
neuper@41922
|
369 |
fun is_expliceq (Const("HOL.eq",_) $ (Free _) $ u) = true
|
neuper@38025
|
370 |
| is_expliceq _ = false;
|
neuper@41924
|
371 |
fun strip_trueprop (Const("HOL.Trueprop",_) $ t) = t
|
neuper@38025
|
372 |
| strip_trueprop t = t;
|
neuper@38025
|
373 |
(* | strip_trueprop t = raise TERM("strip_trueprop", [t]);
|
neuper@38025
|
374 |
*)
|
neuper@38025
|
375 |
|
neuper@38025
|
376 |
(*.(A1==>...An==>B) goes to (A1==>...An==>).*)
|
neuper@38025
|
377 |
fun strip_imp_prems' (Const("==>", T) $ A $ t) =
|
neuper@38025
|
378 |
let fun coll_prems As (Const("==>", _) $ A $ t) =
|
neuper@38025
|
379 |
coll_prems (As $ (Logic.implies $ A)) t
|
neuper@38025
|
380 |
| coll_prems As _ = SOME As
|
neuper@38025
|
381 |
in coll_prems (Logic.implies $ A) t end
|
neuper@38025
|
382 |
| strip_imp_prems' _ = NONE; (* logic.ML: term -> term list*)
|
neuper@38025
|
383 |
(*
|
neuper@38025
|
384 |
val thm = real_mult_div_cancel1;
|
neuper@38025
|
385 |
val prop = (#prop o rep_thm) thm;
|
neuper@38025
|
386 |
atomt prop;
|
neuper@38025
|
387 |
*** -------------
|
neuper@38025
|
388 |
*** Const ( ==>)
|
neuper@38025
|
389 |
*** . Const ( Trueprop)
|
neuper@38025
|
390 |
*** . . Const ( Not)
|
neuper@38025
|
391 |
*** . . . Const ( op =)
|
neuper@38025
|
392 |
*** . . . . Var ((k, 0), )
|
neuper@38025
|
393 |
*** . . . . Const ( 0)
|
neuper@38025
|
394 |
*** . Const ( Trueprop)
|
neuper@38025
|
395 |
*** . . Const ( op =) *** .............
|
neuper@38025
|
396 |
val SOME t = strip_imp_prems' ((#prop o rep_thm) thm);
|
neuper@38025
|
397 |
atomt t;
|
neuper@38025
|
398 |
*** -------------
|
neuper@38025
|
399 |
*** Const ( ==>)
|
neuper@38025
|
400 |
*** . Const ( Trueprop)
|
neuper@38025
|
401 |
*** . . Const ( Not)
|
neuper@38025
|
402 |
*** . . . Const ( op =)
|
neuper@38025
|
403 |
*** . . . . Var ((k, 0), )
|
neuper@38025
|
404 |
*** . . . . Const ( 0)
|
neuper@38025
|
405 |
|
neuper@38025
|
406 |
val thm = real_le_anti_sym;
|
neuper@38025
|
407 |
val prop = (#prop o rep_thm) thm;
|
neuper@38025
|
408 |
atomt prop;
|
neuper@38025
|
409 |
*** -------------
|
neuper@38025
|
410 |
*** Const ( ==>)
|
neuper@38025
|
411 |
*** . Const ( Trueprop)
|
neuper@38025
|
412 |
*** . . Const ( op <=)
|
neuper@38025
|
413 |
*** . . . Var ((z, 0), )
|
neuper@38025
|
414 |
*** . . . Var ((w, 0), )
|
neuper@38025
|
415 |
*** . Const ( ==>)
|
neuper@38025
|
416 |
*** . . Const ( Trueprop)
|
neuper@38025
|
417 |
*** . . . Const ( op <=)
|
neuper@38025
|
418 |
*** . . . . Var ((w, 0), )
|
neuper@38025
|
419 |
*** . . . . Var ((z, 0), )
|
neuper@38025
|
420 |
*** . . Const ( Trueprop)
|
neuper@38025
|
421 |
*** . . . Const ( op =)
|
neuper@38025
|
422 |
*** .............
|
neuper@38025
|
423 |
val SOME t = strip_imp_prems' ((#prop o rep_thm) thm);
|
neuper@38025
|
424 |
atomt t;
|
neuper@38025
|
425 |
*** -------------
|
neuper@38025
|
426 |
*** Const ( ==>)
|
neuper@38025
|
427 |
*** . Const ( Trueprop)
|
neuper@38025
|
428 |
*** . . Const ( op <=)
|
neuper@38025
|
429 |
*** . . . Var ((z, 0), )
|
neuper@38025
|
430 |
*** . . . Var ((w, 0), )
|
neuper@38025
|
431 |
*** . Const ( ==>)
|
neuper@38025
|
432 |
*** . . Const ( Trueprop)
|
neuper@38025
|
433 |
*** . . . Const ( op <=)
|
neuper@38025
|
434 |
*** . . . . Var ((w, 0), )
|
neuper@38025
|
435 |
*** . . . . Var ((z, 0), )
|
neuper@38025
|
436 |
*)
|
neuper@38025
|
437 |
|
neuper@38025
|
438 |
(*. (A1==>...An==>) (B) goes to (A1==>...An==>B), where B is lowest branch.*)
|
neuper@38025
|
439 |
fun ins_concl (Const("==>", T) $ A $ t) B = Logic.implies $ A $ (ins_concl t B)
|
neuper@38025
|
440 |
| ins_concl (Const("==>", T) $ A ) B = Logic.implies $ A $ B
|
neuper@38025
|
441 |
| ins_concl t B = raise TERM("ins_concl", [t, B]);
|
neuper@38025
|
442 |
(*
|
neuper@38025
|
443 |
val thm = real_le_anti_sym;
|
neuper@38025
|
444 |
val prop = (#prop o rep_thm) thm;
|
neuper@38025
|
445 |
val concl = Logic.strip_imp_concl prop;
|
neuper@38025
|
446 |
val SOME prems = strip_imp_prems' prop;
|
neuper@38025
|
447 |
val prop' = ins_concl prems concl;
|
neuper@38025
|
448 |
prop = prop';
|
neuper@38025
|
449 |
atomt prop;
|
neuper@38025
|
450 |
atomt prop';
|
neuper@38025
|
451 |
*)
|
neuper@38025
|
452 |
|
neuper@38025
|
453 |
|
neuper@38025
|
454 |
fun vperm (Var _, Var _) = true (*2002 Pure/thm.ML *)
|
neuper@38025
|
455 |
| vperm (Abs (_, _, s), Abs (_, _, t)) = vperm (s, t)
|
neuper@38025
|
456 |
| vperm (t1 $ t2, u1 $ u2) = vperm (t1, u1) andalso vperm (t2, u2)
|
neuper@38025
|
457 |
| vperm (t, u) = (t = u);
|
neuper@38025
|
458 |
|
neuper@38025
|
459 |
(*2002 cp from Pure/term.ML --- since 2009 in Pure/old_term.ML*)
|
neuper@38025
|
460 |
fun mem_term (_, []) = false
|
neuper@38025
|
461 |
| mem_term (t, t'::ts) = t aconv t' orelse mem_term(t,ts);
|
neuper@38025
|
462 |
fun subset_term ([], ys) = true
|
neuper@38025
|
463 |
| subset_term (x :: xs, ys) = mem_term (x, ys) andalso subset_term(xs, ys);
|
neuper@38025
|
464 |
fun eq_set_term (xs, ys) =
|
neuper@38025
|
465 |
xs = ys orelse (subset_term (xs, ys) andalso subset_term (ys, xs));
|
neuper@38025
|
466 |
(*a total, irreflexive ordering on index names*)
|
neuper@38025
|
467 |
fun xless ((a,i), (b,j): indexname) = i<j orelse (i=j andalso a<b);
|
neuper@38025
|
468 |
(*a partial ordering (not reflexive) for atomic terms*)
|
neuper@38025
|
469 |
fun atless (Const (a,_), Const (b,_)) = a<b
|
neuper@38025
|
470 |
| atless (Free (a,_), Free (b,_)) = a<b
|
neuper@38025
|
471 |
| atless (Var(v,_), Var(w,_)) = xless(v,w)
|
neuper@38025
|
472 |
| atless (Bound i, Bound j) = i<j
|
neuper@38025
|
473 |
| atless _ = false;
|
neuper@38025
|
474 |
(*insert atomic term into partially sorted list, suppressing duplicates (?)*)
|
neuper@38025
|
475 |
fun insert_aterm (t,us) =
|
neuper@38025
|
476 |
let fun inserta [] = [t]
|
neuper@38025
|
477 |
| inserta (us as u::us') =
|
neuper@38025
|
478 |
if atless(t,u) then t::us
|
neuper@38025
|
479 |
else if t=u then us (*duplicate*)
|
neuper@38025
|
480 |
else u :: inserta(us')
|
neuper@38025
|
481 |
in inserta us end;
|
neuper@38025
|
482 |
|
neuper@38025
|
483 |
(*Accumulates the Vars in the term, suppressing duplicates*)
|
neuper@38025
|
484 |
fun add_term_vars (t, vars: term list) = case t of
|
neuper@38025
|
485 |
Var _ => insert_aterm(t,vars)
|
neuper@38025
|
486 |
| Abs (_,_,body) => add_term_vars(body,vars)
|
neuper@38025
|
487 |
| f$t => add_term_vars (f, add_term_vars(t, vars))
|
neuper@38025
|
488 |
| _ => vars;
|
neuper@38025
|
489 |
fun term_vars t = add_term_vars(t,[]);
|
neuper@38025
|
490 |
|
neuper@38025
|
491 |
|
neuper@38025
|
492 |
fun var_perm (t, u) = (*2002 Pure/thm.ML *)
|
neuper@38025
|
493 |
vperm (t, u) andalso eq_set_term (term_vars t, term_vars u);
|
neuper@38025
|
494 |
|
neuper@38025
|
495 |
(*2002 fun decomp_simp, Pure/thm.ML *)
|
neuper@38025
|
496 |
fun perm lhs rhs = var_perm (lhs, rhs) andalso not (lhs aconv rhs)
|
neuper@38025
|
497 |
andalso not (is_Var lhs);
|
neuper@38025
|
498 |
|
neuper@38025
|
499 |
|
neuper@38025
|
500 |
fun str_of_int n =
|
neuper@38025
|
501 |
if n < 0 then "-"^((string_of_int o abs) n)
|
neuper@38025
|
502 |
else string_of_int n;
|
neuper@38025
|
503 |
(*
|
neuper@38025
|
504 |
> str_of_int 1;
|
neuper@38025
|
505 |
val it = "1" : string > str_of_int ~1;
|
neuper@38025
|
506 |
val it = "-1" : string
|
neuper@38025
|
507 |
*)
|
neuper@38025
|
508 |
|
neuper@38025
|
509 |
|
neuper@38025
|
510 |
fun power b 0 = 1
|
neuper@38025
|
511 |
| power b n =
|
neuper@38025
|
512 |
if n>0 then b*(power b (n-1))
|
neuper@38031
|
513 |
else error ("power "^(str_of_int b)^" "^(str_of_int n));
|
neuper@38025
|
514 |
(*
|
neuper@38025
|
515 |
> power 2 3;
|
neuper@38025
|
516 |
val it = 8 : int
|
neuper@38025
|
517 |
> power ~2 3;
|
neuper@38025
|
518 |
val it = ~8 : int
|
neuper@38025
|
519 |
> power ~3 2;
|
neuper@38025
|
520 |
val it = 9 : int
|
neuper@38025
|
521 |
> power 3 ~2;
|
neuper@38025
|
522 |
*)
|
neuper@38025
|
523 |
fun gcd 0 b = b
|
neuper@38025
|
524 |
| gcd a b = if a < b then gcd (b mod a) a
|
neuper@38025
|
525 |
else gcd (a mod b) b;
|
neuper@38025
|
526 |
fun sign n = if n < 0 then ~1
|
neuper@38025
|
527 |
else if n = 0 then 0 else 1;
|
neuper@38025
|
528 |
fun sign2 n1 n2 = (sign n1) * (sign n2);
|
neuper@38025
|
529 |
|
neuper@38025
|
530 |
infix dvd;
|
neuper@38025
|
531 |
fun d dvd n = n mod d = 0;
|
neuper@38025
|
532 |
|
neuper@38025
|
533 |
fun divisors n =
|
neuper@38025
|
534 |
let fun pdiv ds d n =
|
neuper@38025
|
535 |
if d=n then d::ds
|
neuper@38025
|
536 |
else if d dvd n then pdiv (d::ds) d (n div d)
|
neuper@38025
|
537 |
else pdiv ds (d+1) n
|
neuper@38025
|
538 |
in pdiv [] 2 n end;
|
neuper@38025
|
539 |
|
neuper@38025
|
540 |
divisors 30;
|
neuper@38025
|
541 |
divisors 32;
|
neuper@38025
|
542 |
divisors 60;
|
neuper@38025
|
543 |
divisors 11;
|
neuper@38025
|
544 |
|
neuper@38025
|
545 |
fun doubles ds = (* ds is ordered *)
|
neuper@38025
|
546 |
let fun dbls ds [] = ds
|
neuper@38025
|
547 |
| dbls ds [i] = ds
|
neuper@38025
|
548 |
| dbls ds (i::i'::is) = if i=i' then dbls (i::ds) is
|
neuper@38025
|
549 |
else dbls ds (i'::is)
|
neuper@38025
|
550 |
in dbls [] ds end;
|
neuper@38025
|
551 |
(*> doubles [2,3,4];
|
neuper@38025
|
552 |
val it = [] : int list
|
neuper@38025
|
553 |
> doubles [2,3,3,5,5,7];
|
neuper@38025
|
554 |
val it = [5,3] : int list*)
|
neuper@38025
|
555 |
|
neuper@38025
|
556 |
fun squfact 0 = 0
|
neuper@38025
|
557 |
| squfact 1 = 1
|
neuper@38025
|
558 |
| squfact n = foldl op* (1, (doubles o divisors) n);
|
neuper@38025
|
559 |
(*> squfact 30;
|
neuper@38025
|
560 |
val it = 1 : int
|
neuper@38025
|
561 |
> squfact 32;
|
neuper@38025
|
562 |
val it = 4 : int
|
neuper@38025
|
563 |
> squfact 60;
|
neuper@38025
|
564 |
val it = 2 : int
|
neuper@38025
|
565 |
> squfact 11;
|
neuper@38025
|
566 |
val it = 1 : int*)
|
neuper@38025
|
567 |
|
neuper@38025
|
568 |
|
neuper@38025
|
569 |
fun dest_type (Type(T,[])) = T
|
neuper@38025
|
570 |
| dest_type T =
|
neuper@38025
|
571 |
(atomtyp T;
|
neuper@38031
|
572 |
error ("... dest_type: not impl. for this type"));
|
neuper@38025
|
573 |
|
neuper@38025
|
574 |
fun term_of_num ntyp n = Free (str_of_int n, ntyp);
|
neuper@38025
|
575 |
|
neuper@38025
|
576 |
fun pairT T1 T2 = Type ("*", [T1, T2]);
|
neuper@38025
|
577 |
(*> val t = str2term "(1,2)";
|
neuper@38025
|
578 |
> type_of t = pairT HOLogic.realT HOLogic.realT;
|
neuper@38025
|
579 |
val it = true : bool
|
neuper@38025
|
580 |
*)
|
neuper@38025
|
581 |
fun PairT T1 T2 = ([T1, T2] ---> Type ("*", [T1, T2]));
|
neuper@38025
|
582 |
(*> val t = str2term "(1,2)";
|
neuper@41972
|
583 |
> val Const ("Product_Type.Pair",pT) $ _ $ _ = t;
|
neuper@38025
|
584 |
> pT = PairT HOLogic.realT HOLogic.realT;
|
neuper@38025
|
585 |
val it = true : bool
|
neuper@38025
|
586 |
*)
|
neuper@38025
|
587 |
fun pairt t1 t2 =
|
neuper@41972
|
588 |
Const ("Product_Type.Pair", PairT (type_of t1) (type_of t2)) $ t1 $ t2;
|
neuper@38025
|
589 |
(*> val t = str2term "(1,2)";
|
neuper@38025
|
590 |
> val (t1, t2) = (str2term "1", str2term "2");
|
neuper@38025
|
591 |
> t = pairt t1 t2;
|
neuper@38025
|
592 |
val it = true : bool*)
|
neuper@38025
|
593 |
|
neuper@38025
|
594 |
|
neuper@38025
|
595 |
fun num_of_term (t as Free (s,_)) =
|
neuper@38025
|
596 |
(case int_of_str s of
|
neuper@38025
|
597 |
SOME s' => s'
|
neuper@38031
|
598 |
| NONE => error ("num_of_term not for "^ term2str t))
|
neuper@38031
|
599 |
| num_of_term t = error ("num_of_term not for "^term2str t);
|
neuper@38025
|
600 |
|
neuper@38025
|
601 |
fun mk_factroot op_(*=thy.sqrt*) T fact root =
|
neuper@38034
|
602 |
Const ("Groups.times_class.times", [T, T] ---> T) $ (term_of_num T fact) $
|
neuper@38025
|
603 |
(Const (op_, T --> T) $ term_of_num T root);
|
neuper@38025
|
604 |
(*
|
neuper@38025
|
605 |
val T = (type_of o term_of o the) (parse thy "#12::real");
|
neuper@38025
|
606 |
val t = mk_factroot "SqRoot.sqrt" T 2 3;
|
neuper@38025
|
607 |
(cterm_of thy) t;
|
neuper@38025
|
608 |
val it = "#2 * sqrt #3 " : cterm
|
neuper@38025
|
609 |
*)
|
neuper@38025
|
610 |
fun var_op_num v op_ optype ntyp n =
|
neuper@38025
|
611 |
Const (op_, optype) $ v $
|
neuper@38025
|
612 |
Free (str_of_int n, ntyp);
|
neuper@38025
|
613 |
|
neuper@38025
|
614 |
fun num_op_var v op_ optype ntyp n =
|
neuper@38025
|
615 |
Const (op_,optype) $
|
neuper@38025
|
616 |
Free (str_of_int n, ntyp) $ v;
|
neuper@38025
|
617 |
|
neuper@38025
|
618 |
fun num_op_num T1 T2 (op_,Top) n1 n2 =
|
neuper@38025
|
619 |
Const (op_,Top) $
|
neuper@38025
|
620 |
Free (str_of_int n1, T1) $ Free (str_of_int n2, T2);
|
neuper@38025
|
621 |
(*
|
neuper@38025
|
622 |
> val t = num_op_num "Int" 3 4;
|
neuper@38025
|
623 |
> atomty t;
|
neuper@38025
|
624 |
> string_of_cterm ((cterm_of thy) t);
|
neuper@38025
|
625 |
*)
|
neuper@38025
|
626 |
|
neuper@41931
|
627 |
|
neuper@41931
|
628 |
|
neuper@38025
|
629 |
fun const_in str (Const _) = false
|
neuper@38025
|
630 |
| const_in str (Free (s,_)) = if strip_thy s = str then true else false
|
neuper@38025
|
631 |
| const_in str (Bound _) = false
|
neuper@38025
|
632 |
| const_in str (Var _) = false
|
neuper@38025
|
633 |
| const_in str (Abs (_,_,body)) = const_in str body
|
neuper@38025
|
634 |
| const_in str (f$u) = const_in str f orelse const_in str u;
|
neuper@38025
|
635 |
(*
|
neuper@38025
|
636 |
> val t = (term_of o the o (parse thy)) "6 + 5 * sqrt 4 + 3";
|
neuper@38025
|
637 |
> const_in "sqrt" t;
|
neuper@38025
|
638 |
val it = true : bool
|
neuper@38025
|
639 |
> val t = (term_of o the o (parse thy)) "6 + 5 * 4 + 3";
|
neuper@38025
|
640 |
> const_in "sqrt" t;
|
neuper@38025
|
641 |
val it = false : bool
|
neuper@38025
|
642 |
*)
|
neuper@38025
|
643 |
|
neuper@38025
|
644 |
(*used for calculating built in binary operations in Isabelle2002->Float.ML*)
|
neuper@38025
|
645 |
(*fun calc "Groups.plus_class.plus" (n1, n2) = n1+n2
|
neuper@38025
|
646 |
| calc "Groups.minus_class.minus" (n1, n2) = n1-n2
|
neuper@38034
|
647 |
| calc "Groups.times_class.times" (n1, n2) = n1*n2
|
neuper@48789
|
648 |
| calc "Fields.inverse_class.divide"(n1, n2) = n1 div n2
|
neuper@38025
|
649 |
| calc "Atools.pow"(n1, n2) = power n1 n2
|
neuper@38031
|
650 |
| calc op_ _ = error ("calc: operator = "^op_^" not defined");-----*)
|
neuper@38046
|
651 |
fun calc_equ "less" (n1, n2) = n1 < n2
|
neuper@38046
|
652 |
| calc_equ "less_eq" (n1, n2) = n1 <= n2
|
neuper@38025
|
653 |
| calc_equ op_ _ =
|
neuper@38031
|
654 |
error ("calc_equ: operator = "^op_^" not defined");
|
neuper@38025
|
655 |
fun sqrt (n:int) = if n < 0 then 0
|
neuper@38025
|
656 |
(*FIXME ~~~*) else (trunc o Math.sqrt o Real.fromInt) n;
|
neuper@38025
|
657 |
|
neuper@38025
|
658 |
fun mk_thmid thmid op_ n1 n2 =
|
neuper@38025
|
659 |
thmid ^ (strip_thy n1) ^ "_" ^ (strip_thy n2);
|
neuper@38025
|
660 |
|
neuper@38025
|
661 |
fun dest_binop_typ (Type("fun",[range,Type("fun",[arg2,arg1])])) =
|
neuper@38025
|
662 |
(arg1,arg2,range)
|
neuper@38031
|
663 |
| dest_binop_typ _ = error "dest_binop_typ: not binary";
|
neuper@38025
|
664 |
(* -----
|
neuper@38025
|
665 |
> val t = (term_of o the o (parse thy)) "#3^#4";
|
neuper@38025
|
666 |
> val hT = type_of (head_of t);
|
neuper@38025
|
667 |
> dest_binop_typ hT;
|
neuper@38025
|
668 |
val it = ("'a","nat","'a") : typ * typ * typ
|
neuper@38025
|
669 |
----- *)
|
neuper@38025
|
670 |
|
neuper@38025
|
671 |
|
neuper@38025
|
672 |
(** transform binary numeralsstrings **)
|
neuper@38025
|
673 |
(*Makarius 100308, hacked by WN*)
|
neuper@38025
|
674 |
val numbers_to_string =
|
neuper@38025
|
675 |
let
|
neuper@38025
|
676 |
fun dest_num t =
|
neuper@38025
|
677 |
(case try HOLogic.dest_number t of
|
neuper@38025
|
678 |
SOME (T, i) =>
|
neuper@38025
|
679 |
(*if T = @{typ int} orelse T = @{typ real} then WN*)
|
neuper@38025
|
680 |
SOME (Free (signed_string_of_int i, T))
|
neuper@38025
|
681 |
(*else NONE WN*)
|
neuper@38025
|
682 |
| NONE => NONE);
|
neuper@38025
|
683 |
|
neuper@38025
|
684 |
fun to_str (Abs (x, T, b)) = Abs (x, T, to_str b)
|
neuper@38025
|
685 |
| to_str (t as (u1 $ u2)) =
|
neuper@38025
|
686 |
(case dest_num t of
|
neuper@38025
|
687 |
SOME t' => t'
|
neuper@38025
|
688 |
| NONE => to_str u1 $ to_str u2)
|
neuper@38025
|
689 |
| to_str t = perhaps dest_num t;
|
neuper@38025
|
690 |
in to_str end
|
neuper@38025
|
691 |
|
neuper@38025
|
692 |
(*.make uminus uniform:
|
neuper@38025
|
693 |
Const ("uminus", _) $ Free ("2", "RealDef.real") --> Free ("-2", _)
|
neuper@38025
|
694 |
to be used immediately before evaluation of numerals;
|
neuper@38025
|
695 |
see Scripts/calculate.sml .*)
|
neuper@38025
|
696 |
(*2002 fun(*app_num_tr'2 (Const("0",T)) = Free("0",T)
|
neuper@38025
|
697 |
| app_num_tr'2 (Const("1",T)) = Free("1",T)
|
neuper@38025
|
698 |
|*)app_num_tr'2 (t as Const("uminus",_) $ Free(s,T)) =
|
neuper@38025
|
699 |
(case int_of_str s of SOME i =>
|
neuper@38025
|
700 |
if i > 0 then Free("-"^s,T) else Free(s,T)
|
neuper@38025
|
701 |
| NONE => t)
|
neuper@38025
|
702 |
(*| app_num_tr'2 (t as Const(s,T)) = t
|
neuper@38025
|
703 |
| app_num_tr'2 (Const("Numeral.number_of",Type ("fun", [_, T])) $ t) =
|
neuper@38025
|
704 |
Free(NumeralSyntax.dest_bin_str t, T)
|
neuper@38025
|
705 |
| app_num_tr'2 (t as Free(s,T)) = t
|
neuper@38025
|
706 |
| app_num_tr'2 (t as Var(n,T)) = t
|
neuper@38025
|
707 |
| app_num_tr'2 (t as Bound i) = t
|
neuper@38025
|
708 |
*)| app_num_tr'2 (Abs(s,T,body)) = Abs(s,T, app_num_tr'2 body)
|
neuper@38025
|
709 |
| app_num_tr'2 (t1 $ t2) = (app_num_tr'2 t1) $ (app_num_tr'2 t2)
|
neuper@38025
|
710 |
| app_num_tr'2 t = t;
|
neuper@38025
|
711 |
*)
|
neuper@38025
|
712 |
val uminus_to_string =
|
neuper@38025
|
713 |
let
|
neuper@38025
|
714 |
fun dest_num t =
|
neuper@38025
|
715 |
(case t of
|
neuper@38025
|
716 |
(Const ("Groups.uminus_class.uminus", _) $ Free (s, T)) =>
|
neuper@38025
|
717 |
(case int_of_str s of
|
neuper@38025
|
718 |
SOME i =>
|
neuper@38025
|
719 |
SOME (Free (signed_string_of_int (~1 * i), T))
|
neuper@38025
|
720 |
| NONE => NONE)
|
neuper@38025
|
721 |
| _ => NONE);
|
neuper@38025
|
722 |
|
neuper@38025
|
723 |
fun to_str (Abs (x, T, b)) = Abs (x, T, to_str b)
|
neuper@38025
|
724 |
| to_str (t as (u1 $ u2)) =
|
neuper@38025
|
725 |
(case dest_num t of
|
neuper@38025
|
726 |
SOME t' => t'
|
neuper@38025
|
727 |
| NONE => to_str u1 $ to_str u2)
|
neuper@38025
|
728 |
| to_str t = perhaps dest_num t;
|
neuper@38025
|
729 |
in to_str end;
|
neuper@38025
|
730 |
|
neuper@38025
|
731 |
|
neuper@38025
|
732 |
(*2002 fun num_str thm =
|
neuper@38025
|
733 |
let
|
neuper@38025
|
734 |
val {sign_ref = sign_ref, der = der, maxidx = maxidx,
|
neuper@38025
|
735 |
shyps = shyps, hyps = hyps, (*tpairs = tpairs,*) prop = prop} =
|
neuper@38025
|
736 |
rep_thm_G thm;
|
neuper@38025
|
737 |
val prop' = app_num_tr'1 prop;
|
neuper@38025
|
738 |
in assbl_thm sign_ref der maxidx shyps hyps (*tpairs*) prop' end;*)
|
neuper@38025
|
739 |
fun num_str thm =
|
neuper@38025
|
740 |
let val (deriv,
|
neuper@38025
|
741 |
{thy_ref = thy_ref, tags = tags, maxidx = maxidx, shyps = shyps,
|
neuper@38025
|
742 |
hyps = hyps, tpairs = tpairs, prop = prop}) = rep_thm_G thm
|
neuper@38025
|
743 |
val prop' = numbers_to_string prop;
|
neuper@38025
|
744 |
in assbl_thm deriv thy_ref tags maxidx shyps hyps tpairs prop' end;
|
neuper@38025
|
745 |
|
neuper@38025
|
746 |
fun get_thm' xstring = (*?covers 2009 Thm?!, replaces 2002 fun get_thm :
|
neuper@38025
|
747 |
val it = fn : theory -> xstring -> Thm.thm*)
|
neuper@38025
|
748 |
Thm (xstring,
|
neuper@48761
|
749 |
num_str (Proof_Context.get_thm (thy2ctxt' "Isac") xstring));
|
neuper@38025
|
750 |
|
neuper@38025
|
751 |
(** get types of Free and Abs for parse' **)
|
neuper@38025
|
752 |
(*11.1.00: not used, fix-typed +,*,-,^ instead *)
|
neuper@38025
|
753 |
|
neuper@38025
|
754 |
val dummyT = Type ("dummy",[]);
|
neuper@38025
|
755 |
val dummyT = TVar (("DUMMY",0),[]);
|
neuper@38025
|
756 |
|
neuper@38025
|
757 |
(* assumes only 1 type for numerals
|
neuper@38025
|
758 |
and different identifiers for Const, Free and Abs *)
|
neuper@38025
|
759 |
fun get_types t =
|
neuper@38025
|
760 |
let
|
neuper@38025
|
761 |
fun get ts (Const(s,T)) = (s,T)::ts
|
neuper@38025
|
762 |
| get ts (Free(s,T)) = if is_no s
|
neuper@38025
|
763 |
then ("#",T)::ts else (s,T)::ts
|
neuper@38025
|
764 |
| get ts (Var(n,T)) = ts
|
neuper@38025
|
765 |
| get ts (Bound i) = ts
|
neuper@38025
|
766 |
| get ts (Abs(s,T,body)) = get ((s,T)::ts) body
|
neuper@38025
|
767 |
| get ts (t1 $ t2) = (get ts t1) @ (get ts t2)
|
neuper@38025
|
768 |
in distinct (get [] t) end;
|
neuper@38025
|
769 |
(*
|
neuper@38025
|
770 |
val t = (term_of o the o (parse thy)) "sqrt(#9+#4*x)=sqrt x + sqrt(#-3+x)";
|
neuper@38025
|
771 |
get_types t;
|
neuper@38025
|
772 |
*)
|
neuper@38025
|
773 |
|
neuper@38025
|
774 |
(*11.1.00: not used, fix-typed +,*,-,^ instead *)
|
neuper@38025
|
775 |
fun set_types al (Const(s,T)) =
|
neuper@38025
|
776 |
(case assoc (al,s) of
|
neuper@38025
|
777 |
SOME T' => Const(s,T')
|
neuper@38025
|
778 |
| NONE => (warning ("set_types: no type for "^s); Const(s,dummyT)))
|
neuper@38025
|
779 |
| set_types al (Free(s,T)) =
|
neuper@38025
|
780 |
if is_no s then
|
neuper@38025
|
781 |
(case assoc (al,"#") of
|
neuper@38025
|
782 |
SOME T' => Free(s,T')
|
neuper@38025
|
783 |
| NONE => (warning ("set_types: no type for numerals"); Free(s,T)))
|
neuper@38025
|
784 |
else (case assoc (al,s) of
|
neuper@38025
|
785 |
SOME T' => Free(s,T')
|
neuper@38025
|
786 |
| NONE => (warning ("set_types: no type for "^s); Free(s,T)))
|
neuper@38025
|
787 |
| set_types al (Var(n,T)) = Var(n,T)
|
neuper@38025
|
788 |
| set_types al (Bound i) = Bound i
|
neuper@38025
|
789 |
| set_types al (Abs(s,T,body)) =
|
neuper@38025
|
790 |
(case assoc (al,s) of
|
neuper@38025
|
791 |
SOME T' => Abs(s,T', set_types al body)
|
neuper@38025
|
792 |
| NONE => (warning ("set_types: no type for "^s);
|
neuper@38025
|
793 |
Abs(s,T, set_types al body)))
|
neuper@38025
|
794 |
| set_types al (t1 $ t2) = (set_types al t1) $ (set_types al t2);
|
neuper@38025
|
795 |
(*
|
neuper@38025
|
796 |
val t = (term_of o the o (parse thy)) "sqrt(#9+#4*x)=sqrt x + sqrt(#-3+x)";
|
neuper@38025
|
797 |
val al = get_types t;
|
neuper@38025
|
798 |
|
neuper@38025
|
799 |
val t = (term_of o the o (parse thy)) "x = #0 + #-1 * #-4";
|
neuper@38025
|
800 |
atomty t; (* 'a *)
|
neuper@38025
|
801 |
val t' = set_types al t;
|
neuper@38025
|
802 |
atomty t'; (*real*)
|
neuper@38025
|
803 |
(cterm_of thy) t';
|
neuper@38025
|
804 |
val it = "x = #0 + #-1 * #-4" : cterm
|
neuper@38025
|
805 |
|
neuper@38025
|
806 |
val t = (term_of o the o (parse thy))
|
neuper@38025
|
807 |
"#5 * x + x ^^^ #2 = (#2 + x) ^^^ #2";
|
neuper@38025
|
808 |
atomty t;
|
neuper@38025
|
809 |
val t' = set_types al t;
|
neuper@38025
|
810 |
atomty t';
|
neuper@38025
|
811 |
(cterm_of thy) t';
|
neuper@38025
|
812 |
uncaught exception TYPE (*^^^ is new, NOT in al*)
|
neuper@38025
|
813 |
*)
|
neuper@38025
|
814 |
|
neuper@38025
|
815 |
|
neuper@38025
|
816 |
(** from Descript.ML **)
|
neuper@38025
|
817 |
|
neuper@38025
|
818 |
(** decompose an isa-list to an ML-list
|
neuper@38025
|
819 |
i.e. [] belong to the meta-language, too **)
|
neuper@38025
|
820 |
|
neuper@38025
|
821 |
fun is_list ((Const("List.list.Cons",_)) $ _ $ _) = true
|
neuper@38025
|
822 |
| is_list _ = false;
|
neuper@38025
|
823 |
(* val (SOME ct) = parse thy "lll::real list";
|
neuper@38025
|
824 |
> val ty = (#t o rep_cterm) ct;
|
neuper@38025
|
825 |
> is_list ty;
|
neuper@38025
|
826 |
val it = false : bool
|
neuper@38025
|
827 |
> val (SOME ct) = parse thy "[lll]";
|
neuper@38025
|
828 |
> val ty = (#t o rep_cterm) ct;
|
neuper@38025
|
829 |
> is_list ty;
|
neuper@38025
|
830 |
val it = true : bool *)
|
neuper@38025
|
831 |
|
neuper@38025
|
832 |
|
neuper@38025
|
833 |
|
neuper@38025
|
834 |
fun mk_Free (s,T) = Free(s,T);
|
neuper@38025
|
835 |
fun mk_free T s = Free(s,T);
|
neuper@38025
|
836 |
|
neuper@38025
|
837 |
(*Special case: one argument cp from Isabelle2002/src/Pure/term.ML*)
|
neuper@38025
|
838 |
fun subst_bound (arg, t) : term = (*WN100908 neglects 'raise Same.SAME'*)
|
neuper@38025
|
839 |
let fun subst (t as Bound i, lev) =
|
neuper@38025
|
840 |
if i<lev then t (*var is locally bound*)
|
neuper@38025
|
841 |
else if i=lev then incr_boundvars lev arg
|
neuper@38025
|
842 |
else Bound(i-1) (*loose: change it*)
|
neuper@38025
|
843 |
| subst (Abs(a,T,body), lev) = Abs(a, T, subst(body,lev+1))
|
neuper@38025
|
844 |
| subst (f$t, lev) = subst(f,lev) $ subst(t,lev)
|
neuper@38025
|
845 |
| subst (t,lev) = t
|
neuper@38025
|
846 |
in subst (t,0) end;
|
neuper@38025
|
847 |
|
neuper@38025
|
848 |
(*instantiate let; necessary for ass_up*)
|
neuper@38025
|
849 |
fun inst_abs thy (Const sT) = Const sT (*TODO.WN100907 drop thy*)
|
neuper@38025
|
850 |
| inst_abs thy (Free sT) = Free sT
|
neuper@38025
|
851 |
| inst_abs thy (Bound n) = Bound n
|
neuper@38025
|
852 |
| inst_abs thy (Var iT) = Var iT
|
neuper@41968
|
853 |
| inst_abs thy (Const ("HOL.Let",T1) $ e $ (Abs (v, T2, b))) =
|
neuper@38025
|
854 |
let val b' = subst_bound (Free (v, T2), b);
|
neuper@38025
|
855 |
(*fun variant_abs: term.ML*)
|
neuper@41968
|
856 |
in Const ("HOL.Let", T1) $ inst_abs thy e $ (Abs (v, T2, inst_abs thy b')) end
|
neuper@38025
|
857 |
| inst_abs thy (t1 $ t2) = inst_abs thy t1 $ inst_abs thy t2
|
neuper@38025
|
858 |
| inst_abs thy t = t;
|
neuper@38025
|
859 |
(*val scr =
|
neuper@38025
|
860 |
"Script Make_fun_by_explicit (f_::real) (v_::real) (eqs_::bool list) = \
|
neuper@38025
|
861 |
\ (let h_ = (hd o (filterVar f_)) eqs_; \
|
neuper@38025
|
862 |
\ e_1 = hd (dropWhile (ident h_) eqs_); \
|
neuper@38025
|
863 |
\ vs_ = dropWhile (ident f_) (Vars h_); \
|
neuper@38025
|
864 |
\ v_1 = hd (dropWhile (ident v_) vs_); \
|
neuper@38025
|
865 |
\ (s_1::bool list)=(SubProblem(DiffApp_,[univar,equation],[no_met])\
|
neuper@38025
|
866 |
\ [BOOL e_1, REAL v_1])\
|
neuper@38025
|
867 |
\ in Substitute [(v_1 = (rhs o hd) s_1)] h_)";
|
neuper@38025
|
868 |
> val ttt = (term_of o the o (parse thy)) scr;
|
neuper@38025
|
869 |
> tracing(term2str ttt);
|
neuper@38025
|
870 |
> atomt ttt;
|
neuper@38025
|
871 |
*** -------------
|
neuper@38025
|
872 |
*** Const ( DiffApp.Make'_fun'_by'_explicit)
|
neuper@38025
|
873 |
*** . Free ( f_, )
|
neuper@38025
|
874 |
*** . Free ( v_, )
|
neuper@38025
|
875 |
*** . Free ( eqs_, )
|
neuper@38025
|
876 |
*** . Const ( Let)
|
neuper@38025
|
877 |
*** . . Const ( Fun.op o)
|
neuper@38025
|
878 |
*** . . . Const ( List.hd)
|
neuper@38025
|
879 |
*** . . . Const ( DiffApp.filterVar)
|
neuper@38025
|
880 |
*** . . . . Free ( f_, )
|
neuper@38025
|
881 |
*** . . . Free ( eqs_, )
|
neuper@38025
|
882 |
*** . . Abs( h_,..
|
neuper@38025
|
883 |
*** . . . Const ( Let)
|
neuper@38025
|
884 |
*** . . . . Const ( List.hd)
|
neuper@38025
|
885 |
*** . . . . . Const ( List.dropWhile)
|
neuper@38025
|
886 |
*** . . . . . . Const ( Atools.ident)
|
neuper@38025
|
887 |
*** . . . . . . . Bound 0 <---- Free ( h_, )
|
neuper@38025
|
888 |
*** . . . . . . Free ( eqs_, )
|
neuper@38025
|
889 |
*** . . . . Abs( e_1,..
|
neuper@38025
|
890 |
*** . . . . . Const ( Let)
|
neuper@38025
|
891 |
*** . . . . . . Const ( List.dropWhile)
|
neuper@38025
|
892 |
*** . . . . . . . Const ( Atools.ident)
|
neuper@38025
|
893 |
*** . . . . . . . . Free ( f_, )
|
neuper@38025
|
894 |
*** . . . . . . . Const ( Tools.Vars)
|
neuper@38025
|
895 |
*** . . . . . . . . Bound 1 <---- Free ( h_, )
|
neuper@38025
|
896 |
*** . . . . . . Abs( vs_,..
|
neuper@38025
|
897 |
*** . . . . . . . Const ( Let)
|
neuper@38025
|
898 |
*** . . . . . . . . Const ( List.hd)
|
neuper@38025
|
899 |
*** . . . . . . . . . Const ( List.dropWhile)
|
neuper@38025
|
900 |
*** . . . . . . . . . . Const ( Atools.ident)
|
neuper@38025
|
901 |
*** . . . . . . . . . . . Free ( v_, )
|
neuper@38025
|
902 |
*** . . . . . . . . . . Bound 0 <---- Free ( vs_, )
|
neuper@38025
|
903 |
*** . . . . . . . . Abs( v_1,..
|
neuper@38025
|
904 |
*** . . . . . . . . . Const ( Let)
|
neuper@38025
|
905 |
*** . . . . . . . . . . Const ( Script.SubProblem)
|
neuper@38025
|
906 |
*** . . . . . . . . . . . Const ( Pair)
|
neuper@38025
|
907 |
*** . . . . . . . . . . . . Free ( DiffApp_, )
|
neuper@38025
|
908 |
*** . . . . . . . . . . . . Const ( Pair)
|
neuper@38025
|
909 |
*** . . . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
910 |
*** . . . . . . . . . . . . . . Free ( univar, )
|
neuper@38025
|
911 |
*** . . . . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
912 |
*** . . . . . . . . . . . . . . . Free ( equation, )
|
neuper@38025
|
913 |
*** . . . . . . . . . . . . . . . Const ( List.list.Nil)
|
neuper@38025
|
914 |
*** . . . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
915 |
*** . . . . . . . . . . . . . . Free ( no_met, )
|
neuper@38025
|
916 |
*** . . . . . . . . . . . . . . Const ( List.list.Nil)
|
neuper@38025
|
917 |
*** . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
918 |
*** . . . . . . . . . . . . Const ( Script.BOOL)
|
neuper@38025
|
919 |
*** . . . . . . . . . . . . . Bound 2 <----- Free ( e_1, )
|
neuper@38025
|
920 |
*** . . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
921 |
*** . . . . . . . . . . . . . Const ( Script.real_)
|
neuper@38025
|
922 |
*** . . . . . . . . . . . . . . Bound 0 <----- Free ( v_1, )
|
neuper@38025
|
923 |
*** . . . . . . . . . . . . . Const ( List.list.Nil)
|
neuper@38025
|
924 |
*** . . . . . . . . . . Abs( s_1,..
|
neuper@38025
|
925 |
*** . . . . . . . . . . . Const ( Script.Substitute)
|
neuper@38025
|
926 |
*** . . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
927 |
*** . . . . . . . . . . . . . Const ( Pair)
|
neuper@38025
|
928 |
*** . . . . . . . . . . . . . . Bound 1 <----- Free ( v_1, )
|
neuper@38025
|
929 |
*** . . . . . . . . . . . . . . Const ( Fun.op o)
|
neuper@38025
|
930 |
*** . . . . . . . . . . . . . . . Const ( Tools.rhs)
|
neuper@38025
|
931 |
*** . . . . . . . . . . . . . . . Const ( List.hd)
|
neuper@38025
|
932 |
*** . . . . . . . . . . . . . . . Bound 0 <----- Free ( s_1, )
|
neuper@38025
|
933 |
*** . . . . . . . . . . . . . Const ( List.list.Nil)
|
neuper@38025
|
934 |
*** . . . . . . . . . . . . Bound 4 <----- Free ( h_, )
|
neuper@38025
|
935 |
|
neuper@38025
|
936 |
> val ttt' = inst_abs thy ttt;
|
neuper@38025
|
937 |
> tracing(term2str ttt');
|
neuper@38025
|
938 |
Script Make_fun_by_explicit f_ v_ eqs_ =
|
neuper@38025
|
939 |
... as above ...
|
neuper@38025
|
940 |
> atomt ttt';
|
neuper@38025
|
941 |
*** -------------
|
neuper@38025
|
942 |
*** Const ( DiffApp.Make'_fun'_by'_explicit)
|
neuper@38025
|
943 |
*** . Free ( f_, )
|
neuper@38025
|
944 |
*** . Free ( v_, )
|
neuper@38025
|
945 |
*** . Free ( eqs_, )
|
neuper@38025
|
946 |
*** . Const ( Let)
|
neuper@38025
|
947 |
*** . . Const ( Fun.op o)
|
neuper@38025
|
948 |
*** . . . Const ( List.hd)
|
neuper@38025
|
949 |
*** . . . Const ( DiffApp.filterVar)
|
neuper@38025
|
950 |
*** . . . . Free ( f_, )
|
neuper@38025
|
951 |
*** . . . Free ( eqs_, )
|
neuper@38025
|
952 |
*** . . Abs( h_,..
|
neuper@38025
|
953 |
*** . . . Const ( Let)
|
neuper@38025
|
954 |
*** . . . . Const ( List.hd)
|
neuper@38025
|
955 |
*** . . . . . Const ( List.dropWhile)
|
neuper@38025
|
956 |
*** . . . . . . Const ( Atools.ident)
|
neuper@38025
|
957 |
*** . . . . . . . Free ( h_, ) <---- Bound 0
|
neuper@38025
|
958 |
*** . . . . . . Free ( eqs_, )
|
neuper@38025
|
959 |
*** . . . . Abs( e_1,..
|
neuper@38025
|
960 |
*** . . . . . Const ( Let)
|
neuper@38025
|
961 |
*** . . . . . . Const ( List.dropWhile)
|
neuper@38025
|
962 |
*** . . . . . . . Const ( Atools.ident)
|
neuper@38025
|
963 |
*** . . . . . . . . Free ( f_, )
|
neuper@38025
|
964 |
*** . . . . . . . Const ( Tools.Vars)
|
neuper@38025
|
965 |
*** . . . . . . . . Free ( h_, ) <---- Bound 1
|
neuper@38025
|
966 |
*** . . . . . . Abs( vs_,..
|
neuper@38025
|
967 |
*** . . . . . . . Const ( Let)
|
neuper@38025
|
968 |
*** . . . . . . . . Const ( List.hd)
|
neuper@38025
|
969 |
*** . . . . . . . . . Const ( List.dropWhile)
|
neuper@38025
|
970 |
*** . . . . . . . . . . Const ( Atools.ident)
|
neuper@38025
|
971 |
*** . . . . . . . . . . . Free ( v_, )
|
neuper@38025
|
972 |
*** . . . . . . . . . . Free ( vs_, ) <---- Bound 0
|
neuper@38025
|
973 |
*** . . . . . . . . Abs( v_1,..
|
neuper@38025
|
974 |
*** . . . . . . . . . Const ( Let)
|
neuper@38025
|
975 |
*** . . . . . . . . . . Const ( Script.SubProblem)
|
neuper@38025
|
976 |
*** . . . . . . . . . . . Const ( Pair)
|
neuper@38025
|
977 |
*** . . . . . . . . . . . . Free ( DiffApp_, )
|
neuper@38025
|
978 |
*** . . . . . . . . . . . . Const ( Pair)
|
neuper@38025
|
979 |
*** . . . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
980 |
*** . . . . . . . . . . . . . . Free ( univar, )
|
neuper@38025
|
981 |
*** . . . . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
982 |
*** . . . . . . . . . . . . . . . Free ( equation, )
|
neuper@38025
|
983 |
*** . . . . . . . . . . . . . . . Const ( List.list.Nil)
|
neuper@38025
|
984 |
*** . . . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
985 |
*** . . . . . . . . . . . . . . Free ( no_met, )
|
neuper@38025
|
986 |
*** . . . . . . . . . . . . . . Const ( List.list.Nil)
|
neuper@38025
|
987 |
*** . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
988 |
*** . . . . . . . . . . . . Const ( Script.BOOL)
|
neuper@38025
|
989 |
*** . . . . . . . . . . . . . Free ( e_1, ) <----- Bound 2
|
neuper@38025
|
990 |
*** . . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
991 |
*** . . . . . . . . . . . . . Const ( Script.real_)
|
neuper@38025
|
992 |
*** . . . . . . . . . . . . . . Free ( v_1, ) <----- Bound 0
|
neuper@38025
|
993 |
*** . . . . . . . . . . . . . Const ( List.list.Nil)
|
neuper@38025
|
994 |
*** . . . . . . . . . . Abs( s_1,..
|
neuper@38025
|
995 |
*** . . . . . . . . . . . Const ( Script.Substitute)
|
neuper@38025
|
996 |
*** . . . . . . . . . . . . Const ( List.list.Cons)
|
neuper@38025
|
997 |
*** . . . . . . . . . . . . . Const ( Pair)
|
neuper@38025
|
998 |
*** . . . . . . . . . . . . . . Free ( v_1, ) <----- Bound 1
|
neuper@38025
|
999 |
*** . . . . . . . . . . . . . . Const ( Fun.op o)
|
neuper@38025
|
1000 |
*** . . . . . . . . . . . . . . . Const ( Tools.rhs)
|
neuper@38025
|
1001 |
*** . . . . . . . . . . . . . . . Const ( List.hd)
|
neuper@38025
|
1002 |
*** . . . . . . . . . . . . . . . Free ( s_1, ) <----- Bound 0
|
neuper@38025
|
1003 |
*** . . . . . . . . . . . . . Const ( List.list.Nil)
|
neuper@38025
|
1004 |
*** . . . . . . . . . . . . Free ( h_, ) <----- Bound 4
|
neuper@38025
|
1005 |
|
neuper@38025
|
1006 |
Note numbering of de Bruijn indexes !
|
neuper@38025
|
1007 |
|
neuper@38025
|
1008 |
Script Make_fun_by_explicit f_ v_ eqs_ =
|
neuper@38025
|
1009 |
let h_ = (hd o filterVar f_) eqs_;
|
neuper@38025
|
1010 |
e_1 = hd (dropWhile (ident h_ BOUND_0) eqs_);
|
neuper@38025
|
1011 |
vs_ = dropWhile (ident f_) (Vars h_ BOUND_1);
|
neuper@38025
|
1012 |
v_1 = hd (dropWhile (ident v_) vs_ BOUND_0);
|
neuper@38025
|
1013 |
s_1 =
|
neuper@38025
|
1014 |
SubProblem (DiffApp_, [univar, equation], [no_met])
|
neuper@38025
|
1015 |
[BOOL e_1 BOUND_2, REAL v_1 BOUND_0]
|
neuper@38025
|
1016 |
in Substitute [(v_1 BOUND_1 = (rhs o hd) s_1 BOUND_0)] h_ BOUND_4
|
neuper@38025
|
1017 |
*)
|
neuper@38025
|
1018 |
|
neuper@38037
|
1019 |
(* for parse and parse_patt: fix all types to real *)
|
neuper@38025
|
1020 |
fun T_a2real (Type (s, [])) =
|
neuper@38037
|
1021 |
if s = "'a" orelse s = "'b" orelse s = "'c" then HOLogic.realT
|
neuper@38037
|
1022 |
else Type (s, [])
|
neuper@38025
|
1023 |
| T_a2real (Type (s, Ts)) = Type (s, map T_a2real Ts)
|
neuper@38025
|
1024 |
| T_a2real (TFree (s, srt)) =
|
neuper@38037
|
1025 |
if s = "'a" orelse s = "'b" orelse s = "'c" then HOLogic.realT
|
neuper@38037
|
1026 |
else TFree (s, srt)
|
neuper@38037
|
1027 |
| T_a2real (TVar ((s, i), srt)) =
|
neuper@38037
|
1028 |
if s = "'a" orelse s = "'b" orelse s = "'c" then HOLogic.realT
|
neuper@38037
|
1029 |
else TVar ((s, i), srt)
|
neuper@38037
|
1030 |
| T_a2real (TVar (("DUMMY",_), srt)) = HOLogic.realT;
|
neuper@38025
|
1031 |
|
neuper@38025
|
1032 |
(*FIXME .. fixes the type (+see Typefix.thy*)
|
neuper@38025
|
1033 |
fun typ_a2real (Const( s, T)) = (Const( s, T_a2real T))
|
neuper@38025
|
1034 |
| typ_a2real (Free( s, T)) = (Free( s, T_a2real T))
|
neuper@38025
|
1035 |
| typ_a2real (Var( n, T)) = (Var( n, T_a2real T))
|
neuper@38025
|
1036 |
| typ_a2real (Bound i) = (Bound i)
|
neuper@38025
|
1037 |
| typ_a2real (Abs(s,T,t)) = Abs(s, T, typ_a2real t)
|
neuper@38025
|
1038 |
| typ_a2real (t1 $ t2) = (typ_a2real t1) $ (typ_a2real t2);
|
neuper@38025
|
1039 |
|
neuper@38025
|
1040 |
|
neuper@38037
|
1041 |
(* before 2002 *)
|
neuper@38025
|
1042 |
fun parseold thy str =
|
neuper@38025
|
1043 |
(let val t = ((*typ_a2real o*) numbers_to_string)
|
neuper@38025
|
1044 |
(Syntax.read_term_global thy str)
|
neuper@38025
|
1045 |
in SOME (cterm_of thy t) end)
|
neuper@38025
|
1046 |
handle _ => NONE;
|
neuper@38025
|
1047 |
(*2002 fun parseN thy str =
|
neuper@38025
|
1048 |
(let
|
neuper@38025
|
1049 |
val sgn = sign_of thy;
|
neuper@38025
|
1050 |
val t = ((*typ_a2real o app_num_tr'1 o*) term_of)
|
neuper@38025
|
1051 |
(read_cterm sgn (str,(TVar(("DUMMY",0),[]))));
|
neuper@38025
|
1052 |
in SOME (cterm_of sgn t) end)
|
neuper@38025
|
1053 |
handle _ => NONE;*)
|
neuper@38025
|
1054 |
fun parseN thy str =
|
neuper@38025
|
1055 |
(let val t = (*(typ_a2real o numbers_to_string)*)
|
neuper@38025
|
1056 |
(Syntax.read_term_global thy str)
|
neuper@38025
|
1057 |
in SOME (cterm_of thy t) end)
|
neuper@38025
|
1058 |
handle _ => NONE;
|
neuper@38025
|
1059 |
(*2002 fun parse thy str =
|
neuper@38025
|
1060 |
(let
|
neuper@38025
|
1061 |
val sgn = sign_of thy;
|
neuper@38025
|
1062 |
val t = (typ_a2real o app_num_tr'1 o term_of)
|
neuper@38025
|
1063 |
(read_cterm sgn (str,(TVar(("DUMMY",0),[]))));
|
neuper@38025
|
1064 |
in SOME (cterm_of sgn t) end) (*FIXXXXME 10.8.02: return term !!!*)
|
neuper@38025
|
1065 |
handle _ => NONE;*)
|
neuper@38025
|
1066 |
(*2010 fun parse thy str =
|
neuper@38025
|
1067 |
(let val t = (typ_a2real o app_num_tr'1) (Syntax.read_term_global thy str)
|
neuper@38025
|
1068 |
in SOME (cterm_of thy t) end) (*FIXXXXME 10.8.02: return term !!!*)
|
neuper@38025
|
1069 |
handle _ => NONE;*)
|
neuper@38025
|
1070 |
fun parse thy str =
|
neuper@38025
|
1071 |
(let val t = (typ_a2real o numbers_to_string)
|
neuper@38025
|
1072 |
(Syntax.read_term_global thy str)
|
neuper@38025
|
1073 |
in SOME (cterm_of thy t) end) (*FIXXXXME 10.8.02: return term !!!*)
|
neuper@38025
|
1074 |
handle _ => NONE;
|
neuper@38025
|
1075 |
(*
|
neuper@38025
|
1076 |
> val (SOME ct) = parse thy "(-#5)^^^#3";
|
neuper@38025
|
1077 |
> atomty (term_of ct);
|
neuper@38025
|
1078 |
*** -------------
|
neuper@38025
|
1079 |
*** Const ( Nat.op ^, ['a, nat] => 'a)
|
neuper@38025
|
1080 |
*** Const ( uminus, 'a => 'a)
|
neuper@38025
|
1081 |
*** Free ( #5, 'a)
|
neuper@38025
|
1082 |
*** Free ( #3, nat)
|
neuper@38025
|
1083 |
> val (SOME ct) = parse thy "R=R";
|
neuper@38025
|
1084 |
> atomty (term_of ct);
|
neuper@38025
|
1085 |
*** -------------
|
neuper@38025
|
1086 |
*** Const ( op =, [real, real] => bool)
|
neuper@38025
|
1087 |
*** Free ( R, real)
|
neuper@38025
|
1088 |
*** Free ( R, real)
|
neuper@38025
|
1089 |
|
neuper@38025
|
1090 |
THIS IS THE OUTPUT FOR VERSION (3) above at typ_a2real !!!!!
|
neuper@38025
|
1091 |
*** -------------
|
neuper@38025
|
1092 |
*** Const ( op =, [RealDef.real, RealDef.real] => bool)
|
neuper@38025
|
1093 |
*** Free ( R, RealDef.real)
|
neuper@38025
|
1094 |
*** Free ( R, RealDef.real) *)
|
neuper@38025
|
1095 |
|
neuper@41931
|
1096 |
(*WN110317 parseNEW will replace parse after introduction of ctxt completed*)
|
bonzai@41949
|
1097 |
fun parseNEW ctxt str = SOME (Syntax.read_term ctxt str |> numbers_to_string)
|
bonzai@41949
|
1098 |
handle _ => NONE;
|
neuper@41931
|
1099 |
|
neuper@48879
|
1100 |
(* parse term patterns; Var ("v",_), i.e. "?v", are required for instantiation
|
neuper@48879
|
1101 |
WN130613 probably compare to
|
neuper@48879
|
1102 |
http://www.mail-archive.com/isabelle-dev@mailbroy.informatik.tu-muenchen.de/msg04249.html*)
|
neuper@38037
|
1103 |
fun parse_patt thy str = (thy, str) |>> thy2ctxt
|
neuper@48761
|
1104 |
|-> Proof_Context.read_term_pattern
|
neuper@41931
|
1105 |
|> numbers_to_string (*TODO drop*)
|
neuper@41931
|
1106 |
|> typ_a2real; (*TODO drop*)
|
neuper@38025
|
1107 |
|
neuper@38025
|
1108 |
(*version for testing local to theories*)
|
neuper@38025
|
1109 |
fun str2term_ thy str = (term_of o the o (parse thy)) str;
|
neuper@42017
|
1110 |
(*WN110520
|
neuper@42017
|
1111 |
fun str2term str = (term_of o the o (parse (Thy_Info.get_theory "Isac"))) str;*)
|
neuper@42017
|
1112 |
fun str2term str = parse_patt (Thy_Info.get_theory "Isac") str
|
neuper@38025
|
1113 |
fun strs2terms ss = map str2term ss;
|
neuper@40836
|
1114 |
fun str2termN str = (term_of o the o (parseN (Thy_Info.get_theory "Isac"))) str;
|
neuper@38025
|
1115 |
|
neuper@38025
|
1116 |
(*+ makes a substitution from the output of Pattern.match +*)
|
neuper@38025
|
1117 |
(*fun mk_subs ((id, _):indexname, t:term) = (Free (id,type_of t), t);*)
|
neuper@38025
|
1118 |
fun mk_subs (subs: ((string * int) * (Term.typ * Term.term)) list) =
|
neuper@38025
|
1119 |
let fun mk_sub ((id, _), (ty, tm)) = (Free (id, ty), tm) in
|
neuper@38025
|
1120 |
map mk_sub subs end;
|
neuper@38025
|
1121 |
|
neuper@38025
|
1122 |
val atomthm = atomt o #prop o rep_thm;
|
neuper@38025
|
1123 |
|
neuper@38025
|
1124 |
(*.instantiate #prop thm with bound variables (as Free).*)
|
neuper@38025
|
1125 |
fun inst_bdv [] t = t : term
|
neuper@38025
|
1126 |
| inst_bdv (instl: (term*term) list) t =
|
neuper@38025
|
1127 |
let fun subst (v as Var((s,_),T)) =
|
neuper@40836
|
1128 |
(case Symbol.explode s of
|
neuper@38025
|
1129 |
"b"::"d"::"v"::_ =>
|
neuper@38025
|
1130 |
if_none (assoc(instl,Free(s,T))) (Free(s,T))
|
neuper@38025
|
1131 |
| _ => v)
|
neuper@38025
|
1132 |
| subst (Abs(a,T,body)) = Abs(a, T, subst body)
|
neuper@38025
|
1133 |
| subst (f$t') = subst f $ subst t'
|
neuper@38025
|
1134 |
| subst t = if_none (assoc(instl,t)) t
|
neuper@38025
|
1135 |
in subst t end;
|
neuper@38025
|
1136 |
|
neuper@38025
|
1137 |
|
neuper@38025
|
1138 |
(*WN050829 caution: is_atom (str2term"q_0/2 * L * x") = true !!!
|
neuper@38025
|
1139 |
use length (vars term) = 1 instead*)
|
neuper@38025
|
1140 |
fun is_atom (Const ("Float.Float",_) $ _) = true
|
neuper@38025
|
1141 |
| is_atom (Const ("ComplexI.I'_'_",_)) = true
|
neuper@38034
|
1142 |
| is_atom (Const ("Groups.times_class.times",_) $ t $ Const ("ComplexI.I'_'_",_)) = is_atom t
|
neuper@38025
|
1143 |
| is_atom (Const ("Groups.plus_class.plus",_) $ t1 $ Const ("ComplexI.I'_'_",_)) = is_atom t1
|
neuper@38025
|
1144 |
| is_atom (Const ("Groups.plus_class.plus",_) $ t1 $
|
neuper@38034
|
1145 |
(Const ("Groups.times_class.times",_) $ t2 $ Const ("ComplexI.I'_'_",_))) =
|
neuper@38025
|
1146 |
is_atom t1 andalso is_atom t2
|
neuper@38025
|
1147 |
| is_atom (Const _) = true
|
neuper@38025
|
1148 |
| is_atom (Free _) = true
|
neuper@38025
|
1149 |
| is_atom (Var _) = true
|
neuper@38025
|
1150 |
| is_atom _ = false;
|
neuper@38025
|
1151 |
(* val t = str2term "q_0/2 * L * x";
|
neuper@38025
|
1152 |
|
neuper@38025
|
1153 |
|
neuper@38025
|
1154 |
*)
|
neuper@38025
|
1155 |
(*val t = str2term "Float ((1,2),(0,0))";
|
neuper@38025
|
1156 |
> is_atom t;
|
neuper@38025
|
1157 |
val it = true : bool
|
neuper@38025
|
1158 |
> val t = str2term "Float ((1,2),(0,0)) * I__";
|
neuper@38025
|
1159 |
> is_atom t;
|
neuper@38025
|
1160 |
val it = true : bool
|
neuper@38025
|
1161 |
> val t = str2term "Float ((1,2),(0,0)) + Float ((3,4),(0,0)) * I__";
|
neuper@38025
|
1162 |
> is_atom t;
|
neuper@38025
|
1163 |
val it = true : bool
|
neuper@38025
|
1164 |
> val t = str2term "1 + 2*I__";
|
neuper@38034
|
1165 |
> val Const ("Groups.plus_class.plus",_) $ t1 $ (Const ("Groups.times_class.times",_) $ t2 $ Const ("ComplexI.I'_'_",_)) = t;
|
neuper@38025
|
1166 |
*)
|
neuper@38025
|
1167 |
|
neuper@38025
|
1168 |
(*.adaption from Isabelle/src/Pure/term.ML; reports if ALL Free's
|
neuper@38025
|
1169 |
have found a substitution (required for evaluating the preconditions
|
neuper@38025
|
1170 |
of _incomplete_ models).*)
|
neuper@38025
|
1171 |
fun subst_atomic_all [] t = (false, (*TODO may be 'true' for some terms ?*)
|
neuper@38025
|
1172 |
t : term)
|
neuper@38025
|
1173 |
| subst_atomic_all (instl: (term*term) list) t =
|
neuper@38025
|
1174 |
let fun subst (Abs(a,T,body)) =
|
neuper@38025
|
1175 |
let val (all, body') = subst body
|
neuper@38025
|
1176 |
in (all, Abs(a, T, body')) end
|
neuper@38025
|
1177 |
| subst (f$tt) =
|
neuper@38025
|
1178 |
let val (all1, f') = subst f
|
neuper@38025
|
1179 |
val (all2, tt') = subst tt
|
neuper@38025
|
1180 |
in (all1 andalso all2, f' $ tt') end
|
neuper@38025
|
1181 |
| subst (t as Free _) =
|
neuper@38025
|
1182 |
if is_num t then (true, t) (*numerals cannot be subst*)
|
neuper@38025
|
1183 |
else (case assoc(instl,t) of
|
neuper@38025
|
1184 |
SOME t' => (true, t')
|
neuper@38025
|
1185 |
| NONE => (false, t))
|
neuper@38025
|
1186 |
| subst t = (true, if_none (assoc(instl,t)) t)
|
neuper@38025
|
1187 |
in subst t end;
|
neuper@38025
|
1188 |
|
neuper@38025
|
1189 |
(*.add two terms with a type given.*)
|
neuper@38025
|
1190 |
fun mk_add t1 t2 =
|
neuper@38025
|
1191 |
let val T1 = type_of t1
|
neuper@38025
|
1192 |
val T2 = type_of t2
|
neuper@38025
|
1193 |
in if T1 <> T2 then raise TYPE ("mk_add gets ",[T1, T2],[t1,t2])
|
neuper@38025
|
1194 |
else (Const ("Groups.plus_class.plus", [T1, T2] ---> T1) $ t1 $ t2)
|
neuper@38025
|
1195 |
end;
|