2007-06-19 wenzelm balanced conjunctions;
2007-06-19 wenzelm added General/balanced_tree.ML;
2007-06-19 wenzelm BalancedTree;
2007-06-19 wenzelm balanced conjunctions;
2007-06-19 wenzelm tuned;
2007-06-19 krauss generalized proofs so that call graphs can have any node type.
2007-06-18 wenzelm macbroy5: trying -j 2;
2007-06-18 wenzelm tuned conjunction tactics: slightly smaller proof terms;
2007-06-17 nipkow tuned laws for cancellation in divisions for fields.
2007-06-17 chaieb moved nonzero_mult_divide_cancel_right to Ring_and_Field as nonzero_mult_divide_cancel_right'; tuned proofs
2007-06-17 chaieb Added eta_conv and eta-expansion conversion: waiting for it to be in thm.ML; exported is_refl
2007-06-17 chaieb 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 thin_prems_tac first max-scopes universal quantifiers; eta_conv moved to Pure/conv.ML
2007-06-17 chaieb Tuned error messages; tuned;
2007-06-17 chaieb 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 added theorems nonzero_mult_divide_cancel_right' nonzero_mult_divide_cancel_left' ordered_field_no_lb ordered_field_no_ub
2007-06-17 chaieb moved lemma all_not_ex to HOL.thy ; tuned proofs
2007-06-17 chaieb Tuned instantiation of Groebner bases to fields
2007-06-17 chaieb added Theorem all_not_ex
2007-06-17 nipkow renamed vars in zle_trans for compatibility
2007-06-16 nipkow tuned
2007-06-16 nipkow The simprocs "divide_cancel_factor" and "ring_eq_cancel_factor" no
2007-06-15 berghofe Locally added definition of "int :: nat => int" again to make
2007-06-15 nipkow made divide_self a simp rule
2007-06-15 nipkow Removed thunk from Fun
2007-06-15 nipkow Church numerals added
2007-06-14 wenzelm method assumption: uniform treatment of prems as legacy feature;
2007-06-14 wenzelm tuned proofs;
2007-06-14 wenzelm tuned proofs: avoid implicit prems;
2007-06-14 chaieb 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 no computation rules in the pre-simplifiaction set
2007-06-14 chaieb Added some lemmas to default presburger simpset; tuned proofs
2007-06-14 wenzelm tuned proofs: avoid implicit prems;
2007-06-14 wenzelm tuned proofs: avoid implicit prems;
2007-06-14 paulson Now ResHolClause also does first-order problems!
2007-06-14 paulson Now also handles FO problems
2007-06-14 paulson Deleted unused code
2007-06-14 paulson tidied
2007-06-14 wenzelm tuned proofs: avoid implicit prems;
2007-06-14 kleing clarified who we consider to be a contributor
2007-06-14 chaieb Fixed Problem with ML-bindings for thm names;
2007-06-14 nipkow fixed filter syntax
2007-06-13 wenzelm updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
2007-06-13 wenzelm tuned proofs: avoid implicit prems;
2007-06-13 huffman int abbreviates of_nat
2007-06-13 wenzelm tuned proofs: avoid implicit prems;
2007-06-13 wenzelm tuned proofs: avoid implicit prems;
2007-06-13 wenzelm tuned comments;
2007-06-13 wenzelm tuned proofs: avoid implicit prems;
2007-06-13 huffman clean up instance proofs; reorganize section headings
2007-06-13 wenzelm reactivated theory Class;
2007-06-13 urbanc added the Q_Unit rule (was missing) and adjusted the proof accordingly
2007-06-13 wenzelm * Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
2007-06-13 narboux generate_fresh works even if there is no free variable in the goal
2007-06-13 wenzelm tuned;
2007-06-13 wenzelm tuned proofs: avoid implicit prems;
2007-06-13 huffman removed constant int :: nat => int;
2007-06-13 huffman thm antiquotations
2007-06-12 wenzelm transaction: context_position (non-destructive only);
2007-06-12 wenzelm added map_current;
(0) -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip