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 perm: term -> term -> bool (*old original Isabelle code*)
21 val contains_Var: term -> bool
22 val dest_binop_typ: typ -> typ * typ * typ
23 val dest_equals: term -> term * term
24 val free2str: term -> string
25 val ids2str: term -> string list
26 val ins_concl: term -> term -> term
27 val inst_abs: term -> term
28 val inst_bdv: LibraryC.subst -> term -> term
33 val mk_frac: typ -> int * (int * int) -> term
34 val numerals_to_Free: term -> term
35 val term_of_num: typ -> int -> term
36 val num_of_term: term -> int
37 val to_string: term -> string
38 val int_of_str: string -> int
39 val isastr_of_int: int -> string
40 val int_opt_of_string: string -> int option
42 val isalist2list: term -> term list
43 val list2isalist: typ -> term list -> term
44 val isapair2pair: term -> term * term (* rename to dest_pair, compare HOLogic.dest_string *)
46 val is_atom: term -> bool
47 val string_of_atom: term -> string
48 val is_variable: term -> bool
49 val is_bdv: string -> bool
50 val is_bdv_subst: term -> bool
51 val guess_bdv_typ: term -> typ
52 val is_equality: term -> bool
53 val is_expliceq: term -> bool
54 val is_f_x: term -> bool
55 val is_list: term -> bool
56 val is_bool_list: term -> bool
57 val dest_listT: typ -> typ
58 val is_num: term -> bool
59 val is_num': string -> bool
60 val string_of_num: term -> string
61 val variable_constant_pair: term * term -> bool
63 val mk_add: term -> term -> term
64 val mk_free: typ -> string -> term
65 val mk_equality: term * term -> term
66 val mk_factroot: string -> typ -> int -> int -> term
67 val mk_Free: string * typ -> term
68 val mk_thmid: string -> string -> string -> string
69 val mk_num_op_num: typ -> typ -> string * typ -> int -> int -> term
70 val mk_num_op_var: term -> string -> typ -> typ -> int -> term
71 val mk_var_op_num: term -> string -> typ -> typ -> int -> term
73 val matches: theory -> term -> term -> bool
75 val parseNEW: Proof.context -> string -> term option(*old version to be eliminated*)
76 val parseNEW': Proof.context -> string -> term (*old version to be eliminated*)
77 val parseNEW'': theory -> string -> term (*old version to be eliminated*)
78 val parse_strict: theory -> string -> term (*to be replaced by parse, typ_a2real for CAS_Cmd*)
79 val parse_strict_PIDE: theory -> string -> term (*to be 1.replaced by parse_patt*)
80 (*goal*)val parse: Proof.context -> string -> term
81 val parse_patt_PIDE: theory -> string -> term (*rename to parse_patt*)
82 (*goal*)val parse_patt: theory -> string -> term (*with typ_a2real still for tests *)
84 (*goal*)val parse_test: Proof.context -> string -> term
85 (*goal*)val parse_patt_test: theory -> string -> term
86 val str2term: string -> term (*to be replaced by parse/_patt in src*, by parse/_patt in test/**)
88 val str_of_free_opt: term -> string option
89 val str_of_int: int -> string
90 val strip_imp_prems': term -> term option
91 val subst_atomic_all: LibraryC.subst -> term -> bool * term
92 val term_detail2str: term -> string
94 val pairt: term -> term -> term
95 val pairT: typ -> typ -> typ
96 val raise_type_conflicts: term list -> unit
97 val strip_trueprop: term -> term
99 val var2free: term -> term
100 val vars: term -> term list (* recognises numerals, should replace "fun vars_of" TODOO*)
101 val vars': term list -> term list
102 val vars_of: term -> term list (* deprecated TODOO: see differences in test/../termC.sml*)
103 val dest_list': term -> term list
104 val negates: term -> term -> bool
107 val mk_negative: typ -> term -> term
108 val scala_of_term: term -> string
109 val atomtyp(*<-- atom_typ TODO*): typ -> unit
110 val atomty: term -> unit
111 val atomw: term -> unit
112 val atomt: term -> unit
113 val atomwy: term -> unit
114 val atomty_thy: ThyC.id -> term -> unit
115 val free2var: term -> term
116 val typ_a2real: term -> term
118 val contains_one_of: thm * (string * typ) list -> bool
119 val contains_Const_typeless: term list -> term -> bool
120 (*----- unused code, kept as hints to design ideas ---------------------------------------------*)
121 val sym_trm : term -> term
125 structure TermC(**): TERM_ISAC(**) =
129 type as_string = UnparseC.term_as_string
130 val empty = UnparseC.term_empty
131 val typ_empty = UnparseC.typ_empty
133 datatype lrd = L (*t1 in "t1$t2"*)
134 | R (*t2 in "t1$t2"*) | D; (*b in Abs(_,_,b*)
135 type path = lrd list;
139 fun string_of_path k = (strs2str' o (map ldr2str)) k;
140 (*go to a location in a term and fetch the resective sub-term*)
142 | sub_at (D :: p) (Abs(_, _, body)) = sub_at p body
143 | sub_at (L :: p) (t1 $ _) = sub_at p t1
144 | sub_at (R :: p) (_ $ t2) = sub_at p t2
145 | sub_at l t = raise TERM ("sub_at: no " ^ string_of_path l ^ " for ", [t]);
147 if length l > 1 then sub_at (drop_last l) t else raise ERROR ("go_up [] " ^ UnparseC.term t)
149 fun isastr_of_int i = if i >= 0 then string_of_int i else "-" ^ string_of_int (abs i)
151 fun matches thy tm pa =
152 (Pattern.match thy (pa, tm) (Vartab.empty, Vartab.empty); true)
153 handle Pattern.MATCH => false
155 (** transform typ / term to a String to be parsed by Scala after transport via libisabelle **)
158 fun scala_of_typ (Type (s, typs)) =
159 enclose "Type(" ")" (quote s ^ ", " ^
160 (typs |> map scala_of_typ |> commas |> enclose "List(" ")"))
161 | scala_of_typ (TFree (s, sort)) =
162 enclose "TFree(" ")" (quote s ^ ", " ^ (sort |> map quote |> commas |> enclose "List(" ")"))
163 | scala_of_typ (TVar ((s, i), sort)) =
164 enclose "TVar(" ")" (
165 enclose "(" ")," (quote s ^ ", " ^ quote (string_of_int i)) ^
166 (sort |> map quote |> commas |> enclose "List(" ")"))
168 fun scala_of_term (Const (s, T)) =
169 enclose "Const (" ")" (quote s ^ ", " ^ scala_of_typ T)
170 | scala_of_term (Free (s, T)) =
171 enclose "Free(" ")" (quote s ^ ", " ^ scala_of_typ T)
172 | scala_of_term (Var ((s, i), T)) =
173 enclose "TVar(" ")" (
174 enclose "(" ")," (quote s ^ ", " ^ quote (string_of_int i)) ^
176 | scala_of_term (Bound i) = enclose "Bound(" ")" (string_of_int i)
177 | scala_of_term (Abs (s, T, t)) =
180 scala_of_typ T ^ ", " ^
182 | scala_of_term (t1 $ t2) =
183 enclose "App(" ")" (scala_of_term t1 ^ ", " ^ scala_of_term t2)
185 (* see structure's bare bones.
186 for Isabelle standard output compare 2017 "structure ML_PP" *)
189 fun ato n (Type (s, [])) = "\n*** " ^ indent n ^ "Type (" ^ s ^",[])"
190 | ato n (Type (s, Ts)) = "\n*** " ^ indent n ^ "Type (" ^ s ^ ",[" ^ atol (n + 1) Ts
191 | ato n (TFree (s, sort)) = "\n*** " ^ indent n ^ "TFree (" ^ s ^ ", " ^ strs2str' sort
192 | ato n (TVar ((s, i), sort)) =
193 "\n*** " ^ indent n ^ "TVar ((" ^ s ^ ", " ^ string_of_int i ^ strs2str' sort
194 and atol n [] = "\n*** " ^ indent n ^ "]"
195 | atol n (T :: Ts) = (ato n T ^ atol n Ts)
196 in tracing (ato 0 t ^ "\n") end;
199 fun ato (Const (a, _)) n = "\n*** " ^ indent n ^ "Const (" ^ a ^ ", _)"
200 | ato (Free (a, _)) n = "\n*** " ^ indent n ^ "Free (" ^ a ^ ", _)"
201 | ato (Var ((a, i), _)) n =
202 "\n*** " ^ indent n ^ "Var (" ^ a ^ ", " ^ string_of_int i ^ "), _)"
203 | ato (Bound i) n = "\n*** " ^ indent n ^ "Bound " ^ string_of_int i
204 | ato (Abs (a, _, body)) n = "\n*** " ^ indent n ^ "Abs(" ^ a ^ ", _" ^ ato body (n+1)
205 | ato (f $ t) n = (ato f n ^ ato t (n + 1))
207 fun atomw t = writeln ("\n*** -------------" ^ ato t 0 ^ "\n***");
208 fun atomt t = tracing ("\n*** -------------" ^ ato t 0 ^ "\n***");
212 fun term_detail2str t =
214 fun ato (Const (a, T)) n = "\n*** " ^ indent n ^ "Const (" ^ a ^ ", " ^ UnparseC.typ T ^ ")"
215 | ato (Free (a, T)) n = "\n*** " ^ indent n ^ "Free (" ^ a ^ ", " ^ UnparseC.typ T ^ ")"
216 | ato (Var ((a, i), T)) n =
217 "\n*** " ^ indent n ^ "Var ((" ^ a ^ ", " ^ string_of_int i ^ "), " ^ UnparseC.typ T ^ ")"
218 | ato (Bound i) n = "\n*** " ^ indent n ^ "Bound " ^ string_of_int i
219 | ato (Abs(a, T, body)) n =
220 "\n*** " ^ indent n ^ "Abs (" ^ a ^ ", " ^ UnparseC.typ T ^ ",.." ^ ato body (n + 1)
221 | ato (f $ t) n = ato f n ^ ato t (n + 1)
222 in "\n*** " ^ ato t 0 ^ "\n***" end;
225 fun term_detail2str_thy thy t =
227 fun ato (Const (a, T)) n =
228 "\n*** " ^ indent n ^ "Const (" ^ a ^ ", " ^ UnparseC.typ_by_thyID thy T ^ ")"
229 | ato (Free (a, T)) n =
230 "\n*** " ^ indent n ^ "Free (" ^ a ^ ", " ^ UnparseC.typ_by_thyID thy T ^ ")"
231 | ato (Var ((a, i), T)) n =
232 "\n*** " ^ indent n ^ "Var ((" ^ a ^ ", " ^ string_of_int i ^ "), " ^
233 UnparseC.typ_by_thyID thy T ^ ")"
235 "\n*** " ^ indent n ^ "Bound " ^ string_of_int i
236 | ato (Abs(a, T, body)) n =
237 "\n*** " ^ indent n ^ "Abs (" ^ a ^ ", " ^ UnparseC.typ_by_thyID thy T ^ ",.." ^
239 | ato (f $ t) n = ato f n ^ ato t (n + 1)
240 in "\n*** " ^ ato t 0 ^ "\n***" end;
241 fun atomwy t = (writeln o term_detail2str) t;
242 fun atomty t = (tracing o term_detail2str) t;
243 fun atomty_thy thy t = (tracing o (term_detail2str_thy thy)) t;
246 (* contains the term a VAR(("*",_),_) ? *)
247 fun contains_Var (Abs(_,_,body)) = contains_Var body
248 | contains_Var (f $ f') = contains_Var f orelse contains_Var f'
249 | contains_Var (Var _) = true
250 | contains_Var _ = false;
253 if n < 0 then "-" ^ ((string_of_int o abs) n)
254 else string_of_int n;
255 val int_of_str = Value.parse_int;
257 val int_opt_of_string = ThmC_Def.int_opt_of_string
258 fun is_num' str = case int_opt_of_string str of SOME _ => true | NONE => false;
260 fun is_num (Const (\<^const_name>\<open>numeral\<close>, _) $ _) = true
261 | is_num (Const (\<^const_name>\<open>uminus\<close>, _) $
262 (Const (\<^const_name>\<open>numeral\<close>, _) $ _)) = true
263 | is_num (Const (\<^const_name>\<open>one_class.one\<close>, _)) = true
264 | is_num (Const (\<^const_name>\<open>uminus\<close>, _) $ Const (\<^const_name>\<open>one_class.one\<close>, _)) = true
265 | is_num (Const (\<^const_name>\<open>zero_class.zero\<close>, _)) = true
266 | is_num (Const (\<^const_name>\<open>uminus\<close>, _) $ Const (\<^const_name>\<open>zero_class.zero\<close>, _)) = true
269 fun string_of_num n = (n |> HOLogic.dest_number |> snd |> string_of_int)
271 (* refer to Thm.lhs_of *)
272 fun lhs (Const (\<^const_name>\<open>HOL.eq\<close>,_) $ l $ _) = l
273 | lhs t = raise ERROR("lhs called with (" ^ UnparseC.term t ^ ")");
274 fun rhs (Const (\<^const_name>\<open>HOL.eq\<close>,_) $ _ $ r) = r
275 | rhs t = raise ERROR("rhs called with (" ^ UnparseC.term t ^ ")");
278 fun mk_negative T t = Const (\<^const_name>\<open>uminus\<close>, T --> T) $ t
279 fun mk_frac T (sg, (i1, i2)) =
281 if i2 = 1 then HOLogic.mk_number T i1
282 else Const (\<^const_name>\<open>divide_class.divide\<close>, T --> T --> T) $
283 HOLogic.mk_number T i1 $ HOLogic.mk_number T i2
284 else (*take negative*)
285 if i2 = 1 then mk_negative T (HOLogic.mk_number T i1)
286 else Const (\<^const_name>\<open>divide_class.divide\<close>, T --> T --> T) $
287 mk_negative T (HOLogic.mk_number T i1) $ HOLogic.mk_number T i2
289 val numerals_to_Free = (* Makarius 100308 *)
292 (case try HOLogic.dest_number t of
293 SOME (T, i) => SOME (Free (signed_string_of_int i, T))
295 fun to_str (Abs (x, T, b)) = Abs (x, T, to_str b)
296 | to_str (t as (u1 $ u2)) =
297 (case dest_num t of SOME t' => t' | NONE => to_str u1 $ to_str u2)
298 | to_str t = perhaps dest_num t;
301 val term_of_num = HOLogic.mk_number;
302 fun num_of_term t = t |> HOLogic.dest_number |> snd;
303 (* accomodate string-representation for int to term-orders *)
304 fun to_string t = t |> num_of_term |> signed_string_of_int
306 fun is_variable (t as Free _) = not (is_num t)
307 | is_variable _ = false;
308 fun is_Free (Free _) = true | is_Free _ = false;
309 fun is_fun_id (Const _) = true
310 | is_fun_id (Free _) = true
311 | is_fun_id _ = false;
312 fun is_f_x (f $ x) = is_fun_id f andalso is_Free x
314 (* precondition: TermC.is_atom v andalso TermC.is_atom c *)
315 fun is_const (Const _) = true | is_const _ = false;
316 fun variable_constant_pair (v, c) =
317 if (is_variable v andalso (is_const c orelse is_num c)) orelse
318 (is_variable c andalso (is_const v orelse is_num v))
324 fun scan vs (Const _) = vs
325 | scan vs (t as Free _) = (*if is_num' s then vs else*) t :: vs
326 | scan vs (t as Var _) = t :: vs
327 | scan vs (Bound _) = vs
328 | scan vs (Abs (_, _, t)) = scan vs t
329 | scan vs (t1 $ t2) = (scan vs t1) @ (scan vs t2)
330 in ((distinct op =) o (scan [])) t end;
331 fun vars' ts = ts |> map vars |> flat |> distinct op =
333 (* bypass Isabelle's Pretty, which requires ctxt *)
336 fun scan vs (t as Const (s, _) $ arg) =
337 if is_num t then vs else scan (s :: vs) arg
338 | scan vs (Const (s as "Partial_Fractions.AA", _)) = s :: vs (*how get rid of spec.case?*)
339 | scan vs (Const (s as "Partial_Fractions.BB", _)) = s :: vs (*how get rid of spec.case?*)
340 | scan vs (Const _) = vs
341 | scan vs (Free (s, _)) = if is_num' s then vs else s :: vs
342 | scan vs (Var ((s, i), _)) = (s ^ "_" ^ string_of_int i) :: vs
343 | scan vs (Bound _) = vs
344 | scan vs (Abs (s, _, t)) = scan (s :: vs) t
345 | scan vs (t1 $ t2) = (scan vs t1) @ (scan vs t2)
346 in ((distinct op =) o (scan [])) t
348 fun is_bdv str = case Symbol.explode str of "b"::"d"::"v"::_ => true | _ => false;
349 (* instantiate #prop thm with bound vars_of (as Free) *)
350 fun inst_bdv [] t = t
351 | inst_bdv (instl: (term*term) list) t =
353 fun subst (v as Var((s, _), T)) =
354 (case Symbol.explode s of
355 "b"::"d"::"v"::_ => if_none (assoc(instl,Free(s,T))) (Free(s,T))
357 | subst (Abs(a, T, body)) = Abs(a, T, subst body)
358 | subst (f $ t') = subst f $ subst t'
359 | subst t = if_none (assoc (instl, t)) t
362 (* is a term a substitution for a bdv as found in programs and tactics *)
363 fun is_bdv_subst (Const (\<^const_name>\<open>Cons\<close>, _) $
364 (Const (\<^const_name>\<open>Pair\<close>, _) $ str $ _) $ _) = is_bdv (HOLogic.dest_string str)
365 | is_bdv_subst _ = false;
367 (* this shall be improved due to future requirements *)
368 fun guess_bdv_typ t = t |> vars |> hd |> type_of
370 fun free2str (Free (s, _)) = s
371 | free2str t = raise ERROR ("free2str not for " ^ UnparseC.term t);
372 fun str_of_free_opt (Free (s, _)) = SOME s
373 | str_of_free_opt _ = NONE
375 (* compare Logic.unvarify_global, which rejects Free *)
376 fun var2free (t as Const _) = t
377 | var2free (t as Free _) = t
378 | var2free (Var((s, _), T)) = Free (s,T)
379 | var2free (t as Bound _) = t
380 | var2free (Abs(s, T, t)) = Abs(s, T, var2free t)
381 | var2free (t1 $ t2) = (var2free t1) $ (var2free t2);
384 (* Logic.varify does NOT take care of 'Free ("1", _)'*)
385 fun free2var (t as Const _) = t
386 | free2var (t as Free (s, T)) = if is_num' s then t else Var ((s, 0), T)
387 | free2var (t as Var _) = t
388 | free2var (t as Bound _) = t
389 | free2var (Abs (s, T, t)) = Abs (s, T, free2var t)
390 | free2var (t1 $ t2) = (free2var t1) $ (free2var t2);
393 fun mk_listT T = Type (\<^type_name>\<open>list\<close>, [T]);
394 fun list_const T = Const (\<^const_name>\<open>Cons\<close>, [T, mk_listT T] ---> mk_listT T);
395 fun list2isalist T [] = Const (\<^const_name>\<open>Nil\<close>, mk_listT T)
396 | list2isalist T (t :: ts) = (list_const T) $ t $ (list2isalist T ts);
398 fun isapair2pair (Const (\<^const_name>\<open>Pair\<close>,_) $ a $ b) = (a, b)
400 raise ERROR ("isapair2pair called with " ^ UnparseC.term t);
401 fun isalist2list ls =
403 fun get es (Const(\<^const_name>\<open>Cons\<close>, _) $ t $ ls) = get (t :: es) ls
404 | get es (Const(\<^const_name>\<open>Nil\<close>, _)) = es
405 | get _ t = raise TERM ("isalist2list applied to NON-list: ", [t])
406 in (rev o (get [])) ls end;
408 fun is_list ((Const (\<^const_name>\<open>Cons\<close>, _)) $ _ $ _) = true
410 fun dest_listT (Type (\<^type_name>\<open>list\<close>, [T])) = T
411 | dest_listT T = raise TYPE ("dest_listT: list type expected", [T], []);
413 (if dest_listT (Term.type_of t) = HOLogic.boolT then true else false)
414 handle TYPE _ => false
417 fun dest_binop_typ (Type (\<^type_name>\<open>fun\<close>, [range, Type (\<^type_name>\<open>fun\<close>, [arg2, arg1])])) = (arg1, arg2, range)
418 | dest_binop_typ _ = raise ERROR "dest_binop_typ: not binary";
419 fun dest_equals (Const(\<^const_name>\<open>HOL.eq\<close>, _) $ t $ u) = (t, u) (* Pure/logic.ML: Const ("==", ..*)
420 | dest_equals t = raise TERM ("dest_equals'", [t]);
421 fun is_equality (Const(\<^const_name>\<open>HOL.eq\<close>,_) $ _ $ _) = true (* logic.ML: Const ("=="*)
422 | is_equality _ = false;
423 fun mk_equality (t, u) = (Const(\<^const_name>\<open>HOL.eq\<close>, [type_of t, type_of u] ---> HOLogic.boolT) $ t $ u);
424 fun is_expliceq (Const(\<^const_name>\<open>HOL.eq\<close>,_) $ (Free _) $ _) = true
425 | is_expliceq _ = false;
426 fun strip_trueprop (Const (\<^const_name>\<open>Trueprop\<close>, _) $ t) = t
427 | strip_trueprop t = t;
429 (* (A1==>...An==>B) goes to (A1==>...An==>) Pure/logic.ML: term -> term list*)
430 fun strip_imp_prems' (Const (\<^const_name>\<open>Pure.imp\<close>, _) $ A $ t) =
432 fun coll_prems As (Const(\<^const_name>\<open>Pure.imp\<close>, _) $ A $ t) =
433 coll_prems (As $ (Logic.implies $ A)) t
434 | coll_prems As _ = SOME As
435 in coll_prems (Logic.implies $ A) t end
436 | strip_imp_prems' _ = NONE; (* *)
438 (* (A1==>...An==>) (B) goes to (A1==>...An==>B), where B is lowest branch, 2002 Pure/thm.ML *)
439 fun ins_concl (Const (\<^const_name>\<open>Pure.imp\<close>, _) $ A $ t) B = Logic.implies $ A $ (ins_concl t B)
440 | ins_concl (Const (\<^const_name>\<open>Pure.imp\<close>, _) $ A ) B = Logic.implies $ A $ B
441 | ins_concl t B = raise TERM ("ins_concl", [t, B]);
443 fun vperm (Var _, Var _) = true (* 2002 Pure/thm.ML *)
444 | vperm (Abs (_, _, s), Abs (_, _, t)) = vperm (s, t)
445 | vperm (t1 $ t2, u1 $ u2) = vperm (t1, u1) andalso vperm (t2, u2)
446 | vperm (t, u) = (t = u);
448 (*2002 cp from Pure/term.ML --- since 2009 in Pure/old_term.ML*)
449 fun mem_term (_, []) = false
450 | mem_term (t, t' :: ts) = t aconv t' orelse mem_term (t, ts);
451 fun subset_term ([], _) = true
452 | subset_term (x :: xs, ys) = mem_term (x, ys) andalso subset_term (xs, ys);
453 fun eq_set_term (xs, ys) =
454 xs = ys orelse (subset_term (xs, ys) andalso subset_term (ys, xs));
455 (*a total, irreflexive ordering on index names*)
456 fun xless ((a, i), (b, j): indexname) = i<j orelse (i = j andalso a < b);
457 (*a partial ordering (not reflexive) for atomic terms*)
458 fun atless (Const (a, _), Const (b, _)) = a < b
459 | atless (Free (a, _), Free (b, _)) = a < b
460 | atless (Var (v, _), Var (w, _)) = xless (v, w)
461 | atless (Bound i, Bound j) = i < j
463 (*insert atomic term into partially sorted list, suppressing duplicates (?)*)
464 fun insert_aterm (t,us) =
465 let fun inserta [] = [t]
466 | inserta (us as u::us') =
467 if atless(t,u) then t::us
468 else if t=u then us (*duplicate*)
469 else u :: inserta us'
472 (* Accumulates the Vars in the term, suppressing duplicates *)
473 fun add_term_vars (t, vars: term list) = case t of
474 Var _ => insert_aterm (t, vars)
475 | Abs (_, _, body) => add_term_vars (body, vars)
476 | f$t => add_term_vars (f, add_term_vars (t, vars))
478 fun term_vars t = add_term_vars (t, []);
480 (*2002 Pure/thm.ML *)
481 fun var_perm (t, u) = vperm (t, u) andalso eq_set_term (term_vars t, term_vars u);
482 (*2002 fun decomp_simp, Pure/thm.ML *)
483 fun perm lhs rhs = var_perm (lhs, rhs) andalso not (lhs aconv rhs) andalso not (is_Var lhs);
486 fun pairT T1 T2 = Type (\<^type_name>\<open>prod\<close>, [T1, T2]);
487 fun PairT T1 T2 = ([T1, T2] ---> Type (\<^type_name>\<open>prod\<close>, [T1, T2]));
488 fun pairt t1 t2 = Const (\<^const_name>\<open>Pair\<close>, PairT (type_of t1) (type_of t2)) $ t1 $ t2;
490 fun mk_factroot op_(*=thy.sqrt*) T fact root =
491 Const (\<^const_name>\<open>times\<close>, [T, T] ---> T) $ (term_of_num T fact) $
492 (Const (op_, T --> T) $ term_of_num T root);
493 fun mk_var_op_num v op_ optype ntyp n = Const (op_, optype) $ v $ HOLogic.mk_number ntyp n;
494 fun mk_num_op_var v op_ optype ntyp n = Const (op_, optype) $ HOLogic.mk_number ntyp n $ v;
495 fun mk_num_op_num T1 T2 (op_, Top) n1 n2 =
496 Const (op_, Top) $ HOLogic.mk_number T1 n1 $ HOLogic.mk_number T2 n2;
497 fun mk_thmid thmid n1 n2 =
498 thmid ^ (strip_thy n1) ^ "_" ^ (strip_thy n2);
501 val (T1, T2) = (type_of t1, type_of t2)
503 if T1 <> T2 then raise TYPE ("mk_add gets ", [T1, T2], [t1,t2])
504 else (Const (\<^const_name>\<open>plus\<close>, [T1, T2] ---> T1) $ t1 $ t2)
507 (** transform binary numeralsstrings **)
508 fun mk_Free (s,T) = Free (s, T);
509 fun mk_free T s = Free (s, T);
511 (*Special case: one argument cp from Isabelle2002/src/Pure/term.ML*)
512 fun subst_bound (arg, t) =
514 fun subst (t as Bound i, lev) =
515 if i < lev then t (*var is locally bound*)
516 else if i = lev then incr_boundvars lev arg
517 else Bound (i - 1) (*loose: change it*)
518 | subst (Abs(a, T, body), lev) = Abs (a, T, subst (body, lev + 1))
519 | subst (f$t, lev) = subst(f, lev) $ subst(t, lev)
523 (* instantiate let; necessary for scan_up1 *)
524 fun inst_abs (Const sT) = Const sT
525 | inst_abs (Free sT) = Free sT
526 | inst_abs (Bound n) = Bound n
527 | inst_abs (Var iT) = Var iT
528 | inst_abs (Const (\<^const_name>\<open>Let\<close>,T1) $ e $ (Abs (v, T2, b))) =
529 let val b' = subst_bound (Free (v, T2), b); (*fun variant_abs: term.ML*)
530 in Const (\<^const_name>\<open>Let\<close>, T1) $ inst_abs e $ (Abs (v, T2, inst_abs b')) end
531 | inst_abs (t1 $ t2) = inst_abs t1 $ inst_abs t2
534 (* for parse and parse_patt: fix all types to real *)
535 fun T_a2real (Type (s, [])) =
536 if s = "'a" orelse s = "'b" orelse s = "'c" then HOLogic.realT else Type (s, [])
537 | T_a2real (Type (s, Ts)) = Type (s, map T_a2real Ts)
538 | T_a2real (TFree (s, srt)) =
539 if s = "'a" orelse s = "'b" orelse s = "'c" then HOLogic.realT else TFree (s, srt)
540 | T_a2real (TVar (("DUMMY", _), _)) = HOLogic.realT
541 | T_a2real (TVar ((s, i), srt)) =
542 if s = "'a" orelse s = "'b" orelse s = "'c" then HOLogic.realT else TVar ((s, i), srt)
543 (*val typ_a2real: term -> term*)
544 fun typ_a2real (Const( s, T)) = (Const( s, T_a2real T))
545 | typ_a2real (Free( s, T)) = (Free( s, T_a2real T))
546 | typ_a2real (Var( n, T)) = (Var( n, T_a2real T))
547 | typ_a2real (Bound i) = (Bound i)
548 | typ_a2real (Abs(s,T,t)) = Abs(s, T, typ_a2real t)
549 | typ_a2real (t1 $ t2) = (typ_a2real t1) $ (typ_a2real t2);
554 (*/----- old versions to be eliminated -------------------------------------------------------\*)
555 fun parseNEW ctxt str = \<^try>\<open>Syntax.read_term ctxt str\<close>;
556 fun parseNEW' ctxt str =
557 case parseNEW ctxt str of
559 | NONE => raise TERM ("NO parseNEW' for " ^ str, [])
560 fun parseNEW'' thy str =
561 case parseNEW (Proof_Context.init_global thy) str of
563 | NONE => raise TERM ("NO parseNEW'' for " ^ str, [])
564 (*\----- old versions to be eliminated -------------------------------------------------------/*)
566 (* to be replaced by parse-test..*)
567 fun parse_strict thy str = typ_a2real (Syntax.read_term_global thy str); (*still for CAS_Cmd*)
568 (* to be replaced by parse..*)
569 fun parse_strict_PIDE thy str = (*typ_a2real*) (Syntax.read_term_global thy str);
570 fun parse ctxt str = Syntax.read_term_global (Proof_Context.theory_of ctxt) str;
571 (* parse term patterns; Var ("v",_), i.e. "?v", are required for instantiation *)
572 (*rename to parse_patt..*)
573 fun parse_patt_PIDE thy str = (thy, str)
574 |>> Proof_Context.init_global
575 |-> Proof_Context.read_term_pattern
576 fun parse_patt thy str = (thy, str)
577 |>> Proof_Context.init_global
578 |-> Proof_Context.read_term_pattern
579 (**)|> typ_a2real; (** )TODO drop*)
581 (** parse in test/* **)
583 This bypasses building ctxt at the begin of a calculation
584 and thus borrows adapt_to_type (used for pre-parsed terms from Know_Store).
586 fun parse_test ctxt str = str
587 |> Syntax.read_term_global (Proof_Context.theory_of ctxt)
588 |> Model_Pattern.adapt_term_to_type ctxt
589 fun parse_patt_test thy str = (thy, str)
590 |>> Proof_Context.init_global
591 |-> Proof_Context.read_term_pattern
592 (**)|> typ_a2real; (** )TODO drop*)
593 fun str2term str = parse_patt (ThyC.get_theory "Isac_Knowledge") str
596 fun is_atom (Const _) = true
597 | is_atom (Free _) = true
598 | is_atom (Var _) = true
599 | is_atom t = is_num t;
600 fun string_of_atom (t as Const (\<^const_name>\<open>numeral\<close>, _) $ _) = to_string t
601 | string_of_atom (t as Const (\<^const_name>\<open>one_class.one\<close>, _)) = to_string t
602 | string_of_atom (t as Const (\<^const_name>\<open>zero_class.zero\<close>, _)) = to_string t
603 | string_of_atom (Const (str, _)) = str
604 | string_of_atom (Free (str, _)) = str
605 | string_of_atom (Var ((str, int), _)) = str ^ "_" ^ string_of_int int
606 | string_of_atom _ = "DUMMY-string_of_atom";
608 (* from Pure/term.ML; reports if ALL Free's have found a substitution
609 (required for evaluating the preconditions of _incomplete_ models) *)
610 fun subst_atomic_all [] t = (false (*TODO may be 'true' for some terms ?*), t)
611 | subst_atomic_all instl t =
613 fun subst (Abs (a, T, body)) =
615 val (all, body') = subst body
616 in (all, Abs(a, T, body')) end
619 val (all1, f') = subst f
620 val (all2, tt') = subst tt
621 in (all1 andalso all2, f' $ tt') end
622 | subst (t as Free _) =
623 if is_num t then (true, t) (*numerals cannot be subst*)
624 else (case assoc (instl, t) of
625 SOME t' => (true, t')
626 | NONE => (false, t))
627 | subst t = (true, if_none (assoc(instl,t)) t)
630 fun op contains_one_of (thm, ids) =
631 Term.exists_Const (fn id => member op= ids id) (Thm.prop_of thm)
633 fun var_for vs (t as Const (str, _)) id =
635 else if id = strip_thy str then t :: vs else vs
636 | var_for vs (t as Free (str, _)) id = if id = str then t :: vs else vs
637 | var_for vs (t as Var (idn, _)) id = if id = Term.string_of_vname idn then t :: vs else vs
638 | var_for vs (Bound _) _ = vs
639 | var_for vs (Abs (_, _, t)) id = var_for vs t id
640 | var_for vs (t1 $ t2) id = (var_for vs t1 id) @ (var_for vs t2 id)
642 val poly_consts = (* TODO: adopt syntax-const from Isabelle*)
643 [\<^const_name>\<open>plus\<close>, \<^const_name>\<open>minus\<close>,
644 \<^const_name>\<open>divide\<close>, \<^const_name>\<open>times\<close>,
645 \<^const_name>\<open>realpow\<close>];
646 (* treat Free, Const, Var as vars_of in polynomials *)
649 val var_ids = t |> ids2str |> subtract op = poly_consts |> map strip_thy |> sort string_ord
650 in (map (var_for [] t) var_ids) |> flat |> distinct op = end
652 (* this may decompose an object-language isa-list;
653 use only, if description is not available, eg. not input ?WN:14.5.03 ??!?*)
654 fun dest_list' t = if is_list t then isalist2list t else [t];
656 fun negat (Const (\<^const_name>\<open>Not\<close>, _) $ P, P') = P = P'
658 fun negates p1 p2 = negat (p1, p2) orelse negat (swap (p1, p2));
660 fun raise_type_conflicts ts =
662 val dups = duplicates (op =) (map (fst o dest_Free) ts)
663 val confl = filter (fn Free (str, _) => member op = dups str
668 else raise TYPE ("formalisation inconsistent w.r.t. type inference: ",
669 map (snd o dest_Free)confl, confl)
672 (* expects t as Const *)
673 fun contains_Const_typeless ts t = (t
675 |> member (fn (t1, t2) => fst (dest_Const t1) = fst (dest_Const t2)) ts
676 ) handle TERM("dest_Const", _) => raise TERM ("contains_Const_typeless", [t])
678 (* WN100910 weaker than fun sym_thm for Theory.axioms_of in isa02 *)
681 val (lhs, rhs) = (dest_equals o strip_trueprop o Logic.strip_imp_concl) trm
682 val trm' = case strip_imp_prems' trm of
683 NONE => mk_equality (rhs, lhs)
684 | SOME cs => ins_concl cs (mk_equality (rhs, lhs))