wenzelm [Tue, 19 Jun 2007 00:02:16 +0200] rev 23415
macbroy5: trying -j 2;
wenzelm [Mon, 18 Jun 2007 23:30:46 +0200] rev 23414
tuned conjunction tactics: slightly smaller proof terms;
nipkow [Sun, 17 Jun 2007 18:47:03 +0200] rev 23413
tuned laws for cancellation in divisions for fields.
chaieb [Sun, 17 Jun 2007 13:39:50 +0200] rev 23412
moved nonzero_mult_divide_cancel_right to Ring_and_Field as nonzero_mult_divide_cancel_right'; tuned proofs
chaieb [Sun, 17 Jun 2007 13:39:48 +0200] rev 23411
Added eta_conv and eta-expansion conversion: waiting for it to be in thm.ML; exported is_refl
chaieb [Sun, 17 Jun 2007 13:39:45 +0200] rev 23410
gen_qelim_conv now reduces the universal quatifier to the existential one; Now also deals with Ex f for eta-contracted f;
chaieb [Sun, 17 Jun 2007 13:39:39 +0200] rev 23409
thin_prems_tac first max-scopes universal quantifiers; eta_conv moved to Pure/conv.ML
chaieb [Sun, 17 Jun 2007 13:39:34 +0200] rev 23408
Tuned error messages; tuned;
chaieb [Sun, 17 Jun 2007 13:39:32 +0200] rev 23407
normalizer conversions depend on the proof context; added functions for conversion and wrapper that sill depend on the variable ordering (_ord)
chaieb [Sun, 17 Jun 2007 13:39:29 +0200] rev 23406
added theorems nonzero_mult_divide_cancel_right' nonzero_mult_divide_cancel_left' ordered_field_no_lb ordered_field_no_ub
chaieb [Sun, 17 Jun 2007 13:39:27 +0200] rev 23405
moved lemma all_not_ex to HOL.thy ; tuned proofs
chaieb [Sun, 17 Jun 2007 13:39:25 +0200] rev 23404
Tuned instantiation of Groebner bases to fields
chaieb [Sun, 17 Jun 2007 13:39:22 +0200] rev 23403
added Theorem all_not_ex
nipkow [Sun, 17 Jun 2007 08:56:13 +0200] rev 23402
renamed vars in zle_trans for compatibility
nipkow [Sat, 16 Jun 2007 16:27:35 +0200] rev 23401
tuned
nipkow [Sat, 16 Jun 2007 15:01:54 +0200] rev 23400
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.
berghofe [Fri, 15 Jun 2007 19:19:23 +0200] rev 23399
Locally added definition of "int :: nat => int" again to make
code generation work.
nipkow [Fri, 15 Jun 2007 15:10:32 +0200] rev 23398
made divide_self a simp rule
nipkow [Fri, 15 Jun 2007 09:10:06 +0200] rev 23397
Removed thunk from Fun
nipkow [Fri, 15 Jun 2007 09:09:06 +0200] rev 23396
Church numerals added
wenzelm [Thu, 14 Jun 2007 23:04:40 +0200] rev 23395
method assumption: uniform treatment of prems as legacy feature;
wenzelm [Thu, 14 Jun 2007 23:04:39 +0200] rev 23394
tuned proofs;
wenzelm [Thu, 14 Jun 2007 23:04:36 +0200] rev 23393
tuned proofs: avoid implicit prems;
chaieb [Thu, 14 Jun 2007 22:59:42 +0200] rev 23392
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)
chaieb [Thu, 14 Jun 2007 22:59:40 +0200] rev 23391
no computation rules in the pre-simplifiaction set
chaieb [Thu, 14 Jun 2007 22:59:39 +0200] rev 23390
Added some lemmas to default presburger simpset; tuned proofs
wenzelm [Thu, 14 Jun 2007 18:33:31 +0200] rev 23389
tuned proofs: avoid implicit prems;
wenzelm [Thu, 14 Jun 2007 18:33:29 +0200] rev 23388
tuned proofs: avoid implicit prems;
tuned partition proofs;
paulson [Thu, 14 Jun 2007 13:19:50 +0200] rev 23387
Now ResHolClause also does first-order problems!
paulson [Thu, 14 Jun 2007 13:18:59 +0200] rev 23386
Now also handles FO problems