Mon, 28 Feb 2005 13:10:36 +0100 paulson unfold theorems for trancl and rtrancl
Sun, 27 Feb 2005 00:00:40 +0100 dixon lucas - added more comments and an extra type to clarify the code.
Wed, 23 Feb 2005 15:19:00 +0100 berghofe Modified node_trans to avoid duplication of signature stamps
Wed, 23 Feb 2005 15:00:03 +0100 webertj exception SAME removed
Wed, 23 Feb 2005 14:04:53 +0100 webertj major code change: refute can now handle recursion and axiomatic type classes; 3-valued logic with two kinds of equality; some bugfixes
Wed, 23 Feb 2005 10:23:22 +0100 nipkow suminf -> \<Sum>
Tue, 22 Feb 2005 18:42:22 +0100 dixon Lucas - fixed bug in zero_var_indexes: it was ignoring vars in the flex-flex pairs. These are now taken into account.
Tue, 22 Feb 2005 13:05:47 +0100 paulson removed redundant lemmas and simprules
Tue, 22 Feb 2005 10:54:30 +0100 nipkow more setsum tuning
Mon, 21 Feb 2005 19:23:46 +0100 nipkow more fine tuniung
Mon, 21 Feb 2005 18:04:28 +0100 nipkow fixed proof
Mon, 21 Feb 2005 15:57:45 +0100 nipkow removed superfluous setsum_constant
Mon, 21 Feb 2005 15:04:10 +0100 nipkow comprehensive cleanup, replacing sumr by setsum
Sat, 19 Feb 2005 18:44:34 +0100 dixon lucas - re-arranged code and added comments. Also added check to make sure the subgoal that we are being applied to exists. If it does not, empty seq is returned.
(0) -10000 -3000 -1000 -300 -100 -14 +14 +100 +300 +1000 +3000 +10000 +30000 tip