Tue, 20 May 1997 11:47:33 +0200 Basis library version of type "option" now resides in its own structure Option
paulson [Tue, 20 May 1997 11:47:33 +0200] rev 3244
Basis library version of type "option" now resides in its own structure Option
Tue, 20 May 1997 11:44:25 +0200 Removal of ex/LexProd
paulson [Tue, 20 May 1997 11:44:25 +0200] rev 3243
Removal of ex/LexProd
Tue, 20 May 1997 11:44:02 +0200 Renamed egcd and gcd; defined the gcd function using TFL
paulson [Tue, 20 May 1997 11:44:02 +0200] rev 3242
Renamed egcd and gcd; defined the gcd function using TFL
Tue, 20 May 1997 11:42:59 +0200 Removal of duplicate code from TFL
paulson [Tue, 20 May 1997 11:42:59 +0200] rev 3241
Removal of duplicate code from TFL
Tue, 20 May 1997 11:41:56 +0200 New arithmetic laws let us delete three lines of a proof
paulson [Tue, 20 May 1997 11:41:56 +0200] rev 3240
New arithmetic laws let us delete three lines of a proof
Tue, 20 May 1997 11:41:26 +0200 Added comment: it is SLOW
paulson [Tue, 20 May 1997 11:41:26 +0200] rev 3239
Added comment: it is SLOW
Tue, 20 May 1997 11:41:01 +0200 Some theorems moved to HOL/Arith.ML
paulson [Tue, 20 May 1997 11:41:01 +0200] rev 3238
Some theorems moved to HOL/Arith.ML
Tue, 20 May 1997 11:40:28 +0200 Relation "less_than" internalizes "<" for easy use of TFL
paulson [Tue, 20 May 1997 11:40:28 +0200] rev 3237
Relation "less_than" internalizes "<" for easy use of TFL
Tue, 20 May 1997 11:39:32 +0200 New pattern-matching definition of pred_nat
paulson [Tue, 20 May 1997 11:39:32 +0200] rev 3236
New pattern-matching definition of pred_nat
Tue, 20 May 1997 11:38:50 +0200 The diff laws must be named: we do "Delsimps [diff_Suc];"
paulson [Tue, 20 May 1997 11:38:50 +0200] rev 3235
The diff laws must be named: we do "Delsimps [diff_Suc];"
(0) -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip