Mon, 16 Mar 2009 15:10:59 -0700 clean up proofs
huffman [Mon, 16 Mar 2009 15:10:59 -0700] rev 30561
clean up proofs
Tue, 17 Mar 2009 14:12:43 +0100 adapted to general Item_Net;
wenzelm [Tue, 17 Mar 2009 14:12:43 +0100] rev 30560
adapted to general Item_Net;
Tue, 17 Mar 2009 14:12:06 +0100 turned structure NetRules into general Item_Net, which is loaded earlier;
wenzelm [Tue, 17 Mar 2009 14:12:06 +0100] rev 30559
turned structure NetRules into general Item_Net, which is loaded earlier;
Tue, 17 Mar 2009 14:09:20 +0100 renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm [Tue, 17 Mar 2009 14:09:20 +0100] rev 30558
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
Tue, 17 Mar 2009 13:33:21 +0100 goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
wenzelm [Tue, 17 Mar 2009 13:33:21 +0100] rev 30557
goal_tac: finish marked assumptions from left to right -- corresponds better with the strategy of etac, with significant performance gains in some situations;
Tue, 17 Mar 2009 12:10:42 +0100 eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly;
wenzelm [Tue, 17 Mar 2009 12:10:42 +0100] rev 30556
eq_assumption: slightly more efficient by checking (open) result of Logic.assum_problems directly; tuned;
Tue, 17 Mar 2009 12:09:43 +0100 tuned aeconv: test plain aconv before expensive eta_contract;
wenzelm [Tue, 17 Mar 2009 12:09:43 +0100] rev 30555
tuned aeconv: test plain aconv before expensive eta_contract;
Mon, 16 Mar 2009 23:52:30 +0100 substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
wenzelm [Mon, 16 Mar 2009 23:52:30 +0100] rev 30554
substantial speedup of assumption and elim-resolution: Logic.assum_problems refrains from eager application of parameters, discriminate via Term.could_unify before invoking full unification (assumes terms in beta-normal form, as do higher term net operations anyway);
Mon, 16 Mar 2009 23:39:44 +0100 refined is_norm_hhf: reject beta-redexes (rules based on term nets or could_unify assume normal form), also potentially faster by avoiding expensive Envir.beta_eta_contract;
wenzelm [Mon, 16 Mar 2009 23:39:44 +0100] rev 30553
refined is_norm_hhf: reject beta-redexes (rules based on term nets or could_unify assume normal form), also potentially faster by avoiding expensive Envir.beta_eta_contract;
Mon, 16 Mar 2009 23:36:55 +0100 provide Simplifier.norm_hhf(_protect) as regular simplifier operation;
wenzelm [Mon, 16 Mar 2009 23:36:55 +0100] rev 30552
provide Simplifier.norm_hhf(_protect) as regular simplifier operation;
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip