2007-06-19 wenzelm 2007-06-19 balanced conjunctions;
2007-06-19 wenzelm 2007-06-19 tuned;
2007-06-19 krauss 2007-06-19 generalized proofs so that call graphs can have any node type.
2007-06-19 wenzelm 2007-06-19 macbroy5: trying -j 2;
2007-06-18 wenzelm 2007-06-18 tuned conjunction tactics: slightly smaller proof terms;
2007-06-17 nipkow 2007-06-17 tuned laws for cancellation in divisions for fields.
2007-06-17 chaieb 2007-06-17 moved nonzero_mult_divide_cancel_right to Ring_and_Field as nonzero_mult_divide_cancel_right'; tuned proofs
2007-06-17 chaieb 2007-06-17 Added eta_conv and eta-expansion conversion: waiting for it to be in thm.ML; exported is_refl
2007-06-17 chaieb 2007-06-17 gen_qelim_conv now reduces the universal quatifier to the existential one; Now also deals with Ex f for eta-contracted f;
2007-06-17 chaieb 2007-06-17 thin_prems_tac first max-scopes universal quantifiers; eta_conv moved to Pure/conv.ML
2007-06-17 chaieb 2007-06-17 Tuned error messages; tuned;
2007-06-17 chaieb 2007-06-17 normalizer conversions depend on the proof context; added functions for conversion and wrapper that sill depend on the variable ordering (_ord)
2007-06-17 chaieb 2007-06-17 added theorems nonzero_mult_divide_cancel_right' nonzero_mult_divide_cancel_left' ordered_field_no_lb ordered_field_no_ub
2007-06-17 chaieb 2007-06-17 moved lemma all_not_ex to HOL.thy ; tuned proofs
2007-06-17 chaieb 2007-06-17 Tuned instantiation of Groebner bases to fields
2007-06-17 chaieb 2007-06-17 added Theorem all_not_ex
2007-06-17 nipkow 2007-06-17 renamed vars in zle_trans for compatibility
2007-06-16 nipkow 2007-06-16 tuned
2007-06-16 nipkow 2007-06-16 The simprocs "divide_cancel_factor" and "ring_eq_cancel_factor" no longer need class numeral_ring. This made a number of special simp-thms redundant.
2007-06-15 berghofe 2007-06-15 Locally added definition of "int :: nat => int" again to make code generation work.
2007-06-15 nipkow 2007-06-15 made divide_self a simp rule
2007-06-15 nipkow 2007-06-15 Removed thunk from Fun
2007-06-15 nipkow 2007-06-15 Church numerals added
2007-06-14 wenzelm 2007-06-14 method assumption: uniform treatment of prems as legacy feature;
2007-06-14 wenzelm 2007-06-14 tuned proofs;
2007-06-14 wenzelm 2007-06-14 tuned proofs: avoid implicit prems;
2007-06-14 chaieb 2007-06-14 fixed term_constants (impact on is_relevant); terms in generalize_tac are sorted before we abstract over them (to *try* to avoid the case when a term to be abstracted over already occurs in an other)
2007-06-14 chaieb 2007-06-14 no computation rules in the pre-simplifiaction set
2007-06-14 chaieb 2007-06-14 Added some lemmas to default presburger simpset; tuned proofs
2007-06-14 wenzelm 2007-06-14 tuned proofs: avoid implicit prems;
2007-06-14 wenzelm 2007-06-14 tuned proofs: avoid implicit prems; tuned partition proofs;
2007-06-14 paulson 2007-06-14 Now ResHolClause also does first-order problems!
2007-06-14 paulson 2007-06-14 Now also handles FO problems
2007-06-14 paulson 2007-06-14 Deleted unused code
2007-06-14 paulson 2007-06-14 tidied
2007-06-14 wenzelm 2007-06-14 tuned proofs: avoid implicit prems;
2007-06-14 kleing 2007-06-14 clarified who we consider to be a contributor
2007-06-14 chaieb 2007-06-14 Fixed Problem with ML-bindings for thm names;
2007-06-14 nipkow 2007-06-14 fixed filter syntax
2007-06-14 wenzelm 2007-06-14 updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
2007-06-14 wenzelm 2007-06-14 tuned proofs: avoid implicit prems;
2007-06-13 huffman 2007-06-13 int abbreviates of_nat
2007-06-13 wenzelm 2007-06-13 tuned proofs: avoid implicit prems; tuned;
2007-06-13 wenzelm 2007-06-13 tuned proofs: avoid implicit prems; major cleanup of proofs/document;
2007-06-13 wenzelm 2007-06-13 tuned comments;
2007-06-13 wenzelm 2007-06-13 tuned proofs: avoid implicit prems;
2007-06-13 huffman 2007-06-13 clean up instance proofs; reorganize section headings
2007-06-13 wenzelm 2007-06-13 reactivated theory Class;
2007-06-13 urbanc 2007-06-13 added the Q_Unit rule (was missing) and adjusted the proof accordingly
2007-06-13 wenzelm 2007-06-13 * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account; * Isar: implicit use of prems from the Isar proof context is considered a legacy feature;
2007-06-13 narboux 2007-06-13 generate_fresh works even if there is no free variable in the goal
2007-06-13 wenzelm 2007-06-13 tuned;
2007-06-13 wenzelm 2007-06-13 tuned proofs: avoid implicit prems;
2007-06-13 huffman 2007-06-13 removed constant int :: nat => int; int is now an abbreviation for of_nat :: nat => int
2007-06-13 huffman 2007-06-13 thm antiquotations
2007-06-13 wenzelm 2007-06-13 transaction: context_position (non-destructive only);
2007-06-13 wenzelm 2007-06-13 added map_current; simplified internal type proof;
2007-06-13 wenzelm 2007-06-13 tuned msg;
2007-06-13 wenzelm 2007-06-13 apply_method/end_proof: pass position; Method.Basic: include position;
2007-06-13 wenzelm 2007-06-13 renamed map to map_current;