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