Wed, 21 Jun 2000 10:30:36 +0200 paulson tidied; weakened the (impossible) premises of setsum_UN_disjoint
Tue, 20 Jun 2000 11:54:22 +0200 paulson new module for heaps
Tue, 20 Jun 2000 11:54:07 +0200 paulson now uses the heap data structure for BEST_FIRST
Tue, 20 Jun 2000 11:53:35 +0200 paulson new file heap.ML
Tue, 20 Jun 2000 11:53:16 +0200 paulson changed the Schubert Steamroller proof
Tue, 20 Jun 2000 11:52:38 +0200 paulson another brick in the wall
Tue, 20 Jun 2000 11:51:21 +0200 paulson changed a step for the improved rules for setsum
Tue, 20 Jun 2000 11:50:33 +0200 paulson deleted a step made redundant by the improved rules for setsum
Tue, 20 Jun 2000 11:42:24 +0200 paulson replaced the useless [p]subset_insertD by [p]subset_insert_iff
Tue, 20 Jun 2000 11:41:25 +0200 paulson now setsum f A = 0 unless A is finite
Tue, 20 Jun 2000 11:41:07 +0200 paulson now setsum f A = 0 unless A is finite; proved setsum_cong
Fri, 16 Jun 2000 14:02:41 +0200 paulson real simprocs
Fri, 16 Jun 2000 13:41:44 +0200 paulson fixed for removal of subset_empty
Fri, 16 Jun 2000 13:39:21 +0200 paulson this proof needs more detail
Fri, 16 Jun 2000 13:33:39 +0200 paulson uncommented the last 2 examples; tidied
Fri, 16 Jun 2000 13:32:59 +0200 paulson new lemma real_minus_diff_eq
(0) -3000 -1000 -300 -100 -16 +16 +100 +300 +1000 +3000 +10000 +30000 tip