lcp [Wed, 03 May 1995 16:30:39 +0200] rev 1101
trivial rewording
lcp [Wed, 03 May 1995 16:10:41 +0200] rev 1100
trivial change
lcp [Wed, 03 May 1995 15:33:40 +0200] rev 1099
Covers wrapper tacticals: setwrapper, ..., addss
clasohm [Wed, 03 May 1995 15:25:30 +0200] rev 1098
fixed bug in thy_unchanged that occurred when the .thy file was changed
but the .ML file hadn't been read before;
tmpfile is now deleted immediatly after reading the .thy file in use_thy
lcp [Wed, 03 May 1995 15:06:41 +0200] rev 1097
Changed definitions so that qsplit is now defined in terms of
qfst, qsnd. AT PRESENT THERE IS NO PATTERN-MATCHING FOR QSPLIT.
lcp [Wed, 03 May 1995 14:54:43 +0200] rev 1096
Modified proofs for (q)split, fst, snd for new
definitions. The rule f(q)splitE is now called (q)splitE and is weaker than
before. The rule '(q)split' is now a meta-equality; this required modifying
all proofs involving e.g. split RS trans.
lcp [Wed, 03 May 1995 14:41:36 +0200] rev 1095
Changed some definitions and proofs to use pattern-matching.
lcp [Wed, 03 May 1995 14:27:51 +0200] rev 1094
Patterns can now be let-bound
lcp [Wed, 03 May 1995 14:17:01 +0200] rev 1093
Changed to use split instead of fsplit. The weakening of fsplitE appears not
to affect existing proofs.
lcp [Wed, 03 May 1995 14:03:19 +0200] rev 1092
Changed some definitions and proofs to use pattern-matching.
lcp [Wed, 03 May 1995 13:55:05 +0200] rev 1091
Changed some definitions and proofs to use pattern-matching.
lcp [Wed, 03 May 1995 13:47:24 +0200] rev 1090
Changed some definitions and proofs to use pattern-matching.
lcp [Wed, 03 May 1995 13:40:19 +0200] rev 1089
Now show_sorts:=true causes printing of types
lcp [Wed, 03 May 1995 13:35:09 +0200] rev 1088
Imported meta_eq_to_obj_eq from HOL for use with 'split'.
clasohm [Wed, 03 May 1995 12:22:17 +0200] rev 1087
replaced store_thm by bind_thm
lcp [Wed, 03 May 1995 12:17:30 +0200] rev 1086
trivial change
lcp [Wed, 03 May 1995 12:09:05 +0200] rev 1085
new version
lcp [Wed, 03 May 1995 12:04:21 +0200] rev 1084
Covers defs and re-ordering of theory sections
lcp [Wed, 03 May 1995 11:58:40 +0200] rev 1083
Updates involving defs, addss, etc.
nipkow [Wed, 03 May 1995 08:58:32 +0200] rev 1082
Simplified layout a little.
nipkow [Wed, 03 May 1995 08:21:53 +0200] rev 1081
Corrected display of split f t: no more let.
Also replaced "_abs" by "_lambda" --- the former was a mistake which
happended to work.
nipkow [Tue, 02 May 1995 19:59:06 +0200] rev 1080
Sections can now be given in any order.
lcp [Mon, 01 May 1995 11:17:41 +0200] rev 1079
Simplified proof of Hausdorff_next_exists.
nipkow [Fri, 28 Apr 1995 15:38:15 +0200] rev 1078
Added
functor f() = struct end
to hide functors to save space.
lcp [Fri, 28 Apr 1995 11:52:43 +0200] rev 1077
Renamed insert_kbrl to insert_tagged_brl and exported it. Now
subgoals_of_brl calls nprems_of, which is faster than length o prems_of.
lcp [Fri, 28 Apr 1995 11:41:59 +0200] rev 1076
Modified proofs for new claset primitives. The problem is that they enforce
the "most recent added rule has priority" policy more strictly now.
lcp [Fri, 28 Apr 1995 11:31:33 +0200] rev 1075
Modified proofs for new claset primitives. The problem is that they enforce
the "most recent added rule has priority" policy more strictly now.
lcp [Fri, 28 Apr 1995 11:24:32 +0200] rev 1074
Modified proofs for new claset primitives. The problem is that they enforce
the "most recent added rule has priority" policy more strictly now.
lcp [Fri, 28 Apr 1995 10:57:40 +0200] rev 1073
Recoded addSIs, etc., so that nets are built incrementally
instead of from scratch each time. The old approach used excessive time (>1
sec for adding a rule to ZF_cs) and probably excessive space. Now rep_claset
includes all record fields. joinrules no longer sorts the rules on number of
subgoals, since it does not see the full set of them; instead the number of
subgoals modifies the priority.
lcp [Tue, 25 Apr 1995 11:14:03 +0200] rev 1072
updated version