Sun, 18 Dec 2005 20:10:15 +0100 more cleaning up - this time of the cp-instance
urbanc [Sun, 18 Dec 2005 20:10:15 +0100] rev 18432
more cleaning up - this time of the cp-instance proofs
Sun, 18 Dec 2005 14:36:42 +0100 improved the finite-support proof
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
Sun, 18 Dec 2005 13:38:06 +0100 improved the code for showing that a type is
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).
Sat, 17 Dec 2005 01:58:41 +0100 simp del: empty_Collect_eq;
wenzelm [Sat, 17 Dec 2005 01:58:41 +0100] rev 18429
simp del: empty_Collect_eq;
Sat, 17 Dec 2005 01:00:40 +0100 sort_distinct;
wenzelm [Sat, 17 Dec 2005 01:00:40 +0100] rev 18428
sort_distinct;
Sat, 17 Dec 2005 01:00:38 +0100 added sort_distinct;
wenzelm [Sat, 17 Dec 2005 01:00:38 +0100] rev 18427
added sort_distinct; removed obsolete unique_strings;
Fri, 16 Dec 2005 18:22:58 +0100 added container-lemma fresh_eqvt
urbanc [Fri, 16 Dec 2005 18:22:58 +0100] rev 18426
added container-lemma fresh_eqvt (definition: container-lemma contains all instantiations of a lemma from the general theory)
Fri, 16 Dec 2005 18:20:59 +0100 I think the earlier version was completely broken
urbanc [Fri, 16 Dec 2005 18:20:59 +0100] rev 18425
I think the earlier version was completely broken (not sure about this one)
Fri, 16 Dec 2005 18:20:03 +0100 tuned more proofs
urbanc [Fri, 16 Dec 2005 18:20:03 +0100] rev 18424
tuned more proofs
Fri, 16 Dec 2005 16:59:32 +0100 new lemmas
nipkow [Fri, 16 Dec 2005 16:59:32 +0100] rev 18423
new lemmas
Fri, 16 Dec 2005 16:00:58 +0100 re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann [Fri, 16 Dec 2005 16:00:58 +0100] rev 18422
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
Fri, 16 Dec 2005 15:52:05 +0100 re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann [Fri, 16 Dec 2005 15:52:05 +0100] rev 18421
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
Fri, 16 Dec 2005 12:15:54 +0100 hashing to eliminate the output of duplicate clauses
paulson [Fri, 16 Dec 2005 12:15:54 +0100] rev 18420
hashing to eliminate the output of duplicate clauses
Fri, 16 Dec 2005 11:51:24 +0100 hash tables from SML/NJ
paulson [Fri, 16 Dec 2005 11:51:24 +0100] rev 18419
hash tables from SML/NJ
Fri, 16 Dec 2005 09:00:11 +0100 re-arranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann [Fri, 16 Dec 2005 09:00:11 +0100] rev 18418
re-arranged tuples (theory * 'a) to ('a * theory) in Pure
Thu, 15 Dec 2005 21:51:31 +0100 there was a small error in the last commit - fixed now
urbanc [Thu, 15 Dec 2005 21:51:31 +0100] rev 18417
there was a small error in the last commit - fixed now
Thu, 15 Dec 2005 21:49:14 +0100 tuned more proof and added in-file documentation
urbanc [Thu, 15 Dec 2005 21:49:14 +0100] rev 18416
tuned more proof and added in-file documentation
Thu, 15 Dec 2005 19:42:03 +0100 improved proofs;
wenzelm [Thu, 15 Dec 2005 19:42:03 +0100] rev 18415
improved proofs;
Thu, 15 Dec 2005 19:42:02 +0100 acc_induct: proper tags;
wenzelm [Thu, 15 Dec 2005 19:42:02 +0100] rev 18414
acc_induct: proper tags;
Thu, 15 Dec 2005 19:42:00 +0100 removed obsolete/unused setup_induction;
wenzelm [Thu, 15 Dec 2005 19:42:00 +0100] rev 18413
removed obsolete/unused setup_induction;
Thu, 15 Dec 2005 18:13:40 +0100 tuned the proof of transitivity/narrowing
urbanc [Thu, 15 Dec 2005 18:13:40 +0100] rev 18412
tuned the proof of transitivity/narrowing
Thu, 15 Dec 2005 15:26:37 +0100 No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson [Thu, 15 Dec 2005 15:26:37 +0100] rev 18411
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are deleted; any positive occurrence of HOL.type kills the entire clause.
Thu, 15 Dec 2005 11:53:38 +0100 made further tunings
urbanc [Thu, 15 Dec 2005 11:53:38 +0100] rev 18410
made further tunings
Thu, 15 Dec 2005 05:47:26 +0100 Added functions to test equivalence between clauses.
mengj [Thu, 15 Dec 2005 05:47:26 +0100] rev 18409
Added functions to test equivalence between clauses.
Wed, 14 Dec 2005 22:05:22 +0100 ex/Sudoku.thy
webertj [Wed, 14 Dec 2005 22:05:22 +0100] rev 18408
ex/Sudoku.thy
Wed, 14 Dec 2005 18:01:50 +0100 deleted redundant (looping!) simprule
paulson [Wed, 14 Dec 2005 18:01:50 +0100] rev 18407
deleted redundant (looping!) simprule
Wed, 14 Dec 2005 16:14:41 +0100 modified example for new clauses
paulson [Wed, 14 Dec 2005 16:14:41 +0100] rev 18406
modified example for new clauses
Wed, 14 Dec 2005 16:14:26 +0100 removal of some redundancies (e.g. one-point-rules) in clause production
paulson [Wed, 14 Dec 2005 16:14:26 +0100] rev 18405
removal of some redundancies (e.g. one-point-rules) in clause production
Wed, 14 Dec 2005 16:13:09 +0100 removed unused function repeat_RS
paulson [Wed, 14 Dec 2005 16:13:09 +0100] rev 18404
removed unused function repeat_RS
Wed, 14 Dec 2005 06:19:33 +0100 Changed literals' ordering and the functions for sorting literals.
mengj [Wed, 14 Dec 2005 06:19:33 +0100] rev 18403
Changed literals' ordering and the functions for sorting literals.
(0) -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip