neuper@37906: (* isac's rewriter neuper@37906: (c) Walther Neuper 2000 neuper@37906: *) neuper@37906: wneuper@59380: signature REWRITE = walther@59901: sig walther@60269: exception NO_REWRITE walther@59919: val calculate_: theory -> string * Eval_Def.eval_fn -> term -> (term * (string * thm)) option walther@59901: val eval__true: theory -> int -> term list -> (term * term) list -> Rule_Set.T -> term list * bool walther@59901: val eval_prog_expr: theory -> Rule_Set.T -> term -> term walther@59901: val eval_true_: theory -> Rule_Set.T -> term -> bool walther@59901: val eval_true: theory -> term list -> Rule_Set.T -> bool walther@59907: val rew_sub: theory -> int -> (term * term) list -> Rule_Def.rew_ord_ walther@59901: -> Rule_Set.T -> bool -> TermC.path -> term -> term -> term * term list * TermC.path * bool walther@59907: val rewrite_: theory -> Rule_Def.rew_ord_ -> Rule_Set.T -> bool -> thm -> walther@59901: term -> (term * term list) option walther@59907: val rewrite_inst_: theory -> Rule_Def.rew_ord_ -> Rule_Set.T -> bool walther@59901: -> (term * term) list -> thm -> term -> (term * term list) option walther@59901: val rewrite_set_: theory -> bool -> Rule_Set.T -> term -> (term * term list) option walther@59901: val rewrite_set_inst_: theory -> bool -> (term * term) list -> Rule_Set.T -> term -> (term * term list) option walther@59907: val rewrite_terms_: theory -> Rule_Def.rew_ord_ -> Rule_Set.T -> term list walther@59901: -> term -> (term * term list) option walther@59901: walther@59901: val trace_on: bool Unsynchronized.ref walther@59901: val depth: int Unsynchronized.ref walther@59901: val lim_deriv: int Unsynchronized.ref walther@59901: wenzelm@60223: \<^isac_test>\ walther@59907: val rewrite__: theory -> int -> (term * term) list -> Rule_Def.rew_ord_ -> walther@59901: Rule_Set.T -> bool -> thm -> term -> (term * term list) option walther@59901: val rewrite__set_: theory -> int -> bool -> (term * term) list -> Rule_Set.T -> term -> (term * term list) option walther@59901: val app_rev: theory -> int -> Rule_Set.T -> term -> term * term list * bool walther@59901: val app_sub: theory -> int -> Rule_Set.T -> term -> term * term list * bool walther@59901: val trace1: int -> string -> unit walther@60262: val trace_eq1 : int -> string -> Rule_Def.rule_set -> theory -> term -> unit; walther@60262: val trace_eq2 : int -> string -> theory -> term -> term -> unit; walther@60262: val trace_in1 : int -> string -> string -> unit; walther@60262: val trace_in2 : int -> string -> theory -> term -> unit; walther@60262: val trace_in3 : int -> string -> theory -> (term * 'a) option -> unit; walther@60262: val trace_in4 : int -> string -> theory -> term list -> term list -> unit; walther@60262: val trace_in5 : int -> string -> theory -> term list -> unit; wenzelm@60223: \ walther@59901: end wneuper@59380: wneuper@59380: (**) wneuper@59380: structure Rewrite(**): REWRITE(**) = wneuper@59380: struct wneuper@59380: (**) neuper@37906: neuper@37906: exception NO_REWRITE; neuper@37906: walther@59901: val trace_on = Unsynchronized.ref false; walther@59901: (* depth of recursion in traces of the rewriter, if trace_on:=true *) walther@59901: val depth = Unsynchronized.ref 99999; walther@59901: (* no of rewrites exceeding this int -> NO rewrite *) walther@59901: val lim_deriv = Unsynchronized.ref 100; walther@59901: neuper@52101: fun trace i str = walther@59901: if ! trace_on andalso i < ! depth then tracing (idt "#" i ^ str) else () walther@60262: fun trace_eq1 i str rrls thy t = walther@60262: trace i (" " ^ str ^ ": " ^ Rule_Set.id rrls ^ " on: " ^ UnparseC.term_in_thy thy t) walther@60262: fun trace_eq2 i str thy t t' = walther@60262: trace i (" " ^ str ^ ": \"" ^ walther@60262: UnparseC.term_in_thy thy t ^ "\" > \"" ^ UnparseC.term_in_thy thy t' ^ "\""); walther@60262: walther@60262: fun trace1 i str = walther@59901: if ! trace_on andalso i < ! depth then tracing (idt "#" (i + 1) ^ str) else () walther@60262: fun trace_in1 i str thmid = walther@60262: trace1 i (" " ^ str ^ ": \"" ^ thmid ^ "\"") walther@60262: fun trace_in2 i str thy t = walther@60262: trace1 i (" " ^ str ^ ": \"" ^ UnparseC.term_in_thy thy t ^ "\""); walther@60262: fun trace_in3 i str thy pairopt = walther@60262: trace1 i (" " ^ str ^ ": " ^ UnparseC.term_in_thy thy ((fst o the) pairopt)); walther@60262: fun trace_in4 i str thy ts ts' = walther@60262: if ! trace_on andalso i < ! depth andalso ts <> [] walther@60262: then tracing (idt "#" (i + 1) ^ " " ^ str ^ ": " ^ UnparseC.terms_in_thy thy ts ^ walther@60262: " stored: " ^ UnparseC.terms_in_thy thy ts') walther@60262: else (); walther@60262: fun trace_in5 i str thy p' = walther@60262: if ! trace_on andalso i < ! depth walther@60262: then tracing (idt "#" (i + 1) ^ " " ^ str ^ ": " ^ UnparseC.terms_in_thy thy p') walther@60262: else(); neuper@52101: neuper@37906: fun rewrite__ thy i bdv tless rls put_asm thm ct = wneuper@59381: let walther@60262: val (t', asms, _(*lrd*), rew) = rew_sub thy i bdv tless rls put_asm ([(*root of the term*)]: TermC.path) wenzelm@60203: (TermC.inst_bdv bdv (Eval.norm (Thm.prop_of thm))) ct walther@60017: in if rew then SOME (t', distinct op = asms) else NONE end walther@60262: (* one rewrite (possibly conditional, ordered) EXOR exn EXOR go into subterms *) wneuper@59381: and rew_sub thy i bdv tless rls put_asm lrd r t = neuper@38022: (let walther@60317: (** )val _ = @{print}{a = "@ rew_sub: 1 < ?n \ NTH ?n..", r = UnparseC.term r};( *TODOO*) wneuper@59381: val (lhs, rhs) = (HOLogic.dest_eq o HOLogic.dest_Trueprop o Logic.strip_imp_concl) r walther@60317: (** )val _ = @{print}{a = "@ rew_sub NO: patterns..", lhs = UnparseC.term lhs, rhs = UnparseC.term rhs};( *TODOO*) walther@60262: val r' = (Envir.subst_term (Pattern.match thy (lhs, t) (Vartab.empty, Vartab.empty)) r) walther@60262: handle Pattern.MATCH => raise NO_REWRITE walther@60317: (** )val _ = @{print}{a = "@ Envir.subst_term: OK gives (3 + - 1)", r' = UnparseC.term r'};( *TODOO*) wneuper@59381: val p' = map HOLogic.dest_Trueprop ((fst o Logic.strip_prems) (Logic.count_prems r', [], r')) wneuper@59381: val t' = (snd o HOLogic.dest_eq o HOLogic.dest_Trueprop o Logic.strip_imp_concl) r' walther@60262: val _ = trace_in2 i "eval asms" thy r'; walther@60317: (** )val _ = @{print}{a = "@ eval asms", r' = UnparseC.term r'};( *TODOO*) walther@60262: val (t'', p'') = (*conditional rewriting*) walther@60262: let val (simpl_p', nofalse) = eval__true thy (i + 1) p' bdv rls walther@60317: (** )val _ = @{print}{a = "@ eval__true asms", simpl_p' = UnparseC.terms simpl_p', nofalse = nofalse};( *TODOO*) wneuper@59381: in wneuper@59381: if nofalse walther@60262: then (trace_in4 i "asms accepted" thy p' simpl_p'; (t',simpl_p'))(* uncond.rew.from above*) walther@60262: else (trace_in5 i "asms false" thy p'; raise NO_REWRITE) (* don't go into subtm.of cond*) wneuper@59381: end walther@60262: in walther@60262: if TermC.perm lhs rhs andalso not (tless bdv (t', t)) (*ordered rewriting*) walther@60262: then (trace_eq2 i "not >" thy t t'; raise NO_REWRITE) walther@60262: else (t'', p'', [], true) walther@60262: end walther@60262: ) handle NO_REWRITE => walther@60262: (case t of walther@60262: Const(s, T) => (Const(s, T), [], lrd, false) walther@60262: | Free(s, T) => (Free(s, T), [], lrd, false) walther@60262: | Var(n, T) => (Var(n, T), [], lrd, false) walther@60262: | Bound i => (Bound i, [], lrd, false) walther@60262: | Abs(s, T, body) => walther@60262: let val (t', asms, _ (*lrd*), rew) = rew_sub thy i bdv tless rls put_asm (lrd @ [TermC.D]) r body walther@60262: in (Abs(s, T, t'), asms, [], rew) end walther@60262: | t1 $ t2 => walther@60262: let val (t2', asm2, lrd, rew2) = rew_sub thy i bdv tless rls put_asm (lrd @ [TermC.R]) r t2 walther@60262: in walther@60262: if rew2 then (t1 $ t2', asm2, lrd, true) walther@60262: else walther@60262: let val (t1', asm1, lrd, rew1) = rew_sub thy i bdv tless rls put_asm (lrd @ [TermC.L]) r t1 walther@60262: in if rew1 then (t1' $ t2, asm1, lrd, true) else (t1 $ t2,[], lrd, false) end walther@60262: end) walther@60262: and eval__true thy i asms bdv rls = (* simplify asumptions until one evaluates to false*) neuper@48760: if asms = [@{term True}] orelse asms = [] then ([], true) wneuper@59381: else (* this allows to check Rrls with prepat = ([@{term True}], pat) *) wneuper@59381: if asms = [@{term False}] then ([], false) wneuper@59381: else wneuper@59381: let wneuper@59381: fun chk indets [] = (indets, true) (*return asms<>True until false*) wneuper@59381: | chk indets (a :: asms) = wneuper@59381: (case rewrite__set_ thy (i + 1) false bdv rls a of wneuper@59381: NONE => (chk (indets @ [a]) asms) wneuper@59381: | SOME (t, a') => wneuper@59381: if t = @{term True} then (chk (indets @ a') asms) wneuper@59381: else if t = @{term False} then ([], false) wneuper@59381: (*asm false .. thm not applied ^^^; continue until False vvv*) wneuper@59381: else chk (indets @ [t] @ a') asms); wneuper@59381: in chk [] asms end walther@60317: and rewrite__set_ thy _ _ _ Rule_Set.Empty t = (* rewrite with a rule set*) walther@59962: raise ERROR ("rewrite__set_ called with 'Erls' for '" ^ UnparseC.term_in_thy thy t ^ "'") walther@60262: | rewrite__set_ thy i _ _ (rrls as Rule_Set.Rrls _) t = (* rewrite with a 'reverse rule set'*) neuper@52101: let walther@60262: val _= trace_eq1 i "rls" rrls thy t; wneuper@59382: val (t', asm, rew) = app_rev thy (i + 1) rrls t walther@60017: in if rew then SOME (t', distinct op = asm) else NONE end walther@60262: | rewrite__set_ thy i put_asm bdv rls ct = (* Rls, Seq containing Thms or Eval, Cal1 *) neuper@52101: let walther@59841: (* attention with cp to test/..: unbound thy, i, bdv, rls; TODO1803? pull out to rewrite__*) neuper@52101: datatype switch = Appl | Noap; walther@60262: fun rew_once _ asm ct Noap [] = (ct, asm) (* ?TODO unify with Prog_Expr.rew_once? *) neuper@52101: | rew_once ruls asm ct Appl [] = walther@59851: (case rls of Rule_Def.Repeat _ => rew_once ruls asm ct Noap ruls walther@59878: | Rule_Set.Sequence _ => (ct, asm) walther@59867: | rls => raise ERROR ("rew_once not appl. to \"" ^ Rule_Set.id rls ^ "\"")) wneuper@59381: | rew_once ruls asm ct apno (rul :: thms) = neuper@52101: case rul of wneuper@59416: Rule.Thm (thmid, thm) => walther@60262: (trace_in1 i "try thm" thmid; walther@59852: case rewrite__ thy (i + 1) bdv ((snd o #rew_ord o Rule_Set.rep) rls) walther@59852: ((#erls o Rule_Set.rep) rls) put_asm thm ct of neuper@52101: NONE => rew_once ruls asm ct apno thms wneuper@59381: | SOME (ct', asm') => walther@60262: (trace_in2 i "rewrites to" thy ct'; wneuper@59399: rew_once ruls (union (op =) asm asm') ct' Appl (rul :: thms))) wneuper@59399: (* once again try the same rule, e.g. associativity against "()"*) walther@59878: | Rule.Eval (cc as (op_, _)) => walther@60262: let val _= trace_in1 i "try calc" op_; wneuper@59521: val ct = TermC.uminus_to_string ct (*WN190312: superfluous?*) walther@59878: in case Eval.adhoc_thm thy cc ct of neuper@52101: NONE => rew_once ruls asm ct apno thms wneuper@59381: | SOME (_, thm') => neuper@52101: let walther@59852: val pairopt = rewrite__ thy (i + 1) bdv ((snd o #rew_ord o Rule_Set.rep) rls) walther@59852: ((#erls o Rule_Set.rep) rls) put_asm thm' ct; walther@59962: val _ = if pairopt <> NONE then () else raise ERROR ("rewrite_set_, rewrite_ \"" ^ walther@59875: ThmC.string_of_thm thm' ^ "\" " ^ UnparseC.term_in_thy thy ct ^ " = NONE") walther@60262: val _ = trace_in3 i "calc. to" thy pairopt; neuper@52101: in rew_once ruls asm ((fst o the) pairopt) Appl (rul :: thms) end neuper@52101: end wneuper@59416: | Rule.Cal1 (cc as (op_, _)) => walther@60262: let val _= trace_in1 i "try cal1" op_; wneuper@59389: val ct = TermC.uminus_to_string ct walther@59878: in case Eval.adhoc_thm1_ thy cc ct of neuper@52101: NONE => (ct, asm) wneuper@59381: | SOME (_, thm') => neuper@52101: let walther@59852: val pairopt = rewrite__ thy (i + 1) bdv ((snd o #rew_ord o Rule_Set.rep) rls) walther@59852: ((#erls o Rule_Set.rep) rls) put_asm thm' ct; walther@59962: val _ = if pairopt <> NONE then () else raise ERROR ("rewrite_set_, rewrite_ \"" ^ walther@59875: ThmC.string_of_thm thm' ^ "\" " ^ UnparseC.term_in_thy thy ct ^ " = NONE") walther@60262: val _ = trace_in3 i "cal1. to" thy pairopt; neuper@52101: in the pairopt end neuper@52101: end wneuper@59416: | Rule.Rls_ rls' => neuper@52101: (case rewrite__set_ thy (i + 1) put_asm bdv rls' ct of neuper@52101: SOME (t', asm') => rew_once ruls (union (op =) asm asm') t' Appl thms wneuper@59381: | NONE => rew_once ruls asm ct apno thms) walther@59867: | r => raise ERROR ("rew_once not appl. to \"" ^ Rule.to_string r ^ "\""); walther@59852: val ruls = (#rules o Rule_Set.rep) rls; walther@60262: val _ = trace_eq1 i "rls" rls thy ct neuper@52101: val (ct', asm') = rew_once ruls [] ct Noap ruls; walther@60017: in if ct = ct' then NONE else SOME (ct', distinct op = asm') end walther@59865: (*-------------------------------------------------------------*) walther@60262: and app_rev thy i rrls t = (* apply an Rrls; if not applicable proceed with subterms*) neuper@52085: let (* check a (precond, pattern) of a rev-set; stops with 1st true *) wneuper@59381: fun chk_prepat _ _ [] _ = true neuper@52085: | chk_prepat thy erls prepat t = neuper@52085: let neuper@52085: fun chk (pres, pat) = neuper@52085: (let neuper@52085: val subst: Type.tyenv * Envir.tenv = neuper@52085: Pattern.match thy (pat, t) (Vartab.empty, Vartab.empty) neuper@52085: in neuper@52085: snd (eval__true thy (i + 1) (map (Envir.subst_term subst) pres) [] erls) walther@60267: end) handle Pattern.MATCH => false wneuper@59381: fun scan_ _ [] = false wneuper@59398: | scan_ f (pp :: pps) = neuper@52085: if f pp then true else scan_ f pps; neuper@52085: in scan_ chk prepat end; neuper@52085: (* apply the normal_form of a rev-set *) walther@59850: fun app_rev' thy (Rule_Set.Rrls {erls, prepat, scr = Rule.Rfuns {normal_form, ...}, ...}) t = wneuper@59381: if chk_prepat thy erls prepat t then normal_form t else NONE walther@59867: | app_rev' _ r _ = raise ERROR ("app_rev' not appl. to \"" ^ Rule_Set.id r ^ "\""); neuper@52085: val opt = app_rev' thy rrls t neuper@52085: in neuper@52085: case opt of neuper@52085: SOME (t', asm) => (t', asm, true) neuper@52085: | NONE => app_sub thy i rrls t neuper@52085: end walther@60262: and app_sub thy i rrls t = (* apply an Rrls to subterms*) neuper@52085: case t of neuper@52085: Const (s, T) => (Const(s, T), [], false) neuper@52085: | Free (s, T) => (Free(s, T), [], false) neuper@52085: | Var (n, T) => (Var(n, T), [], false) neuper@52085: | Bound i => (Bound i, [], false) neuper@52085: | Abs (s, T, body) => neuper@37906: let val (t', asm, rew) = app_rev thy i rrls body neuper@37906: in (Abs(s, T, t'), asm, rew) end neuper@52085: | t1 $ t2 => neuper@52085: let val (t2', asm2, rew2) = app_rev thy i rrls t2 neuper@52085: in neuper@52085: if rew2 then (t1 $ t2', asm2, true) neuper@52085: else neuper@52085: let val (t1', asm1, rew1) = app_rev thy i rrls t1 neuper@52085: in if rew1 then (t1' $ t2, asm1, true) neuper@52085: else (t1 $ t2, [], false) neuper@52085: end wneuper@59381: end; neuper@37906: wneuper@59381: (* rewriting without argument [] for rew_ord; WN110603: shouldnt asm<>[] lead to false? *) neuper@37906: fun eval_true thy terms rls = (snd o (eval__true thy 1 terms [])) rls; neuper@37906: neuper@52101: (* rewriting without internal argument [] *) neuper@52101: fun rewrite_ thy rew_ord erls bool thm term = rewrite__ thy 1 [] rew_ord erls bool thm term; neuper@52101: fun rewrite_set_ thy bool rls term = rewrite__set_ thy 1 bool [] rls term; neuper@37906: wneuper@59381: (* variants of rewrite; TODO del. put_asm *) wneuper@59381: fun rewrite_inst_ thy rew_ord rls put_asm subst thm ct = wneuper@59381: rewrite__ thy 1 subst rew_ord rls put_asm thm ct; wneuper@59381: fun rewrite_set_inst_ thy put_asm subst rls ct = rewrite__set_ thy 1 put_asm subst rls ct; neuper@37906: neuper@38025: (* given a list of equalities (lhs = rhs) and a term, neuper@38025: replace all occurrences of lhs in the term with rhs; neuper@38025: thus the order or equalities matters: put variables in lhs first. *) neuper@38025: fun rewrite_terms_ thy ord erls equs t = neuper@42359: let neuper@42359: fun rew_ (t', asm') [] _ = (t', asm') neuper@42359: | rew_ (t', asm') (rules as r::rs) t = neuper@42359: let wneuper@59390: val (t'', asm'', _(*lrd*), rew) = rew_sub thy 1 [] ord erls false [] (HOLogic.Trueprop $ r) t neuper@42359: in neuper@42359: if rew neuper@42359: then rew_ (t'', asm' @ asm'') rules t'' neuper@42359: else rew_ (t', asm') rs t' neuper@42359: end walther@59861: val (t'', asm'') = rew_ (TermC.empty, []) equs t walther@59861: in if t'' = TermC.empty then NONE else SOME (t'', asm'') neuper@42359: end; neuper@37906: wneuper@59381: (* search ct for adjacent numerals and calculate them by operator isa_fn *) neuper@37906: fun calculate_ thy isa_fn ct = wneuper@59389: let val ct = TermC.uminus_to_string ct walther@59878: in case Eval.adhoc_thm thy isa_fn ct of neuper@37906: NONE => NONE wneuper@59381: | SOME (thmID, thm) => walther@59857: (let val rew = case rewrite_ thy Rewrite_Ord.dummy_ord Rule_Set.empty false thm ct of wneuper@59381: SOME (rew, _) => rew wneuper@59381: | NONE => raise ERROR "" wneuper@59381: in SOME (rew, (thmID, thm)) end) walther@60263: handle NO_REWRITE => raise ERROR ("calculate_: " ^ thmID ^ " does not rewrite") neuper@37906: end; neuper@37906: walther@59718: fun eval_prog_expr thy srls t = neuper@52139: let val rew = rewrite_set_ thy false srls t; neuper@52139: in case rew of SOME (res,_) => res | NONE => t end; neuper@37906: neuper@41928: fun eval_true_ _ _ (Const ("HOL.True",_)) = true walther@59722: | eval_true_ thy rls t = walther@59722: case rewrite_set_ thy false rls t of neuper@41928: SOME (Const ("HOL.True",_),_) => true neuper@37906: | _ => false; neuper@37906: walther@60262: end