| Tue, 19 Jun 2007 23:16:14 +0200 |
wenzelm |
Balanced binary trees (material from library.ML);
|
changeset |
files
|
| Tue, 19 Jun 2007 23:15:59 +0200 |
wenzelm |
profiling: observe no_timing;
|
changeset |
files
|
| Tue, 19 Jun 2007 23:15:57 +0200 |
wenzelm |
added raw_tactic;
|
changeset |
files
|
| Tue, 19 Jun 2007 23:15:54 +0200 |
wenzelm |
moved balanced tree operations to General/balanced_tree.ML;
|
changeset |
files
|
| Tue, 19 Jun 2007 23:15:51 +0200 |
wenzelm |
added with_subgoal;
|
changeset |
files
|
| Tue, 19 Jun 2007 23:15:49 +0200 |
wenzelm |
balanced conjunctions;
|
changeset |
files
|
| Tue, 19 Jun 2007 23:15:47 +0200 |
wenzelm |
balanced conjunctions;
|
changeset |
files
|
| Tue, 19 Jun 2007 23:15:43 +0200 |
wenzelm |
added General/balanced_tree.ML;
|
changeset |
files
|
| Tue, 19 Jun 2007 23:15:38 +0200 |
wenzelm |
BalancedTree;
|
changeset |
files
|
| Tue, 19 Jun 2007 23:15:27 +0200 |
wenzelm |
balanced conjunctions;
|
changeset |
files
|
| Tue, 19 Jun 2007 23:15:23 +0200 |
wenzelm |
tuned;
|
changeset |
files
|
| Tue, 19 Jun 2007 18:00:49 +0200 |
krauss |
generalized proofs so that call graphs can have any node type.
|
changeset |
files
|
| Tue, 19 Jun 2007 00:02:16 +0200 |
wenzelm |
macbroy5: trying -j 2;
|
changeset |
files
|
| Mon, 18 Jun 2007 23:30:46 +0200 |
wenzelm |
tuned conjunction tactics: slightly smaller proof terms;
|
changeset |
files
|
| Sun, 17 Jun 2007 18:47:03 +0200 |
nipkow |
tuned laws for cancellation in divisions for fields.
|
changeset |
files
|
| Sun, 17 Jun 2007 13:39:50 +0200 |
chaieb |
moved nonzero_mult_divide_cancel_right to Ring_and_Field as nonzero_mult_divide_cancel_right'; tuned proofs
|
changeset |
files
|
| Sun, 17 Jun 2007 13:39:48 +0200 |
chaieb |
Added eta_conv and eta-expansion conversion: waiting for it to be in thm.ML; exported is_refl
|
changeset |
files
|
| Sun, 17 Jun 2007 13:39:45 +0200 |
chaieb |
gen_qelim_conv now reduces the universal quatifier to the existential one; Now also deals with Ex f for eta-contracted f;
|
changeset |
files
|
| Sun, 17 Jun 2007 13:39:39 +0200 |
chaieb |
thin_prems_tac first max-scopes universal quantifiers; eta_conv moved to Pure/conv.ML
|
changeset |
files
|
| Sun, 17 Jun 2007 13:39:34 +0200 |
chaieb |
Tuned error messages; tuned;
|
changeset |
files
|
| Sun, 17 Jun 2007 13:39:32 +0200 |
chaieb |
normalizer conversions depend on the proof context; added functions for conversion and wrapper that sill depend on the variable ordering (_ord)
|
changeset |
files
|
| Sun, 17 Jun 2007 13:39:29 +0200 |
chaieb |
added theorems nonzero_mult_divide_cancel_right' nonzero_mult_divide_cancel_left' ordered_field_no_lb ordered_field_no_ub
|
changeset |
files
|
| Sun, 17 Jun 2007 13:39:27 +0200 |
chaieb |
moved lemma all_not_ex to HOL.thy ; tuned proofs
|
changeset |
files
|
| Sun, 17 Jun 2007 13:39:25 +0200 |
chaieb |
Tuned instantiation of Groebner bases to fields
|
changeset |
files
|
| Sun, 17 Jun 2007 13:39:22 +0200 |
chaieb |
added Theorem all_not_ex
|
changeset |
files
|
| Sun, 17 Jun 2007 08:56:13 +0200 |
nipkow |
renamed vars in zle_trans for compatibility
|
changeset |
files
|
| Sat, 16 Jun 2007 16:27:35 +0200 |
nipkow |
tuned
|
changeset |
files
|
| Sat, 16 Jun 2007 15:01:54 +0200 |
nipkow |
The simprocs "divide_cancel_factor" and "ring_eq_cancel_factor" no
|
changeset |
files
|
| Fri, 15 Jun 2007 19:19:23 +0200 |
berghofe |
Locally added definition of "int :: nat => int" again to make
|
changeset |
files
|
| Fri, 15 Jun 2007 15:10:32 +0200 |
nipkow |
made divide_self a simp rule
|
changeset |
files
|
| Fri, 15 Jun 2007 09:10:06 +0200 |
nipkow |
Removed thunk from Fun
|
changeset |
files
|
| Fri, 15 Jun 2007 09:09:06 +0200 |
nipkow |
Church numerals added
|
changeset |
files
|
| Thu, 14 Jun 2007 23:04:40 +0200 |
wenzelm |
method assumption: uniform treatment of prems as legacy feature;
|
changeset |
files
|
| Thu, 14 Jun 2007 23:04:39 +0200 |
wenzelm |
tuned proofs;
|
changeset |
files
|
| Thu, 14 Jun 2007 23:04:36 +0200 |
wenzelm |
tuned proofs: avoid implicit prems;
|
changeset |
files
|
| Thu, 14 Jun 2007 22:59:42 +0200 |
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)
|
changeset |
files
|
| Thu, 14 Jun 2007 22:59:40 +0200 |
chaieb |
no computation rules in the pre-simplifiaction set
|
changeset |
files
|
| Thu, 14 Jun 2007 22:59:39 +0200 |
chaieb |
Added some lemmas to default presburger simpset; tuned proofs
|
changeset |
files
|
| Thu, 14 Jun 2007 18:33:31 +0200 |
wenzelm |
tuned proofs: avoid implicit prems;
|
changeset |
files
|
| Thu, 14 Jun 2007 18:33:29 +0200 |
wenzelm |
tuned proofs: avoid implicit prems;
|
changeset |
files
|
| Thu, 14 Jun 2007 13:19:50 +0200 |
paulson |
Now ResHolClause also does first-order problems!
|
changeset |
files
|
| Thu, 14 Jun 2007 13:18:59 +0200 |
paulson |
Now also handles FO problems
|
changeset |
files
|
| Thu, 14 Jun 2007 13:18:24 +0200 |
paulson |
Deleted unused code
|
changeset |
files
|
| Thu, 14 Jun 2007 13:16:44 +0200 |
paulson |
tidied
|
changeset |
files
|
| Thu, 14 Jun 2007 10:38:48 +0200 |
wenzelm |
tuned proofs: avoid implicit prems;
|
changeset |
files
|
| Thu, 14 Jun 2007 09:54:14 +0200 |
kleing |
clarified who we consider to be a contributor
|
changeset |
files
|
| Thu, 14 Jun 2007 09:37:38 +0200 |
chaieb |
Fixed Problem with ML-bindings for thm names;
|
changeset |
files
|
| Thu, 14 Jun 2007 07:27:55 +0200 |
nipkow |
fixed filter syntax
|
changeset |
files
|
| Thu, 14 Jun 2007 00:48:42 +0200 |
wenzelm |
updated 'find_theorems' -- moved ProofGeneral specifics to ProofGeneral/CHANGES;
|
changeset |
files
|
| Thu, 14 Jun 2007 00:22:45 +0200 |
wenzelm |
tuned proofs: avoid implicit prems;
|
changeset |
files
|
| Wed, 13 Jun 2007 19:14:51 +0200 |
huffman |
int abbreviates of_nat
|
changeset |
files
|
| Wed, 13 Jun 2007 18:30:17 +0200 |
wenzelm |
tuned proofs: avoid implicit prems;
|
changeset |
files
|
| Wed, 13 Jun 2007 18:30:16 +0200 |
wenzelm |
tuned proofs: avoid implicit prems;
|
changeset |
files
|
| Wed, 13 Jun 2007 18:30:15 +0200 |
wenzelm |
tuned comments;
|
changeset |
files
|
| Wed, 13 Jun 2007 18:30:11 +0200 |
wenzelm |
tuned proofs: avoid implicit prems;
|
changeset |
files
|
| Wed, 13 Jun 2007 16:43:02 +0200 |
huffman |
clean up instance proofs; reorganize section headings
|
changeset |
files
|
| Wed, 13 Jun 2007 14:21:54 +0200 |
wenzelm |
reactivated theory Class;
|
changeset |
files
|
| Wed, 13 Jun 2007 12:22:02 +0200 |
urbanc |
added the Q_Unit rule (was missing) and adjusted the proof accordingly
|
changeset |
files
|
| Wed, 13 Jun 2007 11:54:03 +0200 |
wenzelm |
* Isar: method "assumption" (implicit closing of subproofs) takes non-atomic goal assumptions into account;
|
changeset |
files
|
| Wed, 13 Jun 2007 11:16:24 +0200 |
narboux |
generate_fresh works even if there is no free variable in the goal
|
changeset |
files
|