2007-10-30 paulson 2007-10-30 bugfixes concerning strange theorems
2007-10-12 paulson 2007-10-12 trying to make it run faster
2007-10-11 wenzelm 2007-10-11 replaced Sign.add_consts_authentic by Sign.declare_const;
2007-10-09 paulson 2007-10-09 context-based treatment of generalization; also handling TFrees in axiom clauses
2007-10-05 paulson 2007-10-05 filtering out some package theorems
2007-10-04 paulson 2007-10-04 combinator translation
2007-10-03 wenzelm 2007-10-03 skolem_cache: ignore internal theorems -- major speedup; skolem_cache_theorems_of: efficient folding of table; replaced get_axiom by Thm.get_axiom_i (avoids name space fishing);
2007-09-30 wenzelm 2007-09-30 llabs/sko: removed Name.internal;
2007-09-30 wenzelm 2007-09-30 skofuns/absfuns: explicit markup as internal consts;
2007-09-27 paulson 2007-09-27 removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering theorems of Nat.thy are hidden by the Ordering.thy versions
2007-09-21 wenzelm 2007-09-21 proper signature constraint; minor tuning;
2007-09-18 paulson 2007-09-18 metis now available in PreList
2007-08-17 wenzelm 2007-08-17 proper signature for Meson;
2007-08-10 paulson 2007-08-10 removal of some refs
2007-08-03 wenzelm 2007-08-03 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
2007-07-29 wenzelm 2007-07-29 simplified ResAtpset via NamedThmsFun;
2007-07-05 wenzelm 2007-07-05 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac; simplified ObjectLogic.atomize;
2007-06-13 wenzelm 2007-06-13 renamed Goal.prove_raw to Goal.prove_internal;
2007-05-10 wenzelm 2007-05-10 moved some Drule operations to Thm (see more_thm.ML);
2007-05-07 wenzelm 2007-05-07 simplified DataFun interfaces;
2007-04-19 paulson 2007-04-19 trying to make single-step proofs work better, especially if they contain abstraction functions. Uniform names for Skolem and Abstraction functions
2007-04-18 paulson 2007-04-18 Fixes for proof reconstruction, especially involving abstractions and definitions
2007-04-15 wenzelm 2007-04-15 Thm.fold_terms;
2007-04-12 paulson 2007-04-12 Fixed the treatment of TVars in conjecture clauses (they are deleted, not frozen)
2007-04-04 wenzelm 2007-04-04 rep_thm/cterm/ctyp: removed obsolete sign field;
2007-03-26 paulson 2007-03-26 Clause cache is now in theory data. Deleted skolem_use_cache_thm, so cnf_rules_of_ths now calls cnf_axiom.
2007-03-19 paulson 2007-03-19 Removal of axiom names from the theorem cache
2007-02-26 wenzelm 2007-02-26 moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
2007-02-22 paulson 2007-02-22 Improved handling of situation when theorem in cache disagrees with theorem supplied: new clauses are now returned, fixing a bug in the metis method.
2007-01-31 haftmann 2007-01-31 dropped lemma duplicates in HOL.thy
2007-01-20 wenzelm 2007-01-20 Output.debug: non-strict; renamed Output.show_debug_msgs to Output.debugging (coincides with Toplevel.debug);
2007-01-04 paulson 2007-01-04 improvements to proof reconstruction. Some files loaded in a different order
2006-12-22 paulson 2006-12-22 tidying the ATP communications
2006-12-15 wenzelm 2006-12-15 avoid conflict with Alice keywords: renamed pack -> implode, unpack -> explode, any -> many, avoided assert;
2006-12-05 wenzelm 2006-12-05 thm/prf: separate official name vs. additional tags;
2006-11-30 wenzelm 2006-11-30 Goal.norm/close_result;
2006-11-29 wenzelm 2006-11-29 simplified method setup;
2006-11-23 wenzelm 2006-11-23 prefer Proof.context over Context.generic; tuned;
2006-11-22 paulson 2006-11-22 Consolidation of code to "blacklist" unhelpful theorems, including record surjectivity properties
2006-11-21 paulson 2006-11-21 New transformation of eliminatino rules: we simply replace the final conclusion variable by False
2006-11-10 paulson 2006-11-10 Improvement to classrel clauses: now outputs the minimum needed. Theorem names: trying to minimize the number of multiple theorem names presented
2006-11-08 wenzelm 2006-11-08 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
2006-10-26 paulson 2006-10-26 Conversion to clause form now tolerates Boolean variables without looping. Attribute "clausify" moved to res_axioms; rest of reconstruction.ML deleted
2006-10-23 paulson 2006-10-23 meson method MUST NOT use all safe rules, only basic ones for the logical connectives.
2006-10-20 paulson 2006-10-20 Fixed the "exception Empty" bug in elim2Fol Also added a check to suppress elimination rules that would yield too many clauses More debugging info
2006-10-12 paulson 2006-10-12 abstraction is now turned OFF...
2006-10-11 paulson 2006-10-11 Abstraction re-use code now checks that the abstraction function can be used in the current theory.
2006-10-09 wenzelm 2006-10-09 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
2006-10-06 paulson 2006-10-06 Refinements to abstraction. Seeding with combinators K, I and B.
2006-10-05 paulson 2006-10-05 improvements to abstraction, ensuring more re-use of abstraction functions moving some functions to Pure/drule.ML
2006-09-30 mengj 2006-09-30 Removed ResHolClause.LAM2COMB exception.
2006-09-29 wenzelm 2006-09-29 Sign.add_consts_authentic;
2006-09-28 wenzelm 2006-09-28 ResAtpset.get_atpset;
2006-09-26 paulson 2006-09-26 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
2006-09-19 wenzelm 2006-09-19 sko/abs: Name.internal prevents choking of print_theory;
2006-09-18 paulson 2006-09-18 Bug fix to prevent exception dest_Free from escaping
2006-09-13 paulson 2006-09-13 bug fix to abstractions: free variables in theorem can be abstracted over.
2006-09-04 paulson 2006-09-04 Using Drule.local_standard to reduce the space usage
2006-09-01 wenzelm 2006-09-01 skolem_cache_thm: Drule.close_derivation on clauses preserves some space; tuned skolem_cache operations: canonical argument order; tuned monomorphic test;
2006-09-01 paulson 2006-09-01 refinements to conversion into clause form, esp for the HO case