src/HOL/ex/Primes.ML
Fri, 04 Feb 2000 11:36:11 +0100 paulson new theorem gcd_add_mult
Sat, 09 Jan 1999 15:24:11 +0100 nipkow Refined arith tactic.
Fri, 31 Jul 1998 11:03:21 +0200 paulson Removal of obsolete "open" commands from heads of .ML files
Wed, 15 Jul 1998 14:19:02 +0200 paulson More tidying and removal of "\!\!... from Goal commands
Wed, 15 Jul 1998 10:15:13 +0200 paulson Removal of leading "\!\!..." from most Goal commands
Mon, 22 Jun 1998 17:26:46 +0200 wenzelm isatool fixgoal;
Fri, 01 May 1998 22:30:42 +0200 oheimb Auto_tac: now uses enhanced version of asm_full_simp_tac,
Tue, 21 Apr 1998 10:49:15 +0200 paulson expandshort; new gcd_induct with inbuilt case analysis
Mon, 20 Apr 1998 10:37:00 +0200 paulson proving fib(gcd(m,n)) = gcd(fib m, fib n)
Wed, 11 Mar 1998 09:33:56 +0100 nipkow New Asm_full_simp_tac led to a loop.
Sat, 07 Mar 1998 16:29:29 +0100 nipkow Removed `addsplits [expand_if]'
Wed, 03 Dec 1997 17:25:43 +0100 nipkow Replaced n ~= 0 by 0 < n
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, 26 Sep 1997 10:21:14 +0200 paulson Minor tidying to use Clarify_tac, etc.
Fri, 04 Jul 1997 11:57:33 +0200 paulson New comments on how to deal with unproved termination conditions
Mon, 23 Jun 1997 10:42:03 +0200 paulson Ran expandshort
Fri, 30 May 1997 15:24:27 +0200 paulson New results including the basis for unique factorization
Tue, 27 May 1997 13:26:42 +0200 paulson New theorems suggested by Florian Kammueller
Thu, 22 May 1997 15:11:56 +0200 paulson Now the recdef induction rule variables are named u, v, ...
Wed, 21 May 1997 10:55:42 +0200 paulson TFL induction rule is now curried
Tue, 20 May 1997 11:44:02 +0200 paulson Renamed egcd and gcd; defined the gcd function using TFL
Fri, 18 Oct 1996 11:33:02 +0200 paulson Replaced excluded_middle_tac by case_tac
Fri, 14 Jun 1996 12:34:56 +0200 paulson New example of greatest common divisor
less more (0) tip