Thu, 04 May 1995 02:01:49 +0200 case is defined using pattern-matching
lcp [Thu, 04 May 1995 02:01:49 +0200] rev 1108
case is defined using pattern-matching
Thu, 04 May 1995 02:01:24 +0200 Modified proofs for new form of 'split'.
lcp [Thu, 04 May 1995 02:01:24 +0200] rev 1107
Modified proofs for new form of 'split'.
Thu, 04 May 1995 02:00:38 +0200 Added pattern-matching code from CHOL/Prod.thy. Changed
lcp [Thu, 04 May 1995 02:00:38 +0200] rev 1106
Added pattern-matching code from CHOL/Prod.thy. Changed definitions so that split is now defined in terms of fst, snd. Now split is polymorphic. Deleted fsplit, as split(...)::o gives a similar effect -- NOT identical though, as fsplit(P,z) implied that z was a pair, while split(P,z) means only P(fst(z),snd(z)).
Wed, 03 May 1995 17:38:27 +0200 Modified proofs for (q)split, fst, snd for new
lcp [Wed, 03 May 1995 17:38:27 +0200] rev 1105
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.
Wed, 03 May 1995 17:30:36 +0200 Changed to use split instead of fsplit. The weakening of fsplitE appears not
lcp [Wed, 03 May 1995 17:30:36 +0200] rev 1104
Changed to use split instead of fsplit. The weakening of fsplitE appears not to affect existing proofs.
Wed, 03 May 1995 17:22:18 +0200 prove_case_equation now calls uses meta_eq_to_obj_eq to cope
lcp [Wed, 03 May 1995 17:22:18 +0200] rev 1103
prove_case_equation now calls uses meta_eq_to_obj_eq to cope with new form of 'split'. Tried calling simp_tac instead of using resolution with trans, but it was significantly slower: 98.3 secs instead of 91.2 secs for ex/Enum.
Wed, 03 May 1995 16:46:17 +0200 show_sorts:=true forces display of types
lcp [Wed, 03 May 1995 16:46:17 +0200] rev 1102
show_sorts:=true forces display of types
Wed, 03 May 1995 16:30:39 +0200 trivial rewording
lcp [Wed, 03 May 1995 16:30:39 +0200] rev 1101
trivial rewording
Wed, 03 May 1995 16:10:41 +0200 trivial change
lcp [Wed, 03 May 1995 16:10:41 +0200] rev 1100
trivial change
Wed, 03 May 1995 15:33:40 +0200 Covers wrapper tacticals: setwrapper, ..., addss
lcp [Wed, 03 May 1995 15:33:40 +0200] rev 1099
Covers wrapper tacticals: setwrapper, ..., addss
Wed, 03 May 1995 15:25:30 +0200 fixed bug in thy_unchanged that occurred when the .thy file was changed
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
Wed, 03 May 1995 15:06:41 +0200 Changed definitions so that qsplit is now defined in terms of
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.
Wed, 03 May 1995 14:54:43 +0200 Modified proofs for (q)split, fst, snd for new
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.
Wed, 03 May 1995 14:41:36 +0200 Changed some definitions and proofs to use pattern-matching.
lcp [Wed, 03 May 1995 14:41:36 +0200] rev 1095
Changed some definitions and proofs to use pattern-matching.
Wed, 03 May 1995 14:27:51 +0200 Patterns can now be let-bound
lcp [Wed, 03 May 1995 14:27:51 +0200] rev 1094
Patterns can now be let-bound
Wed, 03 May 1995 14:17:01 +0200 Changed to use split instead of fsplit. The weakening of fsplitE appears not
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.
Wed, 03 May 1995 14:03:19 +0200 Changed some definitions and proofs to use pattern-matching.
lcp [Wed, 03 May 1995 14:03:19 +0200] rev 1092
Changed some definitions and proofs to use pattern-matching.
Wed, 03 May 1995 13:55:05 +0200 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.
Wed, 03 May 1995 13:47:24 +0200 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.
Wed, 03 May 1995 13:40:19 +0200 Now show_sorts:=true causes printing of types
lcp [Wed, 03 May 1995 13:40:19 +0200] rev 1089
Now show_sorts:=true causes printing of types
Wed, 03 May 1995 13:35:09 +0200 Imported meta_eq_to_obj_eq from HOL for use with 'split'.
lcp [Wed, 03 May 1995 13:35:09 +0200] rev 1088
Imported meta_eq_to_obj_eq from HOL for use with 'split'.
Wed, 03 May 1995 12:22:17 +0200 replaced store_thm by bind_thm
clasohm [Wed, 03 May 1995 12:22:17 +0200] rev 1087
replaced store_thm by bind_thm
Wed, 03 May 1995 12:17:30 +0200 trivial change
lcp [Wed, 03 May 1995 12:17:30 +0200] rev 1086
trivial change
Wed, 03 May 1995 12:09:05 +0200 new version
lcp [Wed, 03 May 1995 12:09:05 +0200] rev 1085
new version
Wed, 03 May 1995 12:04:21 +0200 Covers defs and re-ordering of theory sections
lcp [Wed, 03 May 1995 12:04:21 +0200] rev 1084
Covers defs and re-ordering of theory sections
Wed, 03 May 1995 11:58:40 +0200 Updates involving defs, addss, etc.
lcp [Wed, 03 May 1995 11:58:40 +0200] rev 1083
Updates involving defs, addss, etc.
Wed, 03 May 1995 08:58:32 +0200 Simplified layout a little.
nipkow [Wed, 03 May 1995 08:58:32 +0200] rev 1082
Simplified layout a little.
Wed, 03 May 1995 08:21:53 +0200 Corrected display of split f t: no more let.
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.
Tue, 02 May 1995 19:59:06 +0200 Sections can now be given in any order.
nipkow [Tue, 02 May 1995 19:59:06 +0200] rev 1080
Sections can now be given in any order.
Mon, 01 May 1995 11:17:41 +0200 Simplified proof of Hausdorff_next_exists.
lcp [Mon, 01 May 1995 11:17:41 +0200] rev 1079
Simplified proof of Hausdorff_next_exists.
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 +3000 +10000 +30000 tip