neuper@38025: (* Title: extends Isabelle/src/Pure/term.ML neuper@38025: Author: Walther Neuper 1999 neuper@38025: (c) due to copyright terms neuper@38025: *) neuper@38025: neuper@38025: (* neuper@38025: > (cterm_of thy) a_term; neuper@38025: val it = "empty" : cterm *) neuper@38025: neuper@38025: (*2003 fun match thy t pat = neuper@38025: (snd (Pattern.match (Sign.tsig_of (sign_of thy)) (pat, t))) neuper@38025: handle _ => []; neuper@38025: fn : theory -> neuper@38025: Term.term -> Term.term -> (Term.indexname * Term.term) list*) neuper@38025: (*see src/Tools/eqsubst.ML fun clean_match*) neuper@38025: (*2003 fun matches thy tm pa = if match thy tm pa = [] then false else true;*) neuper@38025: fun matches thy tm pa = neuper@38025: (Pattern.match thy (pa, tm) (Vartab.empty, Vartab.empty); true) neuper@38025: handle _ => false neuper@38025: neuper@38025: fun atomtyp t = (*WN10 see raw_pp_typ*) neuper@38025: let neuper@38025: fun ato n (Type (s,[])) = neuper@38025: ("\n*** "^indent n^"Type ("^s^",[])") neuper@38025: | ato n (Type (s,Ts)) = neuper@38025: ("\n*** "^indent n^"Type ("^s^",["^ atol (n+1) Ts) neuper@38025: neuper@38025: | ato n (TFree (s,sort)) = neuper@38025: ("\n*** "^indent n^"TFree ("^s^",["^ strs2str' sort) neuper@38025: neuper@38025: | ato n (TVar ((s,i),sort)) = neuper@38025: ("\n*** "^indent n^"TVar (("^s^","^ neuper@38025: string_of_int i ^ strs2str' sort) neuper@38025: and atol n [] = neuper@38025: ("\n*** "^indent n^"]") neuper@38025: | atol n (T::Ts) = (ato n T ^ atol n Ts) neuper@38031: in writeln (ato 0 t ^ "\n") end; neuper@38025: (* neuper@38025: > val T = (type_of o term_of o the o (parse thy)) "a::[real,int] => nat"; neuper@38025: > atomtyp T; neuper@38025: *** Type (fun,[ neuper@38025: *** Type (RealDef.real,[]) neuper@38025: *** Type (fun,[ neuper@38025: *** Type (IntDef.int,[]) neuper@38025: *** Type (nat,[]) neuper@38025: *** ] neuper@38025: *** ] neuper@38025: *) neuper@38025: neuper@38025: (*Prog.Tutorial.p.34, Makarius 1005 does the above like this..*) neuper@38025: local neuper@38025: fun pp_pair (x, y) = Pretty.list "(" ")" [x, y] neuper@38025: fun pp_list xs = Pretty.list "[" "]" xs neuper@38025: fun pp_str s = Pretty.str s neuper@38025: fun pp_qstr s = Pretty.quote (pp_str s) neuper@38025: fun pp_int i = pp_str (string_of_int i) neuper@38025: fun pp_sort S = pp_list (map pp_qstr S) neuper@38025: fun pp_constr a args = Pretty.block [pp_str a, Pretty.brk 1, args] neuper@38025: in neuper@38025: fun raw_pp_typ (TVar ((a, i), S)) = neuper@38025: pp_constr "TVar" (pp_pair (pp_pair (pp_qstr a, pp_int i), pp_sort S)) neuper@38025: | raw_pp_typ (TFree (a, S)) = neuper@38025: pp_constr "TFree" (pp_pair (pp_qstr a, pp_sort S)) neuper@38025: | raw_pp_typ (Type (a, tys)) = neuper@38025: pp_constr "Type" (pp_pair (pp_qstr a, pp_list (map raw_pp_typ tys))) neuper@38025: end neuper@38025: (* install neuper@38025: PolyML.addPrettyPrinter neuper@38025: (fn _ => fn _ => ml_pretty o Pretty.to_ML o raw_pp_typ); neuper@38025: de-install neuper@38025: PolyML.addPrettyPrinter neuper@38025: (fn _ => fn _ => ml_pretty o Pretty.to_ML o Proof_Display.pp_typ Pure.thy); neuper@38025: *) neuper@38025: neuper@38025: fun atomt t = neuper@38025: let fun ato (Const (a, _)) n = neuper@38025: "\n*** " ^ indent n ^ "Const (" ^ a ^ ", _)" neuper@38025: | ato (Free (a, _)) n = neuper@38025: "\n*** " ^ indent n ^ "Free (" ^ a ^ ", _)" neuper@38025: | ato (Var ((a, i), _)) n = neuper@38025: "\n*** " ^ indent n ^ "Var (" ^ a ^ ", " ^ neuper@38025: string_of_int i ^ "), _)" neuper@38025: | ato (Bound i) n = neuper@38025: "\n*** " ^ indent n ^ "Bound " ^ string_of_int i neuper@38025: | ato (Abs (a, _, body)) n = neuper@38025: "\n*** " ^ indent n ^ "Abs(" ^ a ^ ", _" ^ ato body (n+1) neuper@38025: | ato (f $ t) n = (ato f n ^ ato t (n + 1)) neuper@38031: in writeln ("\n*** -------------" ^ ato t 0 ^ "\n***") end; neuper@38025: neuper@38025: fun term_detail2str t = neuper@38025: let fun ato (Const (a, T)) n = neuper@38025: "\n*** " ^ indent n ^ "Const (" ^ a ^ ", " ^ string_of_typ T ^ ")" neuper@38025: | ato (Free (a, T)) n = neuper@38025: "\n*** " ^ indent n ^ "Free (" ^ a ^ ", " ^ string_of_typ T ^ ")" neuper@38025: | ato (Var ((a, i), T)) n = neuper@38025: "\n*** " ^ indent n ^ "Var ((" ^ a ^ ", " ^ string_of_int i ^ "), "^ neuper@38025: string_of_typ T ^ ")" neuper@38025: | ato (Bound i) n = neuper@38025: "\n*** " ^ indent n ^ "Bound " ^ string_of_int i neuper@38025: | ato (Abs(a, T, body)) n = neuper@38025: "\n*** " ^ indent n ^ "Abs (" ^ a ^ ", " ^ string_of_typ T ^ ",.." neuper@38025: ^ ato body (n + 1) neuper@38025: | ato (f $ t) n = ato f n ^ ato t (n + 1) neuper@38025: in "\n*** " ^ ato t 0 ^ "\n***" end; neuper@38031: fun atomty t = (writeln o term_detail2str) t; (*WN100907 broken*) neuper@38025: neuper@38025: fun term_str thy (Const(s,_)) = s neuper@38025: | term_str thy (Free(s,_)) = s neuper@38025: | term_str thy (Var((s,i),_)) = s^(string_of_int i) neuper@38025: | term_str thy (Bound i) = "B."^(string_of_int i) neuper@38025: | term_str thy (Abs(s,_,_)) = s neuper@38031: | term_str thy t = error("term_str not for "^term2str t); neuper@38025: neuper@38025: (*.contains the fst argument the second argument (a leave! of term).*) neuper@38025: fun contains_term (Abs(_,_,body)) t = contains_term body t neuper@38025: | contains_term (f $ f') t = neuper@38025: contains_term f t orelse contains_term f' t neuper@38025: | contains_term s t = t = s; neuper@38025: (*.contains the term a VAR(("*",_),_) ?.*) neuper@38025: fun contains_Var (Abs(_,_,body)) = contains_Var body neuper@38025: | contains_Var (f $ f') = contains_Var f orelse contains_Var f' neuper@38025: | contains_Var (Var _) = true neuper@38025: | contains_Var _ = false; neuper@38025: (* contains_Var (str2term "?z = 3") (*true*); neuper@38025: contains_Var (str2term "z = 3") (*false*); neuper@38025: *) neuper@38025: neuper@38025: (*fun int_of_str str = neuper@38025: let val ss = explode str neuper@38025: val str' = case ss of neuper@38025: "("::s => drop_last s | _ => ss neuper@38025: in case BasisLibrary.Int.fromString (implode str') of neuper@38025: SOME i => SOME i neuper@38025: | NONE => NONE end;*) neuper@38025: fun int_of_str str = neuper@38025: let val ss = explode str neuper@38025: val str' = case ss of neuper@38025: "("::s => drop_last s | _ => ss neuper@38025: in (SOME (Thy_Output.integer (implode str'))) handle _ => NONE end; neuper@38025: (* neuper@38025: > int_of_str "123"; neuper@38025: val it = SOME 123 : int option neuper@38025: > int_of_str "(-123)"; neuper@38025: val it = SOME 123 : int option neuper@38025: > int_of_str "#123"; neuper@38025: val it = NONE : int option neuper@38025: > int_of_str "-123"; neuper@38025: val it = SOME ~123 : int option neuper@38025: *) neuper@38025: fun int_of_str' str = neuper@38025: case int_of_str str of neuper@38025: SOME i => i neuper@38025: | NONE => raise TERM ("int_of_string: no int-string",[]); neuper@38025: val str2int = int_of_str'; neuper@38025: neuper@38025: fun is_numeral str = case int_of_str str of neuper@38025: SOME _ => true neuper@38025: | NONE => false; neuper@38025: val is_no = is_numeral; neuper@38025: fun is_num (Free (s,_)) = if is_numeral s then true else false neuper@38025: | is_num _ = false; neuper@38025: (*> neuper@38025: > is_num ((term_of o the o (parse thy)) "#1"); neuper@38025: val it = true : bool neuper@38025: > is_num ((term_of o the o (parse thy)) "#-1"); neuper@38025: val it = true : bool neuper@38025: > is_num ((term_of o the o (parse thy)) "a123"); neuper@38025: val it = false : bool neuper@38025: *) neuper@38025: neuper@38025: (*fun int_of_Free (Free (intstr, _)) = neuper@38025: (case BasisLibrary.Int.fromString intstr of neuper@38025: SOME i => i neuper@38031: | NONE => error ("int_of_Free ( "^ intstr ^", _)")) neuper@38031: | int_of_Free t = error ("int_of_Free ( "^ term2str t ^" )");*) neuper@38025: fun int_of_Free (Free (intstr, _)) = (Thy_Output.integer intstr neuper@38031: handle _ => error ("int_of_Free ( "^ intstr ^", _)")) neuper@38031: | int_of_Free t = error ("int_of_Free ( "^ term2str t ^" )"); neuper@38025: neuper@38025: fun vars t = neuper@38025: let neuper@38025: fun scan vs (Const(s,T)) = vs neuper@38025: | scan vs (t as Free(s,T)) = if is_no s then vs else t::vs neuper@38025: | scan vs (t as Var((s,i),T)) = t::vs neuper@38025: | scan vs (Bound i) = vs neuper@38025: | scan vs (Abs(s,T,t)) = scan vs t neuper@38025: | scan vs (t1 $ t2) = (scan vs t1) @ (scan vs t2) neuper@38025: in (distinct o (scan [])) t end; neuper@38025: neuper@38025: fun is_Free (Free _) = true neuper@38025: | is_Free _ = false; neuper@38025: fun is_fun_id (Const _) = true neuper@38025: | is_fun_id (Free _) = true neuper@38025: | is_fun_id _ = false; neuper@38025: fun is_f_x (f $ x) = is_fun_id f andalso is_Free x neuper@38025: | is_f_x _ = false; neuper@38025: (* is_f_x (str2term "q_0/2 * L * x") (*false*); neuper@38025: is_f_x (str2term "M_b x") (*true*); neuper@38025: *) neuper@38025: fun vars_str t = neuper@38025: let neuper@38025: fun scan vs (Const(s,T)) = vs neuper@38025: | scan vs (t as Free(s,T)) = if is_no s then vs else s::vs neuper@38025: | scan vs (t as Var((s,i),T)) = (s^"_"^(string_of_int i))::vs neuper@38025: | scan vs (Bound i) = vs neuper@38025: | scan vs (Abs(s,T,t)) = scan vs t neuper@38025: | scan vs (t1 $ t2) = (scan vs t1) @ (scan vs t2) neuper@38025: in (distinct o (scan [])) t end; neuper@38025: neuper@38025: fun ids2str t = neuper@38025: let neuper@38025: fun scan vs (Const(s,T)) = if is_no s then vs else s::vs neuper@38025: | scan vs (t as Free(s,T)) = if is_no s then vs else s::vs neuper@38025: | scan vs (t as Var((s,i),T)) = (s^"_"^(string_of_int i))::vs neuper@38025: | scan vs (Bound i) = vs neuper@38025: | scan vs (Abs(s,T,t)) = scan (s::vs) t neuper@38025: | scan vs (t1 $ t2) = (scan vs t1) @ (scan vs t2) neuper@38025: in (distinct o (scan [])) t end; neuper@38025: fun is_bdv str = neuper@38025: case explode str of neuper@38025: "b"::"d"::"v"::_ => true neuper@38025: | _ => false; neuper@38025: fun is_bdv_ (Free (s,_)) = is_bdv s neuper@38025: | is_bdv_ _ = false; neuper@38025: neuper@38025: fun free2str (Free (s,_)) = s neuper@38031: | free2str t = error ("free2str not for "^ term2str t); neuper@38025: fun free2int (t as Free (s, _)) = ((str2int s) neuper@38031: handle _ => error ("free2int: "^term_detail2str t)) neuper@38031: | free2int t = error ("free2int: "^term_detail2str t); neuper@38025: neuper@38025: (*27.8.01: unused*) neuper@38025: fun var2free (t as Const(s,T)) = t neuper@38025: | var2free (t as Free(s,T)) = t neuper@38025: | var2free (Var((s,i),T)) = Free(s,T) neuper@38025: | var2free (t as Bound i) = t neuper@38025: | var2free (Abs(s,T,t)) = Abs(s,T,var2free t) neuper@38025: | var2free (t1 $ t2) = (var2free t1) $ (var2free t2); neuper@38025: neuper@38025: (*27.8.01: doesn't find some subterm ???!???*) neuper@38025: (*2010 free2var -> Logic.varify, but take care of 'Free ("1",_)'*) neuper@38025: fun free2var (t as Const (s, T)) = t neuper@38025: | free2var (t as Free (s, T)) = if is_no s then t else Var ((s, 0), T) neuper@38025: | free2var (t as Var ((s, i), T)) = t neuper@38025: | free2var (t as Bound i) = t neuper@38025: | free2var (Abs (s, T, t)) = Abs (s, T, free2var t) neuper@38025: | free2var (t1 $ t2) = (free2var t1) $ (free2var t2); neuper@38025: neuper@38025: neuper@38025: fun mk_listT T = Type ("List.list", [T]); neuper@38025: fun list_const T = neuper@38025: Const("List.list.Cons", [T, mk_listT T] ---> mk_listT T); neuper@38025: (*28.8.01: TODO: get type from head of list: 1 arg less!!!*) neuper@38025: fun list2isalist T [] = Const("List.list.Nil",mk_listT T) neuper@38025: | list2isalist T (t::ts) = (list_const T) $ t $ (list2isalist T ts); neuper@38025: (* neuper@38025: > val tt = (term_of o the o (parse thy)) "R=(R::real)"; neuper@38025: > val TT = type_of tt; neuper@38025: > val ss = list2isalist TT [tt,tt,tt]; neuper@38025: > (cterm_of thy) ss; neuper@38025: val it = "[R = R, R = R, R = R]" : cterm *) neuper@38025: neuper@38025: fun isapair2pair (Const ("Pair",_) $ a $ b) = (a,b) neuper@38025: | isapair2pair t = neuper@38031: error ("isapair2pair called with "^term2str t); neuper@38025: neuper@38025: val listType = Type ("List.list",[Type ("bool",[])]); neuper@38025: fun isalist2list ls = neuper@38025: let neuper@38025: fun get es (Const("List.list.Cons",_) $ t $ ls) = get (t::es) ls neuper@38025: | get es (Const("List.list.Nil",_)) = es neuper@38025: | get _ t = neuper@38031: error ("isalist2list applied to NON-list '"^term2str t^"'") neuper@38025: in (rev o (get [])) ls end; neuper@38025: (* neuper@38025: > val il = str2term "[a=b,c=d,e=f]"; neuper@38025: > val l = isalist2list il; neuper@38025: > (tracing o terms2str) l; neuper@38025: ["a = b","c = d","e = f"] neuper@38025: neuper@38025: > val il = str2term "ss___::bool list"; neuper@38025: > val l = isalist2list il; neuper@38025: [Free ("ss___", "bool List.list")] neuper@38025: *) neuper@38025: neuper@38025: neuper@38025: (*review Isabelle2009/src/HOL/Tools/hologic.ML*) neuper@38025: val prop = Type ("prop",[]); (* ~/Diss.99/Integers-Isa/tools.sml*) neuper@38025: val bool = Type ("bool",[]); (* 2002 Integ.int *) neuper@38025: val Trueprop = Const("Trueprop",bool-->prop); neuper@38025: fun mk_prop t = Trueprop $ t; neuper@38025: val true_as_term = Const("True",bool); neuper@38025: val false_as_term = Const("False",bool); neuper@38025: val true_as_cterm = cterm_of (theory "HOL") true_as_term; neuper@38025: val false_as_cterm = cterm_of (theory "HOL") false_as_term; neuper@38025: neuper@38025: infixr 5 -->; (*2002 /Pure/term.ML *) neuper@38025: infixr --->; (*2002 /Pure/term.ML *) neuper@38025: fun S --> T = Type("fun",[S,T]); (*2002 /Pure/term.ML *) neuper@38025: val op ---> = foldr (op -->); (*2002 /Pure/term.ML *) neuper@38025: fun list_implies ([], B) = B : term (*2002 /term.ML *) neuper@38025: | list_implies (A::AS, B) = Logic.implies $ A $ list_implies(AS,B); neuper@38025: neuper@38025: neuper@38025: neuper@38025: (** substitution **) neuper@38025: neuper@38025: fun match_bvs(Abs(x,_,s),Abs(y,_,t), al) = (* = thm.ML *) neuper@38025: match_bvs(s, t, if x="" orelse y="" then al neuper@38025: else (x,y)::al) neuper@38025: | match_bvs(f$s, g$t, al) = match_bvs(f,g,match_bvs(s,t,al)) neuper@38025: | match_bvs(_,_,al) = al; neuper@38025: fun ren_inst(insts,prop,pat,obj) = (* = thm.ML *) neuper@38025: let val ren = match_bvs(pat,obj,[]) neuper@38025: fun renAbs(Abs(x,T,b)) = neuper@38025: Abs(case assoc_string(ren,x) of NONE => x neuper@38025: | SOME(y) => y, T, renAbs(b)) neuper@38025: | renAbs(f$t) = renAbs(f) $ renAbs(t) neuper@38025: | renAbs(t) = t neuper@38025: in subst_vars insts (if null(ren) then prop else renAbs(prop)) end; neuper@38025: neuper@38025: neuper@38025: neuper@38025: neuper@38025: neuper@38025: neuper@38025: fun dest_equals' (Const("op =",_) $ t $ u) = (t,u)(* logic.ML: Const("=="*) neuper@38025: | dest_equals' t = raise TERM("dest_equals'", [t]); neuper@38025: val lhs_ = (fst o dest_equals'); neuper@38025: val rhs_ = (snd o dest_equals'); neuper@38025: neuper@38025: fun is_equality (Const("op =",_) $ t $ u) = true (* logic.ML: Const("=="*) neuper@38025: | is_equality _ = false; neuper@38025: fun mk_equality (t,u) = (Const("op =",[type_of t,type_of u]--->bool) $ t $ u); neuper@38025: fun is_expliceq (Const("op =",_) $ (Free _) $ u) = true neuper@38025: | is_expliceq _ = false; neuper@38025: fun strip_trueprop (Const("Trueprop",_) $ t) = t neuper@38025: | strip_trueprop t = t; neuper@38025: (* | strip_trueprop t = raise TERM("strip_trueprop", [t]); neuper@38025: *) neuper@38025: neuper@38025: (*.(A1==>...An==>B) goes to (A1==>...An==>).*) neuper@38025: fun strip_imp_prems' (Const("==>", T) $ A $ t) = neuper@38025: let fun coll_prems As (Const("==>", _) $ A $ t) = neuper@38025: coll_prems (As $ (Logic.implies $ A)) t neuper@38025: | coll_prems As _ = SOME As neuper@38025: in coll_prems (Logic.implies $ A) t end neuper@38025: | strip_imp_prems' _ = NONE; (* logic.ML: term -> term list*) neuper@38025: (* neuper@38025: val thm = real_mult_div_cancel1; neuper@38025: val prop = (#prop o rep_thm) thm; neuper@38025: atomt prop; neuper@38025: *** ------------- neuper@38025: *** Const ( ==>) neuper@38025: *** . Const ( Trueprop) neuper@38025: *** . . Const ( Not) neuper@38025: *** . . . Const ( op =) neuper@38025: *** . . . . Var ((k, 0), ) neuper@38025: *** . . . . Const ( 0) neuper@38025: *** . Const ( Trueprop) neuper@38025: *** . . Const ( op =) *** ............. neuper@38025: val SOME t = strip_imp_prems' ((#prop o rep_thm) thm); neuper@38025: atomt t; neuper@38025: *** ------------- neuper@38025: *** Const ( ==>) neuper@38025: *** . Const ( Trueprop) neuper@38025: *** . . Const ( Not) neuper@38025: *** . . . Const ( op =) neuper@38025: *** . . . . Var ((k, 0), ) neuper@38025: *** . . . . Const ( 0) neuper@38025: neuper@38025: val thm = real_le_anti_sym; neuper@38025: val prop = (#prop o rep_thm) thm; neuper@38025: atomt prop; neuper@38025: *** ------------- neuper@38025: *** Const ( ==>) neuper@38025: *** . Const ( Trueprop) neuper@38025: *** . . Const ( op <=) neuper@38025: *** . . . Var ((z, 0), ) neuper@38025: *** . . . Var ((w, 0), ) neuper@38025: *** . Const ( ==>) neuper@38025: *** . . Const ( Trueprop) neuper@38025: *** . . . Const ( op <=) neuper@38025: *** . . . . Var ((w, 0), ) neuper@38025: *** . . . . Var ((z, 0), ) neuper@38025: *** . . Const ( Trueprop) neuper@38025: *** . . . Const ( op =) neuper@38025: *** ............. neuper@38025: val SOME t = strip_imp_prems' ((#prop o rep_thm) thm); neuper@38025: atomt t; neuper@38025: *** ------------- neuper@38025: *** Const ( ==>) neuper@38025: *** . Const ( Trueprop) neuper@38025: *** . . Const ( op <=) neuper@38025: *** . . . Var ((z, 0), ) neuper@38025: *** . . . Var ((w, 0), ) neuper@38025: *** . Const ( ==>) neuper@38025: *** . . Const ( Trueprop) neuper@38025: *** . . . Const ( op <=) neuper@38025: *** . . . . Var ((w, 0), ) neuper@38025: *** . . . . Var ((z, 0), ) neuper@38025: *) neuper@38025: neuper@38025: (*. (A1==>...An==>) (B) goes to (A1==>...An==>B), where B is lowest branch.*) neuper@38025: fun ins_concl (Const("==>", T) $ A $ t) B = Logic.implies $ A $ (ins_concl t B) neuper@38025: | ins_concl (Const("==>", T) $ A ) B = Logic.implies $ A $ B neuper@38025: | ins_concl t B = raise TERM("ins_concl", [t, B]); neuper@38025: (* neuper@38025: val thm = real_le_anti_sym; neuper@38025: val prop = (#prop o rep_thm) thm; neuper@38025: val concl = Logic.strip_imp_concl prop; neuper@38025: val SOME prems = strip_imp_prems' prop; neuper@38025: val prop' = ins_concl prems concl; neuper@38025: prop = prop'; neuper@38025: atomt prop; neuper@38025: atomt prop'; neuper@38025: *) neuper@38025: neuper@38025: neuper@38025: fun vperm (Var _, Var _) = true (*2002 Pure/thm.ML *) neuper@38025: | vperm (Abs (_, _, s), Abs (_, _, t)) = vperm (s, t) neuper@38025: | vperm (t1 $ t2, u1 $ u2) = vperm (t1, u1) andalso vperm (t2, u2) neuper@38025: | vperm (t, u) = (t = u); neuper@38025: neuper@38025: (*2002 cp from Pure/term.ML --- since 2009 in Pure/old_term.ML*) neuper@38025: fun mem_term (_, []) = false neuper@38025: | mem_term (t, t'::ts) = t aconv t' orelse mem_term(t,ts); neuper@38025: fun subset_term ([], ys) = true neuper@38025: | subset_term (x :: xs, ys) = mem_term (x, ys) andalso subset_term(xs, ys); neuper@38025: fun eq_set_term (xs, ys) = neuper@38025: xs = ys orelse (subset_term (xs, ys) andalso subset_term (ys, xs)); neuper@38025: (*a total, irreflexive ordering on index names*) neuper@38025: fun xless ((a,i), (b,j): indexname) = i insert_aterm(t,vars) neuper@38025: | Abs (_,_,body) => add_term_vars(body,vars) neuper@38025: | f$t => add_term_vars (f, add_term_vars(t, vars)) neuper@38025: | _ => vars; neuper@38025: fun term_vars t = add_term_vars(t,[]); neuper@38025: neuper@38025: neuper@38025: fun var_perm (t, u) = (*2002 Pure/thm.ML *) neuper@38025: vperm (t, u) andalso eq_set_term (term_vars t, term_vars u); neuper@38025: neuper@38025: (*2002 fun decomp_simp, Pure/thm.ML *) neuper@38025: fun perm lhs rhs = var_perm (lhs, rhs) andalso not (lhs aconv rhs) neuper@38025: andalso not (is_Var lhs); neuper@38025: neuper@38025: neuper@38025: fun str_of_int n = neuper@38025: if n < 0 then "-"^((string_of_int o abs) n) neuper@38025: else string_of_int n; neuper@38025: (* neuper@38025: > str_of_int 1; neuper@38025: val it = "1" : string > str_of_int ~1; neuper@38025: val it = "-1" : string neuper@38025: *) neuper@38025: neuper@38025: neuper@38025: fun power b 0 = 1 neuper@38025: | power b n = neuper@38025: if n>0 then b*(power b (n-1)) neuper@38031: else error ("power "^(str_of_int b)^" "^(str_of_int n)); neuper@38025: (* neuper@38025: > power 2 3; neuper@38025: val it = 8 : int neuper@38025: > power ~2 3; neuper@38025: val it = ~8 : int neuper@38025: > power ~3 2; neuper@38025: val it = 9 : int neuper@38025: > power 3 ~2; neuper@38025: *) neuper@38025: fun gcd 0 b = b neuper@38025: | gcd a b = if a < b then gcd (b mod a) a neuper@38025: else gcd (a mod b) b; neuper@38025: fun sign n = if n < 0 then ~1 neuper@38025: else if n = 0 then 0 else 1; neuper@38025: fun sign2 n1 n2 = (sign n1) * (sign n2); neuper@38025: neuper@38025: infix dvd; neuper@38025: fun d dvd n = n mod d = 0; neuper@38025: neuper@38025: fun divisors n = neuper@38025: let fun pdiv ds d n = neuper@38025: if d=n then d::ds neuper@38025: else if d dvd n then pdiv (d::ds) d (n div d) neuper@38025: else pdiv ds (d+1) n neuper@38025: in pdiv [] 2 n end; neuper@38025: neuper@38025: divisors 30; neuper@38025: divisors 32; neuper@38025: divisors 60; neuper@38025: divisors 11; neuper@38025: neuper@38025: fun doubles ds = (* ds is ordered *) neuper@38025: let fun dbls ds [] = ds neuper@38025: | dbls ds [i] = ds neuper@38025: | dbls ds (i::i'::is) = if i=i' then dbls (i::ds) is neuper@38025: else dbls ds (i'::is) neuper@38025: in dbls [] ds end; neuper@38025: (*> doubles [2,3,4]; neuper@38025: val it = [] : int list neuper@38025: > doubles [2,3,3,5,5,7]; neuper@38025: val it = [5,3] : int list*) neuper@38025: neuper@38025: fun squfact 0 = 0 neuper@38025: | squfact 1 = 1 neuper@38025: | squfact n = foldl op* (1, (doubles o divisors) n); neuper@38025: (*> squfact 30; neuper@38025: val it = 1 : int neuper@38025: > squfact 32; neuper@38025: val it = 4 : int neuper@38025: > squfact 60; neuper@38025: val it = 2 : int neuper@38025: > squfact 11; neuper@38025: val it = 1 : int*) neuper@38025: neuper@38025: neuper@38025: fun dest_type (Type(T,[])) = T neuper@38025: | dest_type T = neuper@38025: (atomtyp T; neuper@38031: error ("... dest_type: not impl. for this type")); neuper@38025: neuper@38025: fun term_of_num ntyp n = Free (str_of_int n, ntyp); neuper@38025: neuper@38025: fun pairT T1 T2 = Type ("*", [T1, T2]); neuper@38025: (*> val t = str2term "(1,2)"; neuper@38025: > type_of t = pairT HOLogic.realT HOLogic.realT; neuper@38025: val it = true : bool neuper@38025: *) neuper@38025: fun PairT T1 T2 = ([T1, T2] ---> Type ("*", [T1, T2])); neuper@38025: (*> val t = str2term "(1,2)"; neuper@38025: > val Const ("Pair",pT) $ _ $ _ = t; neuper@38025: > pT = PairT HOLogic.realT HOLogic.realT; neuper@38025: val it = true : bool neuper@38025: *) neuper@38025: fun pairt t1 t2 = neuper@38025: Const ("Pair", PairT (type_of t1) (type_of t2)) $ t1 $ t2; neuper@38025: (*> val t = str2term "(1,2)"; neuper@38025: > val (t1, t2) = (str2term "1", str2term "2"); neuper@38025: > t = pairt t1 t2; neuper@38025: val it = true : bool*) neuper@38025: neuper@38025: neuper@38025: fun num_of_term (t as Free (s,_)) = neuper@38025: (case int_of_str s of neuper@38025: SOME s' => s' neuper@38031: | NONE => error ("num_of_term not for "^ term2str t)) neuper@38031: | num_of_term t = error ("num_of_term not for "^term2str t); neuper@38025: neuper@38025: fun mk_factroot op_(*=thy.sqrt*) T fact root = neuper@38034: Const ("Groups.times_class.times", [T, T] ---> T) $ (term_of_num T fact) $ neuper@38025: (Const (op_, T --> T) $ term_of_num T root); neuper@38025: (* neuper@38025: val T = (type_of o term_of o the) (parse thy "#12::real"); neuper@38025: val t = mk_factroot "SqRoot.sqrt" T 2 3; neuper@38025: (cterm_of thy) t; neuper@38025: val it = "#2 * sqrt #3 " : cterm neuper@38025: *) neuper@38025: fun var_op_num v op_ optype ntyp n = neuper@38025: Const (op_, optype) $ v $ neuper@38025: Free (str_of_int n, ntyp); neuper@38025: neuper@38025: fun num_op_var v op_ optype ntyp n = neuper@38025: Const (op_,optype) $ neuper@38025: Free (str_of_int n, ntyp) $ v; neuper@38025: neuper@38025: fun num_op_num T1 T2 (op_,Top) n1 n2 = neuper@38025: Const (op_,Top) $ neuper@38025: Free (str_of_int n1, T1) $ Free (str_of_int n2, T2); neuper@38025: (* neuper@38025: > val t = num_op_num "Int" 3 4; neuper@38025: > atomty t; neuper@38025: > string_of_cterm ((cterm_of thy) t); neuper@38025: *) neuper@38025: neuper@38025: fun const_in str (Const _) = false neuper@38025: | const_in str (Free (s,_)) = if strip_thy s = str then true else false neuper@38025: | const_in str (Bound _) = false neuper@38025: | const_in str (Var _) = false neuper@38025: | const_in str (Abs (_,_,body)) = const_in str body neuper@38025: | const_in str (f$u) = const_in str f orelse const_in str u; neuper@38025: (* neuper@38025: > val t = (term_of o the o (parse thy)) "6 + 5 * sqrt 4 + 3"; neuper@38025: > const_in "sqrt" t; neuper@38025: val it = true : bool neuper@38025: > val t = (term_of o the o (parse thy)) "6 + 5 * 4 + 3"; neuper@38025: > const_in "sqrt" t; neuper@38025: val it = false : bool neuper@38025: *) neuper@38025: neuper@38025: (*used for calculating built in binary operations in Isabelle2002->Float.ML*) neuper@38025: (*fun calc "Groups.plus_class.plus" (n1, n2) = n1+n2 neuper@38025: | calc "Groups.minus_class.minus" (n1, n2) = n1-n2 neuper@38034: | calc "Groups.times_class.times" (n1, n2) = n1*n2 neuper@38025: | calc "Rings.inverse_class.divide"(n1, n2) = n1 div n2 neuper@38025: | calc "Atools.pow"(n1, n2) = power n1 n2 neuper@38031: | calc op_ _ = error ("calc: operator = "^op_^" not defined");-----*) neuper@38025: fun calc_equ "op <" (n1, n2) = n1 < n2 neuper@38025: | calc_equ "op <=" (n1, n2) = n1 <= n2 neuper@38025: | calc_equ op_ _ = neuper@38031: error ("calc_equ: operator = "^op_^" not defined"); neuper@38025: fun sqrt (n:int) = if n < 0 then 0 neuper@38025: (*FIXME ~~~*) else (trunc o Math.sqrt o Real.fromInt) n; neuper@38025: neuper@38025: fun mk_thmid thmid op_ n1 n2 = neuper@38025: thmid ^ (strip_thy n1) ^ "_" ^ (strip_thy n2); neuper@38025: neuper@38025: fun dest_binop_typ (Type("fun",[range,Type("fun",[arg2,arg1])])) = neuper@38025: (arg1,arg2,range) neuper@38031: | dest_binop_typ _ = error "dest_binop_typ: not binary"; neuper@38025: (* ----- neuper@38025: > val t = (term_of o the o (parse thy)) "#3^#4"; neuper@38025: > val hT = type_of (head_of t); neuper@38025: > dest_binop_typ hT; neuper@38025: val it = ("'a","nat","'a") : typ * typ * typ neuper@38025: ----- *) neuper@38025: neuper@38025: neuper@38025: (** transform binary numeralsstrings **) neuper@38025: (*Makarius 100308, hacked by WN*) neuper@38025: val numbers_to_string = neuper@38025: let neuper@38025: fun dest_num t = neuper@38025: (case try HOLogic.dest_number t of neuper@38025: SOME (T, i) => neuper@38025: (*if T = @{typ int} orelse T = @{typ real} then WN*) neuper@38025: SOME (Free (signed_string_of_int i, T)) neuper@38025: (*else NONE WN*) neuper@38025: | NONE => NONE); neuper@38025: neuper@38025: fun to_str (Abs (x, T, b)) = Abs (x, T, to_str b) neuper@38025: | to_str (t as (u1 $ u2)) = neuper@38025: (case dest_num t of neuper@38025: SOME t' => t' neuper@38025: | NONE => to_str u1 $ to_str u2) neuper@38025: | to_str t = perhaps dest_num t; neuper@38025: in to_str end neuper@38025: neuper@38025: (*.make uminus uniform: neuper@38025: Const ("uminus", _) $ Free ("2", "RealDef.real") --> Free ("-2", _) neuper@38025: to be used immediately before evaluation of numerals; neuper@38025: see Scripts/calculate.sml .*) neuper@38025: (*2002 fun(*app_num_tr'2 (Const("0",T)) = Free("0",T) neuper@38025: | app_num_tr'2 (Const("1",T)) = Free("1",T) neuper@38025: |*)app_num_tr'2 (t as Const("uminus",_) $ Free(s,T)) = neuper@38025: (case int_of_str s of SOME i => neuper@38025: if i > 0 then Free("-"^s,T) else Free(s,T) neuper@38025: | NONE => t) neuper@38025: (*| app_num_tr'2 (t as Const(s,T)) = t neuper@38025: | app_num_tr'2 (Const("Numeral.number_of",Type ("fun", [_, T])) $ t) = neuper@38025: Free(NumeralSyntax.dest_bin_str t, T) neuper@38025: | app_num_tr'2 (t as Free(s,T)) = t neuper@38025: | app_num_tr'2 (t as Var(n,T)) = t neuper@38025: | app_num_tr'2 (t as Bound i) = t neuper@38025: *)| app_num_tr'2 (Abs(s,T,body)) = Abs(s,T, app_num_tr'2 body) neuper@38025: | app_num_tr'2 (t1 $ t2) = (app_num_tr'2 t1) $ (app_num_tr'2 t2) neuper@38025: | app_num_tr'2 t = t; neuper@38025: *) neuper@38025: val uminus_to_string = neuper@38025: let neuper@38025: fun dest_num t = neuper@38025: (case t of neuper@38025: (Const ("Groups.uminus_class.uminus", _) $ Free (s, T)) => neuper@38025: (case int_of_str s of neuper@38025: SOME i => neuper@38025: SOME (Free (signed_string_of_int (~1 * i), T)) neuper@38025: | NONE => NONE) neuper@38025: | _ => NONE); neuper@38025: neuper@38025: fun to_str (Abs (x, T, b)) = Abs (x, T, to_str b) neuper@38025: | to_str (t as (u1 $ u2)) = neuper@38025: (case dest_num t of neuper@38025: SOME t' => t' neuper@38025: | NONE => to_str u1 $ to_str u2) neuper@38025: | to_str t = perhaps dest_num t; neuper@38025: in to_str end; neuper@38025: neuper@38025: neuper@38025: (*2002 fun num_str thm = neuper@38025: let neuper@38025: val {sign_ref = sign_ref, der = der, maxidx = maxidx, neuper@38025: shyps = shyps, hyps = hyps, (*tpairs = tpairs,*) prop = prop} = neuper@38025: rep_thm_G thm; neuper@38025: val prop' = app_num_tr'1 prop; neuper@38025: in assbl_thm sign_ref der maxidx shyps hyps (*tpairs*) prop' end;*) neuper@38025: fun num_str thm = neuper@38025: let val (deriv, neuper@38025: {thy_ref = thy_ref, tags = tags, maxidx = maxidx, shyps = shyps, neuper@38025: hyps = hyps, tpairs = tpairs, prop = prop}) = rep_thm_G thm neuper@38025: val prop' = numbers_to_string prop; neuper@38025: in assbl_thm deriv thy_ref tags maxidx shyps hyps tpairs prop' end; neuper@38025: neuper@38025: fun get_thm' xstring = (*?covers 2009 Thm?!, replaces 2002 fun get_thm : neuper@38025: val it = fn : theory -> xstring -> Thm.thm*) neuper@38025: Thm (xstring, neuper@38025: num_str (ProofContext.get_thm (thy2ctxt' "Isac") xstring)); neuper@38025: neuper@38025: (** get types of Free and Abs for parse' **) neuper@38025: (*11.1.00: not used, fix-typed +,*,-,^ instead *) neuper@38025: neuper@38025: val dummyT = Type ("dummy",[]); neuper@38025: val dummyT = TVar (("DUMMY",0),[]); neuper@38025: neuper@38025: (* assumes only 1 type for numerals neuper@38025: and different identifiers for Const, Free and Abs *) neuper@38025: fun get_types t = neuper@38025: let neuper@38025: fun get ts (Const(s,T)) = (s,T)::ts neuper@38025: | get ts (Free(s,T)) = if is_no s neuper@38025: then ("#",T)::ts else (s,T)::ts neuper@38025: | get ts (Var(n,T)) = ts neuper@38025: | get ts (Bound i) = ts neuper@38025: | get ts (Abs(s,T,body)) = get ((s,T)::ts) body neuper@38025: | get ts (t1 $ t2) = (get ts t1) @ (get ts t2) neuper@38025: in distinct (get [] t) end; neuper@38025: (* neuper@38025: val t = (term_of o the o (parse thy)) "sqrt(#9+#4*x)=sqrt x + sqrt(#-3+x)"; neuper@38025: get_types t; neuper@38025: *) neuper@38025: neuper@38025: (*11.1.00: not used, fix-typed +,*,-,^ instead *) neuper@38025: fun set_types al (Const(s,T)) = neuper@38025: (case assoc (al,s) of neuper@38025: SOME T' => Const(s,T') neuper@38025: | NONE => (warning ("set_types: no type for "^s); Const(s,dummyT))) neuper@38025: | set_types al (Free(s,T)) = neuper@38025: if is_no s then neuper@38025: (case assoc (al,"#") of neuper@38025: SOME T' => Free(s,T') neuper@38025: | NONE => (warning ("set_types: no type for numerals"); Free(s,T))) neuper@38025: else (case assoc (al,s) of neuper@38025: SOME T' => Free(s,T') neuper@38025: | NONE => (warning ("set_types: no type for "^s); Free(s,T))) neuper@38025: | set_types al (Var(n,T)) = Var(n,T) neuper@38025: | set_types al (Bound i) = Bound i neuper@38025: | set_types al (Abs(s,T,body)) = neuper@38025: (case assoc (al,s) of neuper@38025: SOME T' => Abs(s,T', set_types al body) neuper@38025: | NONE => (warning ("set_types: no type for "^s); neuper@38025: Abs(s,T, set_types al body))) neuper@38025: | set_types al (t1 $ t2) = (set_types al t1) $ (set_types al t2); neuper@38025: (* neuper@38025: val t = (term_of o the o (parse thy)) "sqrt(#9+#4*x)=sqrt x + sqrt(#-3+x)"; neuper@38025: val al = get_types t; neuper@38025: neuper@38025: val t = (term_of o the o (parse thy)) "x = #0 + #-1 * #-4"; neuper@38025: atomty t; (* 'a *) neuper@38025: val t' = set_types al t; neuper@38025: atomty t'; (*real*) neuper@38025: (cterm_of thy) t'; neuper@38025: val it = "x = #0 + #-1 * #-4" : cterm neuper@38025: neuper@38025: val t = (term_of o the o (parse thy)) neuper@38025: "#5 * x + x ^^^ #2 = (#2 + x) ^^^ #2"; neuper@38025: atomty t; neuper@38025: val t' = set_types al t; neuper@38025: atomty t'; neuper@38025: (cterm_of thy) t'; neuper@38025: uncaught exception TYPE (*^^^ is new, NOT in al*) neuper@38025: *) neuper@38025: neuper@38025: neuper@38025: (** from Descript.ML **) neuper@38025: neuper@38025: (** decompose an isa-list to an ML-list neuper@38025: i.e. [] belong to the meta-language, too **) neuper@38025: neuper@38025: fun is_list ((Const("List.list.Cons",_)) $ _ $ _) = true neuper@38025: | is_list _ = false; neuper@38025: (* val (SOME ct) = parse thy "lll::real list"; neuper@38025: > val ty = (#t o rep_cterm) ct; neuper@38025: > is_list ty; neuper@38025: val it = false : bool neuper@38025: > val (SOME ct) = parse thy "[lll]"; neuper@38025: > val ty = (#t o rep_cterm) ct; neuper@38025: > is_list ty; neuper@38025: val it = true : bool *) neuper@38025: neuper@38025: neuper@38025: neuper@38025: fun mk_Free (s,T) = Free(s,T); neuper@38025: fun mk_free T s = Free(s,T); neuper@38025: neuper@38025: (*Special case: one argument cp from Isabelle2002/src/Pure/term.ML*) neuper@38025: fun subst_bound (arg, t) : term = (*WN100908 neglects 'raise Same.SAME'*) neuper@38025: let fun subst (t as Bound i, lev) = neuper@38025: if i val ttt = (term_of o the o (parse thy)) scr; neuper@38025: > tracing(term2str ttt); neuper@38025: > atomt ttt; neuper@38025: *** ------------- neuper@38025: *** Const ( DiffApp.Make'_fun'_by'_explicit) neuper@38025: *** . Free ( f_, ) neuper@38025: *** . Free ( v_, ) neuper@38025: *** . Free ( eqs_, ) neuper@38025: *** . Const ( Let) neuper@38025: *** . . Const ( Fun.op o) neuper@38025: *** . . . Const ( List.hd) neuper@38025: *** . . . Const ( DiffApp.filterVar) neuper@38025: *** . . . . Free ( f_, ) neuper@38025: *** . . . Free ( eqs_, ) neuper@38025: *** . . Abs( h_,.. neuper@38025: *** . . . Const ( Let) neuper@38025: *** . . . . Const ( List.hd) neuper@38025: *** . . . . . Const ( List.dropWhile) neuper@38025: *** . . . . . . Const ( Atools.ident) neuper@38025: *** . . . . . . . Bound 0 <---- Free ( h_, ) neuper@38025: *** . . . . . . Free ( eqs_, ) neuper@38025: *** . . . . Abs( e_1,.. neuper@38025: *** . . . . . Const ( Let) neuper@38025: *** . . . . . . Const ( List.dropWhile) neuper@38025: *** . . . . . . . Const ( Atools.ident) neuper@38025: *** . . . . . . . . Free ( f_, ) neuper@38025: *** . . . . . . . Const ( Tools.Vars) neuper@38025: *** . . . . . . . . Bound 1 <---- Free ( h_, ) neuper@38025: *** . . . . . . Abs( vs_,.. neuper@38025: *** . . . . . . . Const ( Let) neuper@38025: *** . . . . . . . . Const ( List.hd) neuper@38025: *** . . . . . . . . . Const ( List.dropWhile) neuper@38025: *** . . . . . . . . . . Const ( Atools.ident) neuper@38025: *** . . . . . . . . . . . Free ( v_, ) neuper@38025: *** . . . . . . . . . . Bound 0 <---- Free ( vs_, ) neuper@38025: *** . . . . . . . . Abs( v_1,.. neuper@38025: *** . . . . . . . . . Const ( Let) neuper@38025: *** . . . . . . . . . . Const ( Script.SubProblem) neuper@38025: *** . . . . . . . . . . . Const ( Pair) neuper@38025: *** . . . . . . . . . . . . Free ( DiffApp_, ) neuper@38025: *** . . . . . . . . . . . . Const ( Pair) neuper@38025: *** . . . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . . . Free ( univar, ) neuper@38025: *** . . . . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . . . . Free ( equation, ) neuper@38025: *** . . . . . . . . . . . . . . . Const ( List.list.Nil) neuper@38025: *** . . . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . . . Free ( no_met, ) neuper@38025: *** . . . . . . . . . . . . . . Const ( List.list.Nil) neuper@38025: *** . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . Const ( Script.BOOL) neuper@38025: *** . . . . . . . . . . . . . Bound 2 <----- Free ( e_1, ) neuper@38025: *** . . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . . Const ( Script.real_) neuper@38025: *** . . . . . . . . . . . . . . Bound 0 <----- Free ( v_1, ) neuper@38025: *** . . . . . . . . . . . . . Const ( List.list.Nil) neuper@38025: *** . . . . . . . . . . Abs( s_1,.. neuper@38025: *** . . . . . . . . . . . Const ( Script.Substitute) neuper@38025: *** . . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . . Const ( Pair) neuper@38025: *** . . . . . . . . . . . . . . Bound 1 <----- Free ( v_1, ) neuper@38025: *** . . . . . . . . . . . . . . Const ( Fun.op o) neuper@38025: *** . . . . . . . . . . . . . . . Const ( Tools.rhs) neuper@38025: *** . . . . . . . . . . . . . . . Const ( List.hd) neuper@38025: *** . . . . . . . . . . . . . . . Bound 0 <----- Free ( s_1, ) neuper@38025: *** . . . . . . . . . . . . . Const ( List.list.Nil) neuper@38025: *** . . . . . . . . . . . . Bound 4 <----- Free ( h_, ) neuper@38025: neuper@38025: > val ttt' = inst_abs thy ttt; neuper@38025: > tracing(term2str ttt'); neuper@38025: Script Make_fun_by_explicit f_ v_ eqs_ = neuper@38025: ... as above ... neuper@38025: > atomt ttt'; neuper@38025: *** ------------- neuper@38025: *** Const ( DiffApp.Make'_fun'_by'_explicit) neuper@38025: *** . Free ( f_, ) neuper@38025: *** . Free ( v_, ) neuper@38025: *** . Free ( eqs_, ) neuper@38025: *** . Const ( Let) neuper@38025: *** . . Const ( Fun.op o) neuper@38025: *** . . . Const ( List.hd) neuper@38025: *** . . . Const ( DiffApp.filterVar) neuper@38025: *** . . . . Free ( f_, ) neuper@38025: *** . . . Free ( eqs_, ) neuper@38025: *** . . Abs( h_,.. neuper@38025: *** . . . Const ( Let) neuper@38025: *** . . . . Const ( List.hd) neuper@38025: *** . . . . . Const ( List.dropWhile) neuper@38025: *** . . . . . . Const ( Atools.ident) neuper@38025: *** . . . . . . . Free ( h_, ) <---- Bound 0 neuper@38025: *** . . . . . . Free ( eqs_, ) neuper@38025: *** . . . . Abs( e_1,.. neuper@38025: *** . . . . . Const ( Let) neuper@38025: *** . . . . . . Const ( List.dropWhile) neuper@38025: *** . . . . . . . Const ( Atools.ident) neuper@38025: *** . . . . . . . . Free ( f_, ) neuper@38025: *** . . . . . . . Const ( Tools.Vars) neuper@38025: *** . . . . . . . . Free ( h_, ) <---- Bound 1 neuper@38025: *** . . . . . . Abs( vs_,.. neuper@38025: *** . . . . . . . Const ( Let) neuper@38025: *** . . . . . . . . Const ( List.hd) neuper@38025: *** . . . . . . . . . Const ( List.dropWhile) neuper@38025: *** . . . . . . . . . . Const ( Atools.ident) neuper@38025: *** . . . . . . . . . . . Free ( v_, ) neuper@38025: *** . . . . . . . . . . Free ( vs_, ) <---- Bound 0 neuper@38025: *** . . . . . . . . Abs( v_1,.. neuper@38025: *** . . . . . . . . . Const ( Let) neuper@38025: *** . . . . . . . . . . Const ( Script.SubProblem) neuper@38025: *** . . . . . . . . . . . Const ( Pair) neuper@38025: *** . . . . . . . . . . . . Free ( DiffApp_, ) neuper@38025: *** . . . . . . . . . . . . Const ( Pair) neuper@38025: *** . . . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . . . Free ( univar, ) neuper@38025: *** . . . . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . . . . Free ( equation, ) neuper@38025: *** . . . . . . . . . . . . . . . Const ( List.list.Nil) neuper@38025: *** . . . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . . . Free ( no_met, ) neuper@38025: *** . . . . . . . . . . . . . . Const ( List.list.Nil) neuper@38025: *** . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . Const ( Script.BOOL) neuper@38025: *** . . . . . . . . . . . . . Free ( e_1, ) <----- Bound 2 neuper@38025: *** . . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . . Const ( Script.real_) neuper@38025: *** . . . . . . . . . . . . . . Free ( v_1, ) <----- Bound 0 neuper@38025: *** . . . . . . . . . . . . . Const ( List.list.Nil) neuper@38025: *** . . . . . . . . . . Abs( s_1,.. neuper@38025: *** . . . . . . . . . . . Const ( Script.Substitute) neuper@38025: *** . . . . . . . . . . . . Const ( List.list.Cons) neuper@38025: *** . . . . . . . . . . . . . Const ( Pair) neuper@38025: *** . . . . . . . . . . . . . . Free ( v_1, ) <----- Bound 1 neuper@38025: *** . . . . . . . . . . . . . . Const ( Fun.op o) neuper@38025: *** . . . . . . . . . . . . . . . Const ( Tools.rhs) neuper@38025: *** . . . . . . . . . . . . . . . Const ( List.hd) neuper@38025: *** . . . . . . . . . . . . . . . Free ( s_1, ) <----- Bound 0 neuper@38025: *** . . . . . . . . . . . . . Const ( List.list.Nil) neuper@38025: *** . . . . . . . . . . . . Free ( h_, ) <----- Bound 4 neuper@38025: neuper@38025: Note numbering of de Bruijn indexes ! neuper@38025: neuper@38025: Script Make_fun_by_explicit f_ v_ eqs_ = neuper@38025: let h_ = (hd o filterVar f_) eqs_; neuper@38025: e_1 = hd (dropWhile (ident h_ BOUND_0) eqs_); neuper@38025: vs_ = dropWhile (ident f_) (Vars h_ BOUND_1); neuper@38025: v_1 = hd (dropWhile (ident v_) vs_ BOUND_0); neuper@38025: s_1 = neuper@38025: SubProblem (DiffApp_, [univar, equation], [no_met]) neuper@38025: [BOOL e_1 BOUND_2, REAL v_1 BOUND_0] neuper@38025: in Substitute [(v_1 BOUND_1 = (rhs o hd) s_1 BOUND_0)] h_ BOUND_4 neuper@38025: *) neuper@38025: neuper@38025: neuper@38025: fun T_a2real (Type (s, [])) = neuper@38025: if s = "'a" orelse s = "'b" orelse s = "'c" then HOLogic.realT else Type (s, []) neuper@38025: | T_a2real (Type (s, Ts)) = Type (s, map T_a2real Ts) neuper@38025: | T_a2real (TFree (s, srt)) = neuper@38025: if s = "'a" orelse s = "'b" orelse s = "'c" then HOLogic.realT else TFree (s, srt) neuper@38025: | T_a2real (TVar (("DUMMY",_),srt)) = HOLogic.realT; neuper@38025: neuper@38025: (*FIXME .. fixes the type (+see Typefix.thy*) neuper@38025: fun typ_a2real (Const( s, T)) = (Const( s, T_a2real T)) neuper@38025: | typ_a2real (Free( s, T)) = (Free( s, T_a2real T)) neuper@38025: | typ_a2real (Var( n, T)) = (Var( n, T_a2real T)) neuper@38025: | typ_a2real (Bound i) = (Bound i) neuper@38025: | typ_a2real (Abs(s,T,t)) = Abs(s, T, typ_a2real t) neuper@38025: | typ_a2real (t1 $ t2) = (typ_a2real t1) $ (typ_a2real t2); neuper@38025: (* neuper@38025: ----------------6.8.02--------------------------------------------------- neuper@38025: val str = "1"; neuper@38025: val t = read_cterm (sign_of thy) (str,(TVar(("DUMMY",0),[]))); neuper@38025: atomty (term_of t); neuper@38025: *** ------------- neuper@38025: *** Const ( 1, 'a) neuper@38025: val t = (app_num_tr' o term_of) t; neuper@38025: atomty t; neuper@38025: *** ------------- neuper@38025: *** Const ( 1, 'a) neuper@38025: val t = typ_a2real t; neuper@38025: atomty t; neuper@38025: *** ------------- neuper@38025: *** Const ( 1, real) neuper@38025: neuper@38025: val str = "2"; neuper@38025: val t = read_cterm (sign_of thy) (str,(TVar(("DUMMY",0),[]))); neuper@38025: atomty (term_of t); neuper@38025: *** ------------- neuper@38025: *** Const ( Numeral.number_of, bin => 'a) neuper@38025: *** . Const ( Numeral.bin.Bit, [bin, bool] => bin) neuper@38025: *** . . Const ( Numeral.bin.Bit, [bin, bool] => bin) neuper@38025: *** . . . Const ( Numeral.bin.Pls, bin) neuper@38025: *** . . . Const ( True, bool) neuper@38025: *** . . Const ( False, bool) neuper@38025: val t = (app_num_tr' o term_of) t; neuper@38025: atomty t; neuper@38025: *** ------------- neuper@38025: *** Free ( 2, 'a) neuper@38025: val t = typ_a2real t; neuper@38025: atomty t; neuper@38025: *** ------------- neuper@38025: *** Free ( 2, real) neuper@38025: ----------------6.8.02--------------------------------------------------- neuper@38025: neuper@38025: neuper@38025: > val str = "R"; neuper@38025: > val t = term_of (read_cterm(sign_of thy)(str,(TVar(("DUMMY",0),[])))); neuper@38025: val t = Free ("R","?DUMMY") : term neuper@38025: > val t' = typ_a2real t; neuper@38025: > (cterm_of thy) t'; neuper@38025: val it = "R::RealDef.real" : cterm neuper@38025: neuper@38025: > val str = "R=R"; neuper@38025: > val t = term_of (read_cterm(sign_of thy)(str,(TVar(("DUMMY",0),[])))); neuper@38025: > atomty (typ_a2real t); neuper@38025: *** ------------- neuper@38025: *** Const ( op =, [RealDef.real, RealDef.real] => bool) neuper@38025: *** Free ( R, RealDef.real) neuper@38025: *** Free ( R, RealDef.real) neuper@38025: > val t' = typ_a2real t; neuper@38025: > (cterm_of thy) t'; neuper@38025: val it = "(R::RealDef.real) = R" : cterm neuper@38025: neuper@38025: > val str = "fixed_values [R=R]"; neuper@38025: > val t = term_of (read_cterm(sign_of thy)(str,(TVar(("DUMMY",0),[])))); neuper@38025: > val t' = typ_a2real t; neuper@38025: > (cterm_of thy) t'; neuper@38025: val it = "fixed_values [(R::RealDef.real) = R]" : cterm neuper@38025: *) neuper@38025: neuper@38025: (*TODO.WN0609: parse should return a term or a string neuper@38025: (or even more comprehensive datastructure for error-messages) neuper@38025: i.e. in wrapping with SOME term or NONE the latter is not sufficient*) neuper@38025: (*2002 fun parseold thy str = neuper@38025: (let neuper@38025: val sgn = sign_of thy; neuper@38025: val t = ((*typ_a2real o*) app_num_tr'1 o term_of) neuper@38025: (read_cterm sgn (str,(TVar(("DUMMY",0),[])))); neuper@38025: in SOME (cterm_of sgn t) end) neuper@38025: handle _ => NONE;*) neuper@38025: neuper@38025: neuper@38025: neuper@38025: fun parseold thy str = neuper@38025: (let val t = ((*typ_a2real o*) numbers_to_string) neuper@38025: (Syntax.read_term_global thy str) neuper@38025: in SOME (cterm_of thy t) end) neuper@38025: handle _ => NONE; neuper@38025: (*2002 fun parseN thy str = neuper@38025: (let neuper@38025: val sgn = sign_of thy; neuper@38025: val t = ((*typ_a2real o app_num_tr'1 o*) term_of) neuper@38025: (read_cterm sgn (str,(TVar(("DUMMY",0),[])))); neuper@38025: in SOME (cterm_of sgn t) end) neuper@38025: handle _ => NONE;*) neuper@38025: fun parseN thy str = neuper@38025: (let val t = (*(typ_a2real o numbers_to_string)*) neuper@38025: (Syntax.read_term_global thy str) neuper@38025: in SOME (cterm_of thy t) end) neuper@38025: handle _ => NONE; neuper@38025: (*2002 fun parse thy str = neuper@38025: (let neuper@38025: val sgn = sign_of thy; neuper@38025: val t = (typ_a2real o app_num_tr'1 o term_of) neuper@38025: (read_cterm sgn (str,(TVar(("DUMMY",0),[])))); neuper@38025: in SOME (cterm_of sgn t) end) (*FIXXXXME 10.8.02: return term !!!*) neuper@38025: handle _ => NONE;*) neuper@38025: (*2010 fun parse thy str = neuper@38025: (let val t = (typ_a2real o app_num_tr'1) (Syntax.read_term_global thy str) neuper@38025: in SOME (cterm_of thy t) end) (*FIXXXXME 10.8.02: return term !!!*) neuper@38025: handle _ => NONE;*) neuper@38025: fun parse thy str = neuper@38025: (let val t = (typ_a2real o numbers_to_string) neuper@38025: (Syntax.read_term_global thy str) neuper@38025: in SOME (cterm_of thy t) end) (*FIXXXXME 10.8.02: return term !!!*) neuper@38025: handle _ => NONE; neuper@38025: (* neuper@38025: > val (SOME ct) = parse thy "(-#5)^^^#3"; neuper@38025: > atomty (term_of ct); neuper@38025: *** ------------- neuper@38025: *** Const ( Nat.op ^, ['a, nat] => 'a) neuper@38025: *** Const ( uminus, 'a => 'a) neuper@38025: *** Free ( #5, 'a) neuper@38025: *** Free ( #3, nat) neuper@38025: > val (SOME ct) = parse thy "R=R"; neuper@38025: > atomty (term_of ct); neuper@38025: *** ------------- neuper@38025: *** Const ( op =, [real, real] => bool) neuper@38025: *** Free ( R, real) neuper@38025: *** Free ( R, real) neuper@38025: neuper@38025: THIS IS THE OUTPUT FOR VERSION (3) above at typ_a2real !!!!! neuper@38025: *** ------------- neuper@38025: *** Const ( op =, [RealDef.real, RealDef.real] => bool) neuper@38025: *** Free ( R, RealDef.real) neuper@38025: *** Free ( R, RealDef.real) *) neuper@38025: neuper@38025: fun parse_patt thy str = neuper@38025: ProofContext.read_term_pattern (thy2ctxt thy) str; neuper@38025: neuper@38025: (*version for testing local to theories*) neuper@38025: fun str2term_ thy str = (term_of o the o (parse thy)) str; neuper@38025: fun str2term str = (term_of o the o (parse (theory "Isac"))) str; neuper@38025: fun strs2terms ss = map str2term ss; neuper@38025: fun str2termN str = (term_of o the o (parseN (theory "Isac"))) str; neuper@38025: neuper@38025: (*+ makes a substitution from the output of Pattern.match +*) neuper@38025: (*fun mk_subs ((id, _):indexname, t:term) = (Free (id,type_of t), t);*) neuper@38025: fun mk_subs (subs: ((string * int) * (Term.typ * Term.term)) list) = neuper@38025: let fun mk_sub ((id, _), (ty, tm)) = (Free (id, ty), tm) in neuper@38025: map mk_sub subs end; neuper@38025: neuper@38025: val atomthm = atomt o #prop o rep_thm; neuper@38025: neuper@38025: (*.instantiate #prop thm with bound variables (as Free).*) neuper@38025: fun inst_bdv [] t = t : term neuper@38025: | inst_bdv (instl: (term*term) list) t = neuper@38025: let fun subst (v as Var((s,_),T)) = neuper@38025: (case explode s of neuper@38025: "b"::"d"::"v"::_ => neuper@38025: if_none (assoc(instl,Free(s,T))) (Free(s,T)) neuper@38025: | _ => v) neuper@38025: | subst (Abs(a,T,body)) = Abs(a, T, subst body) neuper@38025: | subst (f$t') = subst f $ subst t' neuper@38025: | subst t = if_none (assoc(instl,t)) t neuper@38025: in subst t end; neuper@38025: neuper@38025: neuper@38025: (*WN050829 caution: is_atom (str2term"q_0/2 * L * x") = true !!! neuper@38025: use length (vars term) = 1 instead*) neuper@38025: fun is_atom (Const ("Float.Float",_) $ _) = true neuper@38025: | is_atom (Const ("ComplexI.I'_'_",_)) = true neuper@38034: | is_atom (Const ("Groups.times_class.times",_) $ t $ Const ("ComplexI.I'_'_",_)) = is_atom t neuper@38025: | is_atom (Const ("Groups.plus_class.plus",_) $ t1 $ Const ("ComplexI.I'_'_",_)) = is_atom t1 neuper@38025: | is_atom (Const ("Groups.plus_class.plus",_) $ t1 $ neuper@38034: (Const ("Groups.times_class.times",_) $ t2 $ Const ("ComplexI.I'_'_",_))) = neuper@38025: is_atom t1 andalso is_atom t2 neuper@38025: | is_atom (Const _) = true neuper@38025: | is_atom (Free _) = true neuper@38025: | is_atom (Var _) = true neuper@38025: | is_atom _ = false; neuper@38025: (* val t = str2term "q_0/2 * L * x"; neuper@38025: neuper@38025: neuper@38025: *) neuper@38025: (*val t = str2term "Float ((1,2),(0,0))"; neuper@38025: > is_atom t; neuper@38025: val it = true : bool neuper@38025: > val t = str2term "Float ((1,2),(0,0)) * I__"; neuper@38025: > is_atom t; neuper@38025: val it = true : bool neuper@38025: > val t = str2term "Float ((1,2),(0,0)) + Float ((3,4),(0,0)) * I__"; neuper@38025: > is_atom t; neuper@38025: val it = true : bool neuper@38025: > val t = str2term "1 + 2*I__"; neuper@38034: > val Const ("Groups.plus_class.plus",_) $ t1 $ (Const ("Groups.times_class.times",_) $ t2 $ Const ("ComplexI.I'_'_",_)) = t; neuper@38025: *) neuper@38025: neuper@38025: (*.adaption from Isabelle/src/Pure/term.ML; reports if ALL Free's neuper@38025: have found a substitution (required for evaluating the preconditions neuper@38025: of _incomplete_ models).*) neuper@38025: fun subst_atomic_all [] t = (false, (*TODO may be 'true' for some terms ?*) neuper@38025: t : term) neuper@38025: | subst_atomic_all (instl: (term*term) list) t = neuper@38025: let fun subst (Abs(a,T,body)) = neuper@38025: let val (all, body') = subst body neuper@38025: in (all, Abs(a, T, body')) end neuper@38025: | subst (f$tt) = neuper@38025: let val (all1, f') = subst f neuper@38025: val (all2, tt') = subst tt neuper@38025: in (all1 andalso all2, f' $ tt') end neuper@38025: | subst (t as Free _) = neuper@38025: if is_num t then (true, t) (*numerals cannot be subst*) neuper@38025: else (case assoc(instl,t) of neuper@38025: SOME t' => (true, t') neuper@38025: | NONE => (false, t)) neuper@38025: | subst t = (true, if_none (assoc(instl,t)) t) neuper@38025: in subst t end; neuper@38025: neuper@38025: (*.add two terms with a type given.*) neuper@38025: fun mk_add t1 t2 = neuper@38025: let val T1 = type_of t1 neuper@38025: val T2 = type_of t2 neuper@38025: in if T1 <> T2 then raise TYPE ("mk_add gets ",[T1, T2],[t1,t2]) neuper@38025: else (Const ("Groups.plus_class.plus", [T1, T2] ---> T1) $ t1 $ t2) neuper@38025: end; neuper@38025: