src/HOL/simpdata.ML
Wed, 24 May 2000 18:44:49 +0200 paulson installing the plus_ac0 simprules
Fri, 31 Mar 2000 22:39:06 +0200 wenzelm added cong atts;
Fri, 31 Mar 2000 22:00:36 +0200 wenzelm change_global/local_css move to Provers/clasimp.ML;
Wed, 15 Mar 2000 18:47:28 +0100 wenzelm splitter setup;
Fri, 07 Jan 2000 11:06:03 +0100 paulson tidied parentheses
Tue, 05 Oct 1999 15:24:58 +0200 berghofe Rule not_not is now stored in theory (needed by Inductive).
Wed, 29 Sep 1999 14:38:03 +0200 wenzelm bind_thms;
Tue, 28 Sep 1999 15:12:50 +0200 paulson AC rules for equality
Thu, 23 Sep 1999 13:06:31 +0200 paulson tidied; added lemma restrict_to_left
Tue, 21 Sep 1999 19:11:07 +0200 nipkow Mod because of new solver interface.
Thu, 26 Aug 1999 19:04:19 +0200 wenzelm iff_attrib_setup;
Wed, 25 Aug 1999 20:49:02 +0200 wenzelm proper bootstrap of HOL theory and packages;
Mon, 16 Aug 1999 17:24:28 +0200 oheimb re-added refl in safe_solver
Thu, 29 Jul 1999 12:44:57 +0200 paulson added parentheses to cope with a possible reduction of the precedence of unary
Mon, 19 Jul 1999 15:24:35 +0200 paulson getting rid of qed_goal
Sat, 10 Jul 1999 21:48:27 +0200 wenzelm handle THM/TERM exn;
Thu, 08 Jul 1999 13:38:41 +0200 paulson Now if_weak_cong is a standard congruence rule
Tue, 27 Apr 1999 10:44:17 +0200 wenzelm "iff" attribute;
Wed, 17 Mar 1999 16:53:46 +0100 wenzelm Theory.sign_of;
Wed, 03 Mar 1999 11:15:18 +0100 paulson expandshort
Mon, 01 Mar 1999 18:37:23 +0100 paulson simpler proofs of congruence rules
Thu, 14 Jan 1999 13:18:09 +0100 nipkow More arith refinements.
Thu, 26 Nov 1998 12:18:51 +0100 nipkow Added a general refutation tactic which works by putting things into nnf first.
Thu, 24 Sep 1998 17:16:06 +0200 oheimb simplified CLASIMP_DATA
Wed, 09 Sep 1998 17:34:58 +0200 nipkow Proved and added rewrite rule (@x. x=y) = y to simpset.
Wed, 12 Aug 1998 17:40:18 +0200 oheimb minor adaption for SML/NJ
Wed, 12 Aug 1998 16:21:18 +0200 oheimb the splitter is now defined as a functor
Thu, 06 Aug 1998 15:48:13 +0200 paulson even more tidying of Goal commands
Thu, 30 Jul 1998 19:18:50 +0200 wenzelm made SML/NJ happy;
Thu, 30 Jul 1998 19:02:52 +0200 wenzelm functorized Clasimp module;
Fri, 24 Jul 1998 13:36:49 +0200 berghofe Added functions addIffs and delIffs which operate on clasimpsets.
Thu, 14 May 1998 16:50:09 +0200 oheimb extended addsplits and delsplits to handle also split rules for assumptions
Mon, 27 Apr 1998 16:45:11 +0200 nipkow Added a few lemmas.
Sat, 04 Apr 1998 12:29:07 +0200 wenzelm no open Simplifier;
Thu, 02 Apr 1998 13:48:28 +0200 paulson changed if_bool_eq to if_bool_eq_conj and added if_bool_eq_disj
Fri, 13 Mar 1998 18:15:14 +0100 wenzelm moved addsplits [expand_if] from HOL_basic_ss to HOL_ss;
Thu, 12 Mar 1998 13:17:13 +0100 oheimb renamed not1_or to disj_not1, not2_or to disj_not2
Tue, 10 Mar 1998 18:31:32 +0100 oheimb new rewrite rules not1_or, not2_or, and if_eq_cancel
Fri, 06 Mar 1998 15:19:29 +0100 nipkow expand_if is now by default part of the simpset.
Wed, 04 Mar 1998 13:14:11 +0100 nipkow Reorganized simplifier. May now reorient rules.
Sat, 28 Feb 1998 15:41:17 +0100 nipkow Splitters via named loopers.
Wed, 25 Feb 1998 20:25:27 +0100 oheimb factored out common code of HOL/simpdata.ML and FOL/simpdata.ML concerning
Wed, 25 Feb 1998 15:51:24 +0100 oheimb changed wrapper mechanism of classical reasoner
Fri, 20 Feb 1998 17:56:39 +0100 nipkow Congruence rules use == in premises now.
Wed, 18 Feb 1998 18:42:54 +0100 oheimb corrected problem with auto_tac: now uses a variant of depth_tac that avoids
Thu, 08 Jan 1998 17:42:26 +0100 oheimb replaced fn _ => by K
Wed, 24 Dec 1997 10:02:30 +0100 paulson New Auto_tac (by Oheimb), and new syntax (without parens), and expandshort
Wed, 03 Dec 1997 10:50:02 +0100 paulson Tidying and some comments
Fri, 28 Nov 1997 11:00:42 +0100 paulson Added comments
Fri, 28 Nov 1997 07:41:24 +0100 nipkow Removed dead code.
Fri, 28 Nov 1997 07:37:06 +0100 nipkow Moved the quantifier elimination simp procs into Provers.
Wed, 12 Nov 1997 12:30:15 +0100 oheimb simpdata.ML: renamed split_prem_tac to split_asm_tac, added split_if_asm
Fri, 07 Nov 1997 18:05:25 +0100 oheimb added split_prem_tac
Fri, 07 Nov 1997 18:02:15 +0100 oheimb changed libraray function find to find_index_eq, currying it
Tue, 04 Nov 1997 13:35:13 +0100 wenzelm removed old datatype_info;
Tue, 04 Nov 1997 12:59:01 +0100 nipkow Logic.loops -> Logic.rewrite_rule_ok
Mon, 03 Nov 1997 12:09:37 +0100 wenzelm adapted to new implicit simpset;
Thu, 30 Oct 1997 09:45:03 +0100 nipkow For each datatype `t' there is now a theorem `split_t_case' of the form
Fri, 17 Oct 1997 15:25:12 +0200 nipkow setloop split_tac -> addsplits
Fri, 17 Oct 1997 11:00:50 +0200 paulson New trivial rewrites
less more (0) -100 -60 tip