more antiquotations for Isabelle/HOL consts/types, without change of semantics;
1 (* Title: extends Isabelle/src/Pure/term.ML
2 Author: Walther Neuper 1999, Mathias Lehnfeld
3 (c) due to copyright terms
7 (* TERM_C extends Isabelle's naming conventions: "C" indicates Isac add-ons to an Isabelle module *)
14 datatype lrd = D | L | R
16 val string_of_path: path -> string
17 val sub_at: path -> term -> term
18 val go_up: path -> term -> term
20 val contains_Var: term -> bool
21 val dest_binop_typ: typ -> typ * typ * typ
22 val dest_equals: term -> term * term
23 val free2str: term -> string
24 val ids2str: term -> string list
25 val ins_concl: term -> term -> term
26 val inst_abs: term -> term
27 val inst_bdv: (term * term) list -> term -> term
29 val term_of_num: typ -> int -> term
30 val num_of_term: term -> int
31 val int_of_str: string -> int
32 val isastr_of_int: int -> string
33 val int_opt_of_string: string -> int option (* belongs to TermC *)
35 val isalist2list: term -> term list
36 val list2isalist: typ -> term list -> term
37 val isapair2pair: term -> term * term (* rename to dest_pair, compare HOLogic.dest_string *)
39 val is_atom: term -> bool
40 val is_const: term -> bool
41 val is_variable: term -> bool
42 val is_bdv: string -> bool
43 val is_bdv_subst: term -> bool
44 val guess_bdv_typ: term -> typ
45 val is_equality: term -> bool
46 val is_expliceq: term -> bool
47 val is_f_x: term -> bool
48 val is_list: term -> bool
49 val is_bool_list: term -> bool
50 val dest_listT: typ -> typ
51 val is_num: term -> bool
52 val is_num': string -> bool
53 val variable_constant_pair: term * term -> bool
55 val mk_add: term -> term -> term
56 val mk_free: typ -> string -> term
57 val mk_equality: term * term -> term
58 val mk_factroot: string -> typ -> int -> int -> term
59 val mk_Free: string * typ -> term
60 val mk_thmid: string -> string -> string -> string
61 val mk_num_op_num: typ -> typ -> string * typ -> int -> int -> term
62 val mk_num_op_var: term -> string -> typ -> typ -> int -> term
63 val mk_var_op_num: term -> string -> typ -> typ -> int -> term
65 val matches: theory -> term -> term -> bool
66 val parse_strict: theory -> string -> term
67 val parse: theory -> string -> cterm option
68 val parseN: theory -> string -> cterm option
69 val parseNEW: Proof.context -> string -> term option
70 val parseNEW': Proof.context -> string -> term
71 val parseNEW'': theory -> string -> term
72 val parseold: theory -> string -> cterm option
73 val parse_patt: theory -> string -> term
74 val perm: term -> term -> bool
76 val str_of_free_opt: term -> string option
77 val str_of_int: int -> string
78 val str2term: string -> term
79 val strip_imp_prems': term -> term option
80 val subst_atomic_all: (term * term) list -> term -> bool * term
81 val term_detail2str: term -> string
83 val pairt: term -> term -> term
84 val pairT: typ -> typ -> typ
85 val raise_type_conflicts: term list -> unit
86 val strip_trueprop: term -> term
88 val numbers_to_string: term -> term
89 val uminus_to_string: term -> term
91 val var2free: term -> term
92 val vars: term -> term list (* recognises numerals, should replace "fun vars_of" *)
93 val vars': term list -> term list
94 val vars_of: term -> term list (* deprecated *)
95 val dest_list': term -> term list
96 val negates: term -> term -> bool
99 val scala_of_term: term -> string
100 val atomtyp(*<-- atom_typ TODO*): typ -> unit
101 val atomty: term -> unit
102 val atomw: term -> unit
103 val atomt: term -> unit
104 val atomwy: term -> unit
105 val atomty_thy: ThyC.id -> term -> unit
106 val free2var: term -> term
107 val typ_a2real: term -> term
109 val contains_one_of: thm * (string * typ) list -> bool
110 val contains_Const_typeless: term list -> term -> bool
111 (*----- unused code, kept as hints to design ideas ---------------------------------------------*)
112 val sym_trm : term -> term
116 structure TermC(**): TERM_ISAC(**) =
120 type as_string = UnparseC.term_as_string
121 val empty = UnparseC.term_empty
122 val typ_empty = UnparseC.typ_empty
124 datatype lrd = L (*t1 in "t1$t2"*)
125 | R (*t2 in "t1$t2"*) | D; (*b in Abs(_,_,b*)
126 type path = lrd list;
130 fun string_of_path k = (strs2str' o (map ldr2str)) k;
131 (*go to a location in a term and fetch the resective sub-term*)
133 | sub_at (D :: p) (Abs(_, _, body)) = sub_at p body
134 | sub_at (L :: p) (t1 $ _) = sub_at p t1
135 | sub_at (R :: p) (_ $ t2) = sub_at p t2
136 | sub_at l t = raise TERM ("sub_at: no " ^ string_of_path l ^ " for ", [t]);
138 if length l > 1 then sub_at (drop_last l) t else raise ERROR ("go_up [] " ^ UnparseC.term t)
140 fun isastr_of_int i = if i >= 0 then string_of_int i else "-" ^ string_of_int (abs i)
142 fun matches thy tm pa =
143 (Pattern.match thy (pa, tm) (Vartab.empty, Vartab.empty); true)
144 handle Pattern.MATCH => false
146 (** transform typ / term to a String to be parsed by Scala after transport via libisabelle **)
149 fun scala_of_typ (Type (s, typs)) =
150 enclose "Type(" ")" (quote s ^ ", " ^
151 (typs |> map scala_of_typ |> commas |> enclose "List(" ")"))
152 | scala_of_typ (TFree (s, sort)) =
153 enclose "TFree(" ")" (quote s ^ ", " ^ (sort |> map quote |> commas |> enclose "List(" ")"))
154 | scala_of_typ (TVar ((s, i), sort)) =
155 enclose "TVar(" ")" (
156 enclose "(" ")," (quote s ^ ", " ^ quote (string_of_int i)) ^
157 (sort |> map quote |> commas |> enclose "List(" ")"))
159 fun scala_of_term (Const (s, T)) =
160 enclose "Const(" ")" (quote s ^ ", " ^ scala_of_typ T)
161 | scala_of_term (Free (s, T)) =
162 enclose "Free(" ")" (quote s ^ ", " ^ scala_of_typ T)
163 | scala_of_term (Var ((s, i), T)) =
164 enclose "TVar(" ")" (
165 enclose "(" ")," (quote s ^ ", " ^ quote (string_of_int i)) ^
167 | scala_of_term (Bound i) = enclose "Bound(" ")" (string_of_int i)
168 | scala_of_term (Abs (s, T, t)) =
171 scala_of_typ T ^ ", " ^
173 | scala_of_term (t1 $ t2) =
174 enclose "App(" ")" (scala_of_term t1 ^ ", " ^ scala_of_term t2)
176 (* see structure's bare bones.
177 for Isabelle standard output compare 2017 "structure ML_PP" *)
180 fun ato n (Type (s, [])) = "\n*** " ^ indent n ^ "Type (" ^ s ^",[])"
181 | ato n (Type (s, Ts)) = "\n*** " ^ indent n ^ "Type (" ^ s ^ ",[" ^ atol (n + 1) Ts
182 | ato n (TFree (s, sort)) = "\n*** " ^ indent n ^ "TFree (" ^ s ^ ", " ^ strs2str' sort
183 | ato n (TVar ((s, i), sort)) =
184 "\n*** " ^ indent n ^ "TVar ((" ^ s ^ ", " ^ string_of_int i ^ strs2str' sort
185 and atol n [] = "\n*** " ^ indent n ^ "]"
186 | atol n (T :: Ts) = (ato n T ^ atol n Ts)
187 in tracing (ato 0 t ^ "\n") end;
190 fun ato (Const (a, _)) n = "\n*** " ^ indent n ^ "Const (" ^ a ^ ", _)"
191 | ato (Free (a, _)) n = "\n*** " ^ indent n ^ "Free (" ^ a ^ ", _)"
192 | ato (Var ((a, i), _)) n =
193 "\n*** " ^ indent n ^ "Var (" ^ a ^ ", " ^ string_of_int i ^ "), _)"
194 | ato (Bound i) n = "\n*** " ^ indent n ^ "Bound " ^ string_of_int i
195 | ato (Abs (a, _, body)) n = "\n*** " ^ indent n ^ "Abs(" ^ a ^ ", _" ^ ato body (n+1)
196 | ato (f $ t) n = (ato f n ^ ato t (n + 1))
198 fun atomw t = writeln ("\n*** -------------" ^ ato t 0 ^ "\n***");
199 fun atomt t = tracing ("\n*** -------------" ^ ato t 0 ^ "\n***");
203 fun term_detail2str t =
205 fun ato (Const (a, T)) n = "\n*** " ^ indent n ^ "Const (" ^ a ^ ", " ^ UnparseC.typ T ^ ")"
206 | ato (Free (a, T)) n = "\n*** " ^ indent n ^ "Free (" ^ a ^ ", " ^ UnparseC.typ T ^ ")"
207 | ato (Var ((a, i), T)) n =
208 "\n*** " ^ indent n ^ "Var ((" ^ a ^ ", " ^ string_of_int i ^ "), " ^ UnparseC.typ T ^ ")"
209 | ato (Bound i) n = "\n*** " ^ indent n ^ "Bound " ^ string_of_int i
210 | ato (Abs(a, T, body)) n =
211 "\n*** " ^ indent n ^ "Abs (" ^ a ^ ", " ^ UnparseC.typ T ^ ",.." ^ ato body (n + 1)
212 | ato (f $ t) n = ato f n ^ ato t (n + 1)
213 in "\n*** " ^ ato t 0 ^ "\n***" end;
216 fun term_detail2str_thy thy t =
218 fun ato (Const (a, T)) n =
219 "\n*** " ^ indent n ^ "Const (" ^ a ^ ", " ^ UnparseC.typ_by_thyID thy T ^ ")"
220 | ato (Free (a, T)) n =
221 "\n*** " ^ indent n ^ "Free (" ^ a ^ ", " ^ UnparseC.typ_by_thyID thy T ^ ")"
222 | ato (Var ((a, i), T)) n =
223 "\n*** " ^ indent n ^ "Var ((" ^ a ^ ", " ^ string_of_int i ^ "), " ^
224 UnparseC.typ_by_thyID thy T ^ ")"
226 "\n*** " ^ indent n ^ "Bound " ^ string_of_int i
227 | ato (Abs(a, T, body)) n =
228 "\n*** " ^ indent n ^ "Abs (" ^ a ^ ", " ^ UnparseC.typ_by_thyID thy T ^ ",.." ^
230 | ato (f $ t) n = ato f n ^ ato t (n + 1)
231 in "\n*** " ^ ato t 0 ^ "\n***" end;
232 fun atomwy t = (writeln o term_detail2str) t;
233 fun atomty t = (tracing o term_detail2str) t;
234 fun atomty_thy thy t = (tracing o (term_detail2str_thy thy)) t;
237 (* contains the term a VAR(("*",_),_) ? *)
238 fun contains_Var (Abs(_,_,body)) = contains_Var body
239 | contains_Var (f $ f') = contains_Var f orelse contains_Var f'
240 | contains_Var (Var _) = true
241 | contains_Var _ = false;
244 if n < 0 then "-" ^ ((string_of_int o abs) n)
245 else string_of_int n;
246 val int_of_str = Value.parse_int;
248 val int_opt_of_string = ThmC_Def.int_opt_of_string
250 fun is_num' str = case int_opt_of_string str of SOME _ => true | NONE => false;
251 fun is_num (Free (s, _)) = if is_num' s then true else false | is_num _ = false;
252 fun term_of_num ntyp n = Free (str_of_int n, ntyp);
253 fun num_of_term (t as (Free (istr, _))) =
254 (case int_opt_of_string istr of SOME i => i | NONE => raise TERM ("num_of_term: NOT int ", [t]))
255 | num_of_term t = raise TERM ("num_of_term: NOT Free ", [t])
257 fun is_const (Const _) = true | is_const _ = false;
258 fun is_variable (t as Free _) = not (is_num t)
259 | is_variable _ = false;
260 fun is_Free (Free _) = true | is_Free _ = false;
261 fun is_fun_id (Const _) = true
262 | is_fun_id (Free _) = true
263 | is_fun_id _ = false;
264 fun is_f_x (f $ x) = is_fun_id f andalso is_Free x
266 (* precondition: TermC.is_atom v andalso TermC.is_atom c *)
267 fun variable_constant_pair (v, c) =
268 if (is_variable v andalso (is_const c orelse is_num c)) orelse
269 (is_variable c andalso (is_const v orelse is_num v))
275 fun scan vs (Const _) = vs
276 | scan vs (t as Free (s, _)) = if is_num' s then vs else t :: vs
277 | scan vs (t as Var _) = t :: vs
278 | scan vs (Bound _) = vs
279 | scan vs (Abs (_, _, t)) = scan vs t
280 | scan vs (t1 $ t2) = (scan vs t1) @ (scan vs t2)
281 in ((distinct op =) o (scan [])) t end;
282 fun vars' ts = ts |> map vars |> flat |> distinct op =
284 (* bypass Isabelle's Pretty, which requires ctxt *)
287 fun scan vs (Const (s, _)) = if is_num' s then vs else s :: vs
288 | scan vs (Free (s, _)) = if is_num' s then vs else s :: vs
289 | scan vs (Var ((s, i), _)) = (s ^ "_" ^ string_of_int i) :: vs
290 | scan vs (Bound _) = vs
291 | scan vs (Abs (s, _, t)) = scan (s :: vs) t
292 | scan vs (t1 $ t2) = (scan vs t1) @ (scan vs t2)
293 in ((distinct op =) o (scan [])) t end;
294 fun is_bdv str = case Symbol.explode str of "b"::"d"::"v"::_ => true | _ => false;
295 (* instantiate #prop thm with bound variables (as Free) *)
296 fun inst_bdv [] t = t
297 | inst_bdv (instl: (term*term) list) t =
299 fun subst (v as Var((s, _), T)) =
300 (case Symbol.explode s of
301 "b"::"d"::"v"::_ => if_none (assoc(instl,Free(s,T))) (Free(s,T))
303 | subst (Abs(a, T, body)) = Abs(a, T, subst body)
304 | subst (f $ t') = subst f $ subst t'
305 | subst t = if_none (assoc (instl, t)) t
308 (* is a term a substitution for a bdv as found in programs and tactics *)
309 fun is_bdv_subst (Const (\<^const_name>\<open>Cons\<close>, _) $
310 (Const (\<^const_name>\<open>Pair\<close>, _) $ str $ _) $ _) = is_bdv (HOLogic.dest_string str)
311 | is_bdv_subst _ = false;
313 (* this shall be improved due to future requirements *)
314 fun guess_bdv_typ t = t |> vars |> hd |> type_of
316 fun free2str (Free (s, _)) = s
317 | free2str t = raise ERROR ("free2str not for " ^ UnparseC.term t);
318 fun str_of_free_opt (Free (s, _)) = SOME s
319 | str_of_free_opt _ = NONE
321 (* compare Logic.unvarify_global, which rejects Free *)
322 fun var2free (t as Const _) = t
323 | var2free (t as Free _) = t
324 | var2free (Var((s, _), T)) = Free (s,T)
325 | var2free (t as Bound _) = t
326 | var2free (Abs(s, T, t)) = Abs(s, T, var2free t)
327 | var2free (t1 $ t2) = (var2free t1) $ (var2free t2);
330 (* Logic.varify does NOT take care of 'Free ("1", _)'*)
331 fun free2var (t as Const _) = t
332 | free2var (t as Free (s, T)) = if is_num' s then t else Var ((s, 0), T)
333 | free2var (t as Var _) = t
334 | free2var (t as Bound _) = t
335 | free2var (Abs (s, T, t)) = Abs (s, T, free2var t)
336 | free2var (t1 $ t2) = (free2var t1) $ (free2var t2);
339 fun mk_listT T = Type (\<^type_name>\<open>list\<close>, [T]);
340 fun list_const T = Const (\<^const_name>\<open>Cons\<close>, [T, mk_listT T] ---> mk_listT T);
341 fun list2isalist T [] = Const (\<^const_name>\<open>Nil\<close>, mk_listT T)
342 | list2isalist T (t :: ts) = (list_const T) $ t $ (list2isalist T ts);
344 fun isapair2pair (Const (\<^const_name>\<open>Pair\<close>,_) $ a $ b) = (a, b)
346 raise ERROR ("isapair2pair called with " ^ UnparseC.term t);
347 fun isalist2list ls =
349 fun get es (Const(\<^const_name>\<open>Cons\<close>, _) $ t $ ls) = get (t :: es) ls
350 | get es (Const(\<^const_name>\<open>Nil\<close>, _)) = es
351 | get _ t = raise TERM ("isalist2list applied to NON-list: ", [t])
352 in (rev o (get [])) ls end;
354 fun is_list ((Const (\<^const_name>\<open>Cons\<close>, _)) $ _ $ _) = true
356 fun dest_listT (Type (\<^type_name>\<open>list\<close>, [T])) = T
357 | dest_listT T = raise TYPE ("dest_listT: list type expected", [T], []);
359 (if dest_listT (Term.type_of t) = HOLogic.boolT then true else false)
360 handle TYPE _ => false
363 fun dest_binop_typ (Type (\<^type_name>\<open>fun\<close>, [range, Type (\<^type_name>\<open>fun\<close>, [arg2, arg1])])) = (arg1, arg2, range)
364 | dest_binop_typ _ = raise ERROR "dest_binop_typ: not binary";
365 fun dest_equals (Const(\<^const_name>\<open>HOL.eq\<close>, _) $ t $ u) = (t, u) (* Pure/logic.ML: Const ("==", ..*)
366 | dest_equals t = raise TERM ("dest_equals'", [t]);
367 fun is_equality (Const(\<^const_name>\<open>HOL.eq\<close>,_) $ _ $ _) = true (* logic.ML: Const("=="*)
368 | is_equality _ = false;
369 fun mk_equality (t, u) = (Const(\<^const_name>\<open>HOL.eq\<close>, [type_of t, type_of u] ---> HOLogic.boolT) $ t $ u);
370 fun is_expliceq (Const(\<^const_name>\<open>HOL.eq\<close>,_) $ (Free _) $ _) = true
371 | is_expliceq _ = false;
372 fun strip_trueprop (Const (\<^const_name>\<open>Trueprop\<close>, _) $ t) = t
373 | strip_trueprop t = t;
375 (* (A1==>...An==>B) goes to (A1==>...An==>) Pure/logic.ML: term -> term list*)
376 fun strip_imp_prems' (Const (\<^const_name>\<open>Pure.imp\<close>, _) $ A $ t) =
378 fun coll_prems As (Const(\<^const_name>\<open>Pure.imp\<close>, _) $ A $ t) =
379 coll_prems (As $ (Logic.implies $ A)) t
380 | coll_prems As _ = SOME As
381 in coll_prems (Logic.implies $ A) t end
382 | strip_imp_prems' _ = NONE; (* *)
384 (* (A1==>...An==>) (B) goes to (A1==>...An==>B), where B is lowest branch, 2002 Pure/thm.ML *)
385 fun ins_concl (Const (\<^const_name>\<open>Pure.imp\<close>, _) $ A $ t) B = Logic.implies $ A $ (ins_concl t B)
386 | ins_concl (Const (\<^const_name>\<open>Pure.imp\<close>, _) $ A ) B = Logic.implies $ A $ B
387 | ins_concl t B = raise TERM ("ins_concl", [t, B]);
389 fun vperm (Var _, Var _) = true (* 2002 Pure/thm.ML *)
390 | vperm (Abs (_, _, s), Abs (_, _, t)) = vperm (s, t)
391 | vperm (t1 $ t2, u1 $ u2) = vperm (t1, u1) andalso vperm (t2, u2)
392 | vperm (t, u) = (t = u);
394 (*2002 cp from Pure/term.ML --- since 2009 in Pure/old_term.ML*)
395 fun mem_term (_, []) = false
396 | mem_term (t, t' :: ts) = t aconv t' orelse mem_term (t, ts);
397 fun subset_term ([], _) = true
398 | subset_term (x :: xs, ys) = mem_term (x, ys) andalso subset_term (xs, ys);
399 fun eq_set_term (xs, ys) =
400 xs = ys orelse (subset_term (xs, ys) andalso subset_term (ys, xs));
401 (*a total, irreflexive ordering on index names*)
402 fun xless ((a, i), (b, j): indexname) = i<j orelse (i = j andalso a < b);
403 (*a partial ordering (not reflexive) for atomic terms*)
404 fun atless (Const (a, _), Const (b, _)) = a < b
405 | atless (Free (a, _), Free (b, _)) = a < b
406 | atless (Var (v, _), Var (w, _)) = xless (v, w)
407 | atless (Bound i, Bound j) = i < j
409 (*insert atomic term into partially sorted list, suppressing duplicates (?)*)
410 fun insert_aterm (t,us) =
411 let fun inserta [] = [t]
412 | inserta (us as u::us') =
413 if atless(t,u) then t::us
414 else if t=u then us (*duplicate*)
415 else u :: inserta us'
418 (* Accumulates the Vars in the term, suppressing duplicates *)
419 fun add_term_vars (t, vars: term list) = case t of
420 Var _ => insert_aterm (t, vars)
421 | Abs (_, _, body) => add_term_vars (body, vars)
422 | f$t => add_term_vars (f, add_term_vars (t, vars))
424 fun term_vars t = add_term_vars (t, []);
426 (*2002 Pure/thm.ML *)
427 fun var_perm (t, u) = vperm (t, u) andalso eq_set_term (term_vars t, term_vars u);
428 (*2002 fun decomp_simp, Pure/thm.ML *)
429 fun perm lhs rhs = var_perm (lhs, rhs) andalso not (lhs aconv rhs) andalso not (is_Var lhs);
432 fun pairT T1 T2 = Type ("*", [T1, T2]);
433 fun PairT T1 T2 = ([T1, T2] ---> Type ("*", [T1, T2]));
434 fun pairt t1 t2 = Const (\<^const_name>\<open>Pair\<close>, PairT (type_of t1) (type_of t2)) $ t1 $ t2;
436 fun mk_factroot op_(*=thy.sqrt*) T fact root =
437 Const (\<^const_name>\<open>times\<close>, [T, T] ---> T) $ (term_of_num T fact) $
438 (Const (op_, T --> T) $ term_of_num T root);
439 fun mk_var_op_num v op_ optype ntyp n = Const (op_, optype) $ v $ Free (str_of_int n, ntyp);
440 fun mk_num_op_var v op_ optype ntyp n = Const (op_, optype) $ Free (str_of_int n, ntyp) $ v;
441 fun mk_num_op_num T1 T2 (op_, Top) n1 n2 =
442 Const (op_, Top) $ Free (str_of_int n1, T1) $ Free (str_of_int n2, T2);
443 fun mk_thmid thmid n1 n2 =
444 thmid ^ (strip_thy n1) ^ "_" ^ (strip_thy n2);
447 val (T1, T2) = (type_of t1, type_of t2)
449 if T1 <> T2 then raise TYPE ("mk_add gets ", [T1, T2], [t1,t2])
450 else (Const (\<^const_name>\<open>plus\<close>, [T1, T2] ---> T1) $ t1 $ t2)
453 (** transform binary numeralsstrings **)
454 val numbers_to_string = ThmC_Def.num_to_Free
455 val uminus_to_string = ThmC_Def.uminus_to_string
457 fun mk_Free (s,T) = Free (s, T);
458 fun mk_free T s = Free (s, T);
460 (*Special case: one argument cp from Isabelle2002/src/Pure/term.ML*)
461 fun subst_bound (arg, t) =
463 fun subst (t as Bound i, lev) =
464 if i < lev then t (*var is locally bound*)
465 else if i = lev then incr_boundvars lev arg
466 else Bound (i - 1) (*loose: change it*)
467 | subst (Abs(a, T, body), lev) = Abs (a, T, subst (body, lev + 1))
468 | subst (f$t, lev) = subst(f, lev) $ subst(t, lev)
472 (* instantiate let; necessary for scan_up1 *)
473 fun inst_abs (Const sT) = Const sT
474 | inst_abs (Free sT) = Free sT
475 | inst_abs (Bound n) = Bound n
476 | inst_abs (Var iT) = Var iT
477 | inst_abs (Const (\<^const_name>\<open>Let\<close>,T1) $ e $ (Abs (v, T2, b))) =
478 let val b' = subst_bound (Free (v, T2), b); (*fun variant_abs: term.ML*)
479 in Const (\<^const_name>\<open>Let\<close>, T1) $ inst_abs e $ (Abs (v, T2, inst_abs b')) end
480 | inst_abs (t1 $ t2) = inst_abs t1 $ inst_abs t2
483 (* for parse and parse_patt: fix all types to real *)
484 fun T_a2real (Type (s, [])) =
485 if s = "'a" orelse s = "'b" orelse s = "'c" then HOLogic.realT else Type (s, [])
486 | T_a2real (Type (s, Ts)) = Type (s, map T_a2real Ts)
487 | T_a2real (TFree (s, srt)) =
488 if s = "'a" orelse s = "'b" orelse s = "'c" then HOLogic.realT else TFree (s, srt)
489 | T_a2real (TVar (("DUMMY", _), _)) = HOLogic.realT
490 | T_a2real (TVar ((s, i), srt)) =
491 if s = "'a" orelse s = "'b" orelse s = "'c" then HOLogic.realT else TVar ((s, i), srt)
492 fun typ_a2real (Const( s, T)) = (Const( s, T_a2real T))
493 | typ_a2real (Free( s, T)) = (Free( s, T_a2real T))
494 | typ_a2real (Var( n, T)) = (Var( n, T_a2real T))
495 | typ_a2real (Bound i) = (Bound i)
496 | typ_a2real (Abs(s,T,t)) = Abs(s, T, typ_a2real t)
497 | typ_a2real (t1 $ t2) = (typ_a2real t1) $ (typ_a2real t2);
499 (* TODO clarify parse with Test_Isac *)
500 fun parseold thy str = (* before 2002 *)
502 let val t = ((*typ_a2real o*) numbers_to_string) (Syntax.read_term_global thy str)
503 in Thm.global_cterm_of thy t end\<close>;
504 fun parseN thy str = (* introduced 2002 *)
506 let val t = (*(typ_a2real o numbers_to_string)*) (Syntax.read_term_global thy str)
507 in Thm.global_cterm_of thy t end\<close>;
509 fun parse_strict thy str = (typ_a2real o numbers_to_string) (Syntax.read_term_global thy str);
510 fun parse thy str = (* introduced 2010 *)
512 let val t = parse_strict thy str
513 in Thm.global_cterm_of thy t end\<close>;
515 (*WN110317 parseNEW will replace parse after introduction of ctxt completed*)
516 fun parseNEW ctxt str = \<^try>\<open>Syntax.read_term ctxt str |> numbers_to_string\<close>;
517 fun parseNEW' ctxt str =
518 case parseNEW ctxt str of
520 | NONE => raise TERM ("NO parseNEW' for " ^ str, [])
521 fun parseNEW'' thy str =
522 case parseNEW (ThyC.to_ctxt thy) str of
524 | NONE => raise TERM ("NO parseNEW'' for " ^ str, [])
526 (* parse term patterns; Var ("v",_), i.e. "?v", are required for instantiation
527 WN130613 probably compare to
528 http://www.mail-archive.com/isabelle-dev@mailbroy.informatik.tu-muenchen.de/msg04249.html*)
529 fun parse_patt thy str = (thy, str)
531 |-> Proof_Context.read_term_pattern
532 |> numbers_to_string (*TODO drop*)
533 |> typ_a2real; (*TODO drop*)
534 fun str2term str = parse_patt (ThyC.get_theory "Isac_Knowledge") str
536 fun is_atom (Const ("Float.Float",_) $ _) = true
537 | is_atom (Const _) = true
538 | is_atom (Free _) = true
539 | is_atom (Var _) = true
542 (* from Pure/term.ML; reports if ALL Free's have found a substitution
543 (required for evaluating the preconditions of _incomplete_ models) *)
544 fun subst_atomic_all [] t = (false (*TODO may be 'true' for some terms ?*), t)
545 | subst_atomic_all instl t =
547 fun subst (Abs (a, T, body)) =
549 val (all, body') = subst body
550 in (all, Abs(a, T, body')) end
553 val (all1, f') = subst f
554 val (all2, tt') = subst tt
555 in (all1 andalso all2, f' $ tt') end
556 | subst (t as Free _) =
557 if is_num t then (true, t) (*numerals cannot be subst*)
558 else (case assoc (instl, t) of
559 SOME t' => (true, t')
560 | NONE => (false, t))
561 | subst t = (true, if_none (assoc(instl,t)) t)
564 fun op contains_one_of (thm, ids) =
565 Term.exists_Const (fn id => member op= ids id) (Thm.prop_of thm)
567 fun var_for vs (t as Const (str, _)) id = if id = strip_thy str then t :: vs else vs
568 | var_for vs (t as Free (str, _)) id = if id = str then t :: vs else vs
569 | var_for vs (t as Var (idn, _)) id = if id = Term.string_of_vname idn then t :: vs else vs
570 | var_for vs (Bound _) _ = vs
571 | var_for vs (Abs (_, _, t)) id = var_for vs t id
572 | var_for vs (t1 $ t2) id = (var_for vs t1 id) @ (var_for vs t2 id)
574 val poly_consts = (* TODO: adopt syntax-const from Isabelle*)
575 [\<^const_name>\<open>plus\<close>, \<^const_name>\<open>minus\<close>,
576 \<^const_name>\<open>divide\<close>, \<^const_name>\<open>times\<close>,
577 \<^const_name>\<open>powr\<close>];
578 (* treat Free, Const, Var as variables in polynomials *)
581 val var_ids = t |> ids2str |> subtract op = poly_consts |> map strip_thy |> sort string_ord
582 in (map (var_for [] t) var_ids) |> flat |> distinct op = end
584 (* this may decompose an object-language isa-list;
585 use only, if description is not available, eg. not input ?WN:14.5.03 ??!?*)
586 fun dest_list' t = if is_list t then isalist2list t else [t];
588 fun negat (Const (\<^const_name>\<open>Not\<close>, _) $ P, P') = P = P'
590 fun negates p1 p2 = negat (p1, p2) orelse negat (swap (p1, p2));
592 fun raise_type_conflicts ts =
594 val dups = duplicates (op =) (map (fst o dest_Free) ts)
595 val confl = filter (fn Free (str, _) => member op = dups str
600 else raise TYPE ("formalisation inconsistent w.r.t. type inference: ",
601 map (snd o dest_Free)confl, confl)
604 (* expects t as Const *)
605 fun contains_Const_typeless ts t = (t
607 |> member (fn (t1, t2) => fst (dest_Const t1) = fst (dest_Const t2)) ts
608 ) handle TERM("dest_Const", _) => raise TERM ("contains_Const_typeless", [t])
610 (* WN100910 weaker than fun sym_thm for Theory.axioms_of in isa02 *)
613 val (lhs, rhs) = (dest_equals o strip_trueprop o Logic.strip_imp_concl) trm
614 val trm' = case strip_imp_prems' trm of
615 NONE => mk_equality (rhs, lhs)
616 | SOME cs => ins_concl cs (mk_equality (rhs, lhs))