src/HOL/Integ/Bin.ML
Thu, 15 Jul 1999 10:33:16 +0200 paulson qed_goal -> Goal; new theorems nat_le_0, nat_le_eq_zle and zdiff_int
Wed, 14 Jul 1999 10:39:26 +0200 paulson new constant folding rewrites
Tue, 13 Jul 1999 10:43:31 +0200 paulson new theorem zmult_eq_0_iff
Mon, 12 Jul 1999 10:32:30 +0200 paulson new theorems for the "at most" relation
Fri, 09 Jul 1999 10:45:09 +0200 paulson products of signs as equivalences
Thu, 08 Jul 1999 13:43:42 +0200 paulson Introduction of integer division algorithm
Tue, 06 Jul 1999 21:14:34 +0200 wenzelm use generic numeral encoding and syntax;
Wed, 23 Jun 1999 10:36:59 +0200 paulson rewrite rules to distribute CONSTANT multiplication over sum and difference;
Mon, 24 May 1999 15:54:12 +0200 paulson Better simplification of (nat #0), (int (Suc 0)), etc
Wed, 17 Mar 1999 16:53:46 +0100 wenzelm Theory.sign_of;
Wed, 03 Mar 1999 11:15:18 +0100 paulson expandshort
Wed, 27 Jan 1999 17:11:39 +0100 nipkow arith_tac for min/max
Thu, 14 Jan 1999 13:18:09 +0100 nipkow More arith refinements.
Wed, 13 Jan 1999 08:41:28 +0100 nipkow Simplified arithmetic.
Tue, 12 Jan 1999 15:59:35 +0100 nipkow Restructured Arithmatic
Mon, 11 Jan 1999 16:50:49 +0100 nipkow More arith simplifications.
Sat, 09 Jan 1999 15:24:11 +0100 nipkow Refined arith tactic.
Tue, 05 Jan 1999 17:28:14 +0100 nipkow Instantiated lin.arith.
Mon, 28 Dec 1998 16:46:44 +0100 paulson fixed comments
Fri, 30 Oct 1998 10:43:12 +0100 paulson Explicit (and improved) simprules for binary arithmetic.
Fri, 23 Oct 1998 18:47:44 +0200 paulson Now users will never see (int 0)
Thu, 01 Oct 1998 18:25:18 +0200 paulson better handling of literals
Tue, 29 Sep 1998 15:57:42 +0200 paulson many renamings and changes. Simproc for cancelling common terms in relations
Fri, 25 Sep 1998 13:57:01 +0200 paulson Renaming of Integ/Integ.* to Integ/Int.*, and renaming of related constants
Thu, 24 Sep 1998 17:07:24 +0200 paulson renamed some axioms; some new theorems
Wed, 23 Sep 1998 10:25:37 +0200 paulson much renaming and reorganization
Mon, 21 Sep 1998 10:43:09 +0200 paulson much renaming and tidying
Fri, 18 Sep 1998 16:05:08 +0200 paulson improved (but still flawed) treatment of binary arithmetic
Tue, 15 Sep 1998 15:06:29 +0200 paulson revised treatment of integers
Fri, 31 Jul 1998 10:50:47 +0200 paulson tidied
Fri, 24 Jul 1998 17:55:57 +0200 wenzelm added ex/MonoidGroups (record example);
Fri, 24 Jul 1998 13:19:38 +0200 berghofe Adapted to new datatype package.
Mon, 22 Jun 1998 17:26:46 +0200 wenzelm isatool fixgoal;
Sat, 07 Mar 1998 16:29:29 +0100 nipkow Removed `addsplits [expand_if]'
Fri, 20 Feb 1998 17:56:51 +0100 nipkow Congruence rules use == in premises now.
Mon, 10 Nov 1997 15:25:12 +0100 wenzelm ASCII-fied;
Mon, 03 Nov 1997 12:13:18 +0100 wenzelm isatool fixclasimp;
Fri, 17 Oct 1997 15:25:12 +0200 nipkow setloop split_tac -> addsplits
Fri, 18 Apr 1997 11:54:54 +0200 paulson Renamed sign constructors to eliminate clash with the Plus infix of Sum.thy
Tue, 26 Nov 1996 15:59:28 +0100 paulson New material from Norbert Voelker for efficient binary comparisons
Tue, 30 Jul 1996 17:33:26 +0200 berghofe Classical tactics now use default claset.
Fri, 29 Mar 1996 13:18:26 +0100 paulson Binary integers and their numeric syntax
less more (0) tip