Fri, 22 Dec 2000 18:23:41 +0100 wenzelm added inductive_conj;
Fri, 22 Dec 2000 18:20:55 +0100 wenzelm tuned;
Fri, 22 Dec 2000 13:53:28 +0100 paulson better definitions of SML90 features
Thu, 21 Dec 2000 19:19:18 +0100 nipkow *** empty log message ***
Thu, 21 Dec 2000 18:57:39 +0100 nipkow something stopped working, had to add real_add_ac
Thu, 21 Dec 2000 18:57:12 +0100 nipkow rational linear arithmetic
Thu, 21 Dec 2000 18:53:32 +0100 paulson this makes the proof run (or run faster)
Thu, 21 Dec 2000 18:08:10 +0100 paulson further tidying of NSA proofs
Thu, 21 Dec 2000 16:52:10 +0100 nipkow *** empty log message ***
Thu, 21 Dec 2000 16:19:39 +0100 nipkow rational arithmetic
Thu, 21 Dec 2000 16:18:40 +0100 nipkow rational arithemtic
Thu, 21 Dec 2000 10:40:08 +0100 paulson re-orientation of integer literals
Thu, 21 Dec 2000 10:16:33 +0100 paulson more tidying, especially to rationalize the simprules
Thu, 21 Dec 2000 10:16:07 +0100 paulson re-orientation of 0=... (no idea why the backslashes have changed too)
Thu, 21 Dec 2000 10:11:10 +0100 paulson simproc bug fix: negative literals and large terms
Wed, 20 Dec 2000 12:15:52 +0100 paulson further tidying
Wed, 20 Dec 2000 12:14:50 +0100 paulson generalized the re-orientation 0f 0=... to all types
Wed, 20 Dec 2000 12:14:26 +0100 paulson tidying, removing obsolete lemmas about 0=... and 1=...
Wed, 20 Dec 2000 12:13:59 +0100 paulson tidying, removing obsolete lemmas about 0=...
Wed, 20 Dec 2000 11:54:58 +0100 wenzelm SML90: ord, chr, explode, implode;
Tue, 19 Dec 2000 15:24:55 +0100 paulson re-orienting equations with #nnn on the lhs
Tue, 19 Dec 2000 15:20:23 +0100 paulson re-orienting equations with 0, 1, 2 on the lhs
Tue, 19 Dec 2000 15:19:12 +0100 paulson new file extract_common_term.ML for the cancel-factor simprocs
Tue, 19 Dec 2000 15:17:53 +0100 paulson inserting the simproc nat_cancel_factor
Tue, 19 Dec 2000 15:17:21 +0100 paulson inserting the simproc int_cancel_factor
Tue, 19 Dec 2000 15:16:21 +0100 paulson new simprule zero_less_abs_iff
Tue, 19 Dec 2000 15:15:43 +0100 paulson coping with the re-orientation of #nn=x
Tue, 19 Dec 2000 15:14:36 +0100 paulson cancel-factor simproc allows shorter proofs
Tue, 19 Dec 2000 15:06:59 +0100 paulson more tidying
Tue, 19 Dec 2000 15:06:14 +0100 paulson cancel-factor simproc allows a shorter proof
(0) -10000 -3000 -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip