src/HOL/MiniML/W.ML
Tue, 07 Sep 1999 10:40:58 +0200 wenzelm isatool expandshort;
Mon, 23 Aug 1999 15:30:26 +0200 wenzelm isatool expandshort;
Thu, 29 Apr 1999 18:34:30 +0200 nipkow Proof mods due to eta contraction during rewriting.
Tue, 19 Jan 1999 11:18:11 +0100 paulson removal of the (thm list) argument of mk_cases
Sat, 09 Jan 1999 15:24:11 +0100 nipkow Refined arith tactic.
Fri, 16 Oct 1998 17:32:29 +0200 nipkow Mods because of: Installed trans_tac in solver of simpset().
Thu, 20 Aug 1998 16:18:39 +0200 paulson Must remove less_imp_le from simpset
Fri, 24 Jul 1998 13:19:38 +0200 berghofe Adapted to new datatype package.
Fri, 03 Jul 1998 10:37:04 +0200 nipkow Removed leading !! in goals.
Mon, 22 Jun 1998 17:26:46 +0200 wenzelm isatool fixgoal;
Tue, 10 Mar 1998 20:24:28 +0100 nipkow Mod because of new simplifier.
Sat, 07 Mar 1998 16:29:29 +0100 nipkow Removed `addsplits [expand_if]'
Tue, 30 Dec 1997 11:14:09 +0100 nipkow nth -> !
Tue, 16 Dec 1997 17:58:03 +0100 wenzelm expandshort;
Fri, 05 Dec 1997 17:14:36 +0100 wenzelm adapted proofs to cope with simprocs nat_cancel (by Stefan Berghofer);
Mon, 03 Nov 1997 12:13:18 +0100 wenzelm isatool fixclasimp;
Mon, 03 Nov 1997 09:58:06 +0100 nipkow expand_option_bind -> split_option_bind
Thu, 30 Oct 1997 09:46:11 +0100 nipkow Updated proofs
Fri, 17 Oct 1997 15:25:12 +0200 nipkow setloop split_tac -> addsplits
Fri, 10 Oct 1997 19:02:28 +0200 wenzelm fixed dots;
Tue, 20 May 1997 11:41:56 +0200 paulson New arithmetic laws let us delete three lines of a proof
Thu, 15 May 1997 15:51:47 +0200 oheimb renamed unsafe_addss to addss
Wed, 23 Apr 1997 11:02:19 +0200 paulson Ran expandshort
Tue, 22 Apr 1997 11:45:22 +0200 paulson Ran expandshort
Fri, 14 Mar 1997 10:37:01 +0100 nipkow Modified proofs because simplifier does not eta-contract any longer.
Mon, 10 Mar 1997 10:32:32 +0100 paulson The contr_tac, which replaces a fast_tac, is needed only because eq_assume_tac
Fri, 07 Mar 1997 10:21:11 +0100 paulson Deleted steps made redundant by the stronger eq_assume_tac
Sat, 15 Feb 1997 17:52:31 +0100 oheimb reflecting my recent changes of the simplifier and classical reasoner
Fri, 14 Feb 1997 16:01:43 +0100 narasche Some lemmas changed to valuesd
Fri, 17 Jan 1997 18:50:04 +0100 nipkow The new version of MiniML including "let".
Fri, 17 Jan 1997 11:09:19 +0100 paulson New miniscoping rules for the bounded quantifiers and UN/INT operators
Thu, 10 Oct 1996 10:47:26 +0200 paulson Tidied some proofs: changed needed for de Morgan laws
Mon, 07 Oct 1996 10:34:58 +0200 paulson Tidied up some proofs
Thu, 26 Sep 1996 12:47:47 +0200 paulson Ran expandshort
Thu, 05 Sep 1996 10:29:20 +0200 paulson Miniscoping rules are deleted, as these brittle proofs
Tue, 20 Aug 1996 12:32:16 +0200 paulson Some tidying. This brittle proof depends upon
Mon, 19 Aug 1996 11:17:20 +0200 paulson Tidied some proofs, maybe using less_SucE
Thu, 20 Jun 1996 10:27:29 +0200 paulson Restored Addsimps [Suc_le_lessD], as it cannot be added
Mon, 22 Apr 1996 15:42:20 +0200 nipkow inserted Suc_less_eq explictly in a few proofs.
Wed, 28 Feb 1996 16:57:14 +0100 nipkow modified priorities in syntax
Fri, 09 Feb 1996 13:41:59 +0100 nipkow Introduced qed_spec_mp.
Tue, 30 Jan 1996 15:24:36 +0100 clasohm expanded tabs
Fri, 08 Dec 1995 19:48:15 +0100 nipkow Introduced Monad syntax Pat := Val; Cont
Wed, 25 Oct 1995 09:46:46 +0100 nipkow New theory: type inference for let-free MiniML
less more (0) tip