Wed, 29 Apr 1998 11:38:52 +0200 wenzelm removed typedef.ML, record.ML;
Wed, 29 Apr 1998 11:37:58 +0200 wenzelm renamed to Tools/typedef_package.ML;
Wed, 29 Apr 1998 11:36:53 +0200 wenzelm adapted to new PureThy.add_axioms_i;
Wed, 29 Apr 1998 11:36:08 +0200 wenzelm adapted to new PureThy.add_tthmss;
Wed, 29 Apr 1998 11:35:24 +0200 wenzelm Theory.require;
Wed, 29 Apr 1998 11:34:11 +0200 wenzelm adapted to new PureThy.add_axioms;
Wed, 29 Apr 1998 11:33:44 +0200 wenzelm new theory section 'nonterminals';
Wed, 29 Apr 1998 11:33:27 +0200 wenzelm adapted to new PureThy.add_defs;
Wed, 29 Apr 1998 11:33:06 +0200 wenzelm Theory.require;
Wed, 29 Apr 1998 11:30:55 +0200 wenzelm tuned setup;
Wed, 29 Apr 1998 11:29:39 +0200 wenzelm tuned setup;
Wed, 29 Apr 1998 11:29:00 +0200 wenzelm tuned names of (add_)store_XXX functions;
Wed, 29 Apr 1998 11:26:59 +0200 wenzelm replaced thy_setup by 'setup' section;
Wed, 29 Apr 1998 11:25:26 +0200 wenzelm added append;
Wed, 29 Apr 1998 11:24:58 +0200 wenzelm added none: 'a -> 'a * 'b attribute list;
Wed, 29 Apr 1998 11:22:52 +0200 wenzelm tuned error msgs;
Wed, 29 Apr 1998 11:22:01 +0200 wenzelm moved mk_defpair to logic.ML;
Wed, 29 Apr 1998 11:20:53 +0200 wenzelm tuned get_ax (uses ancestry);
Wed, 29 Apr 1998 11:17:14 +0200 wenzelm renamed setup to apply;
Wed, 29 Apr 1998 11:14:34 +0200 wenzelm adapted to new PureThy.add_axioms_i;
Wed, 29 Apr 1998 11:13:22 +0200 wenzelm added defaultS: sg -> sort;
Wed, 29 Apr 1998 11:11:36 +0200 wenzelm added thm, thms;
Wed, 29 Apr 1998 11:10:40 +0200 wenzelm *** empty log message ***
Tue, 28 Apr 1998 13:52:18 +0200 paulson new thms, really demos of the final coalgebra theorem
Tue, 28 Apr 1998 13:51:39 +0200 paulson new thms image_0_left, image_Un_left, etc.
Tue, 28 Apr 1998 13:50:41 +0200 paulson new thm mult_lt_mono1
Mon, 27 Apr 1998 19:32:19 +0200 oheimb cleanup for split_all_tac as wrapper in claset()
Mon, 27 Apr 1998 19:30:40 +0200 oheimb removed wrong comment
Mon, 27 Apr 1998 19:29:19 +0200 oheimb added option_map_eq_Some via AddIffs
Mon, 27 Apr 1998 18:06:22 +0200 nipkow *** empty log message ***
Mon, 27 Apr 1998 17:52:03 +0200 nipkow delsplits, Addsplits, Delsplits.
Mon, 27 Apr 1998 16:47:50 +0200 nipkow Renamed expand_const -> split_const
Mon, 27 Apr 1998 16:46:56 +0200 nipkow Added conversion of reg.expr. to automata.
Mon, 27 Apr 1998 16:45:27 +0200 nipkow Renamed expand_const -> split_const.
Mon, 27 Apr 1998 16:45:11 +0200 nipkow Added a few lemmas.
Mon, 27 Apr 1998 13:47:46 +0200 paulson New proof of apply_equality and new thm Pi_image_cons
Fri, 24 Apr 1998 16:18:39 +0200 oheimb improved split_all_tac significantly
Fri, 24 Apr 1998 16:16:29 +0200 oheimb improved keyboard modifiers
Fri, 24 Apr 1998 16:15:34 +0200 oheimb added ASCII translation of subseteq
Fri, 24 Apr 1998 13:06:17 +0200 paulson tidied; div & mod
Fri, 24 Apr 1998 11:22:39 +0200 oheimb *** empty log message ***
Wed, 22 Apr 1998 19:09:44 +0200 wenzelm added no_syn;
Wed, 22 Apr 1998 19:08:49 +0200 wenzelm added mk_cond_defpair, mk_defpair;
Wed, 22 Apr 1998 14:06:05 +0200 nipkow Modifications due to improved simplifier.
Wed, 22 Apr 1998 14:04:35 +0200 nipkow Tried to speed up the rewriter by eta-contracting all patterns beforehand and
Tue, 21 Apr 1998 17:25:19 +0200 oheimb improved pair_tac to call prune_params_tac afterwards
Tue, 21 Apr 1998 17:23:24 +0200 oheimb split_all_tac is now added to claset() _before_ other safe tactics
Tue, 21 Apr 1998 17:22:47 +0200 oheimb made proof of zmult_congruent2 more stable
Tue, 21 Apr 1998 17:22:03 +0200 oheimb simplification of explicit theory usage and merges
Tue, 21 Apr 1998 17:21:42 +0200 oheimb removed split_all_tac from claset() globally within IOA
Tue, 21 Apr 1998 17:20:54 +0200 oheimb made modifications of the simpset() local
Tue, 21 Apr 1998 17:20:28 +0200 oheimb layout improvement
Tue, 21 Apr 1998 10:49:15 +0200 paulson expandshort; new gcd_induct with inbuilt case analysis
Tue, 21 Apr 1998 10:47:58 +0200 paulson Renamed mod_XXX_cancel to mod_XXX_self
Mon, 20 Apr 1998 10:38:30 +0200 paulson New laws for mod
Mon, 20 Apr 1998 10:37:00 +0200 paulson proving fib(gcd(m,n)) = gcd(fib m, fib n)
Sun, 19 Apr 1998 17:01:04 +0200 wenzelm fixed comment;
Fri, 10 Apr 1998 13:42:22 +0200 paulson Fixed bug in inductive sections to allow disjunctive premises;
Fri, 10 Apr 1998 13:41:04 +0200 paulson bug fixes
Fri, 10 Apr 1998 13:40:29 +0200 paulson can prove the empty relation to be WF
(0) -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip