wenzelm [Thu, 22 Dec 2005 00:28:41 +0100] rev 18459
mutual induct with *.inducts;
wenzelm [Thu, 22 Dec 2005 00:28:39 +0100] rev 18458
wf_induct_rule: consumes 1;
wenzelm [Thu, 22 Dec 2005 00:28:36 +0100] rev 18457
structure ProjectRule;
updated auxiliary facts for induct method;
tuned proofs;
wenzelm [Thu, 22 Dec 2005 00:28:34 +0100] rev 18456
updated auxiliary facts for induct method;
haftmann [Wed, 21 Dec 2005 17:00:57 +0100] rev 18455
slight improvements
haftmann [Wed, 21 Dec 2005 15:19:16 +0100] rev 18454
slight improvements in name handling
haftmann [Wed, 21 Dec 2005 15:18:57 +0100] rev 18453
slight refinements
haftmann [Wed, 21 Dec 2005 15:18:36 +0100] rev 18452
added eq_ord
haftmann [Wed, 21 Dec 2005 15:18:17 +0100] rev 18451
slight clean ups
haftmann [Wed, 21 Dec 2005 13:25:20 +0100] rev 18450
discontinued unflat in favour of burrow and burrow_split
paulson [Wed, 21 Dec 2005 12:06:08 +0100] rev 18449
new hash table module in HOL/Too/s
paulson [Wed, 21 Dec 2005 12:05:47 +0100] rev 18448
modified suffix for [iff] attribute
paulson [Wed, 21 Dec 2005 12:02:57 +0100] rev 18447
removed or modified some instances of [iff]
wenzelm [Tue, 20 Dec 2005 22:06:00 +0100] rev 18446
tuned;
haftmann [Tue, 20 Dec 2005 09:02:41 +0100] rev 18445
added .cvsignore
haftmann [Tue, 20 Dec 2005 09:01:48 +0100] rev 18444
removed improper .cvsignore
haftmann [Tue, 20 Dec 2005 08:58:36 +0100] rev 18443
removed superfluos is_prefix functions
haftmann [Tue, 20 Dec 2005 08:38:43 +0100] rev 18442
resolved shadowing of Library.find_first
haftmann [Tue, 20 Dec 2005 08:38:10 +0100] rev 18441
removed infix prefix, introduces burrow
mengj [Tue, 20 Dec 2005 04:29:25 +0100] rev 18440
Literals in clauses are sorted now. Added functions for clause equivalence tests and hashing clauses to words.
mengj [Tue, 20 Dec 2005 04:27:46 +0100] rev 18439
Added functions for fol_type; also put some functions to the signature, used by ResHolClause.
urbanc [Mon, 19 Dec 2005 16:07:19 +0100] rev 18438
made the changes according to Florian's re-arranging of
tuples (everything up to 19th December).
urbanc [Mon, 19 Dec 2005 15:29:51 +0100] rev 18437
added proofs to show that every atom-kind combination
is in the respective finite-support class (now have to
adjust the files according to Florian's changes)
urbanc [Mon, 19 Dec 2005 12:58:15 +0100] rev 18436
added thms to perm_compose (so far only composition
theorems were included where the type of the permutation
was equal)
urbanc [Mon, 19 Dec 2005 12:09:56 +0100] rev 18435
tuned one comment
urbanc [Mon, 19 Dec 2005 12:08:16 +0100] rev 18434
fixed a bug that occured when more than one atom-type
is declared.
nipkow [Mon, 19 Dec 2005 09:19:08 +0100] rev 18433
fixed proof
urbanc [Sun, 18 Dec 2005 20:10:15 +0100] rev 18432
more cleaning up - this time of the cp-instance
proofs
urbanc [Sun, 18 Dec 2005 14:36:42 +0100] rev 18431
improved the finite-support proof
added finite support proof for options (I am
surprised that one does not need more fs-proofs;
at the moment only lists, products, units and
atoms are shown to be finitely supported (of
course also every nominal datatype is finitely
supported))
deleted pt_bool_inst - not necessary because discrete
types are treated separately in nominal_atoms
urbanc [Sun, 18 Dec 2005 13:38:06 +0100] rev 18430
improved the code for showing that a type is
in the pt-axclass (I try to slowly overcome
my incompetence with such ML-code).